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.r550-tall-171734898900241.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 FireWire-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 101K Jun 2 16:33 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 FireWire-PT-10-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717362112206

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 21:01:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:01:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:01:53] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 21:01:53] [INFO ] Transformed 131 places.
[2024-06-02 21:01:53] [INFO ] Transformed 409 transitions.
[2024-06-02 21:01:53] [INFO ] Found NUPN structural information;
[2024-06-02 21:01:53] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 351
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 130 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 130 transition count 344
Applied a total of 9 rules in 32 ms. Remains 130 /131 variables (removed 1) and now considering 344/353 (removed 9) transitions.
[2024-06-02 21:01:53] [INFO ] Flow matrix only has 318 transitions (discarded 26 similar events)
// Phase 1: matrix 318 rows 130 cols
[2024-06-02 21:01:53] [INFO ] Computed 8 invariants in 14 ms
[2024-06-02 21:01:53] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-02 21:01:53] [INFO ] Flow matrix only has 318 transitions (discarded 26 similar events)
[2024-06-02 21:01:53] [INFO ] Invariant cache hit.
[2024-06-02 21:01:53] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:01:53] [INFO ] Implicit Places using invariants and state equation in 175 ms returned [13, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 425 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/131 places, 344/353 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 344/344 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 482 ms. Remains : 128/131 places, 344/353 transitions.
Support contains 92 out of 128 places after structural reductions.
[2024-06-02 21:01:54] [INFO ] Flatten gal took : 57 ms
[2024-06-02 21:01:54] [INFO ] Flatten gal took : 25 ms
[2024-06-02 21:01:54] [INFO ] Input system was already deterministic with 344 transitions.
Support contains 89 out of 128 places (down from 92) after GAL structural reductions.
RANDOM walk for 40000 steps (2209 resets) in 2026 ms. (19 steps per ms) remains 35/68 properties
BEST_FIRST walk for 4003 steps (62 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (51 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (102 resets) in 59 ms. (66 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (46 resets) in 92 ms. (43 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (71 resets) in 70 ms. (56 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (61 resets) in 69 ms. (57 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (50 resets) in 67 ms. (58 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (48 resets) in 47 ms. (83 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (64 resets) in 65 ms. (60 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (65 resets) in 58 ms. (67 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (74 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (62 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (73 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (73 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (76 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (77 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (56 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (65 resets) in 39 ms. (100 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (50 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (73 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (59 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (53 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (60 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (64 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (64 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (65 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (51 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (42 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (50 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (77 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (49 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (65 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (62 resets) in 14 ms. (266 steps per ms) remains 32/35 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
[2024-06-02 21:01:55] [INFO ] Flow matrix only has 318 transitions (discarded 26 similar events)
// Phase 1: matrix 318 rows 128 cols
[2024-06-02 21:01:55] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 21:01:55] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/121 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 3/124 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 317/441 variables, 124/130 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 44/174 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 4/445 variables, 4/178 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 1/446 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 0/446 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 179 constraints, problems are : Problem set: 1 solved, 31 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Problem AtomicPropp58 is UNSAT
At refinement iteration 1 (OVERLAPS) 72/121 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-02 21:01:57] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 11 ms to minimize.
[2024-06-02 21:01:57] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:01:57] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:01:57] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 3/124 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-02 21:01:57] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 1 ms to minimize.
[2024-06-02 21:01:58] [INFO ] Deduced a trap composed of 15 places in 299 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 317/441 variables, 124/136 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 44/180 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 27/207 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-02 21:01:58] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2024-06-02 21:01:58] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 2/209 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-02 21:01:59] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/210 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 0/210 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 4/445 variables, 4/214 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 3/217 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-02 21:02:00] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-02 21:02:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 2/219 constraints. Problems are: Problem set: 2 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/446 variables, and 219 constraints, problems are : Problem set: 2 solved, 30 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 128/128 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 30/32 constraints, Known Traps: 11/11 constraints]
After SMT, in 6493ms problems are : Problem set: 2 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 344/344 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 128 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 125 transition count 335
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 125 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 124 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 123 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 122 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 121 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 120 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 120 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 119 transition count 322
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 119 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 119 transition count 319
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 119 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 118 transition count 318
Applied a total of 28 rules in 110 ms. Remains 118 /128 variables (removed 10) and now considering 318/344 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 118/128 places, 318/344 transitions.
RANDOM walk for 40000 steps (2265 resets) in 382 ms. (104 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4001 steps (66 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (53 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (115 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (55 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (71 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (56 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (59 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (52 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (59 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (67 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (66 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (80 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (74 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (59 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (54 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (53 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (66 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (59 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (55 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (51 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (51 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (55 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (59 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (57 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (56 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
[2024-06-02 21:02:02] [INFO ] Flow matrix only has 294 transitions (discarded 24 similar events)
// Phase 1: matrix 294 rows 118 cols
[2024-06-02 21:02:02] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 21:02:02] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 67/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 3/114 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 294/408 variables, 114/120 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 43/163 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 4/412 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/412 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 167 constraints, problems are : Problem set: 0 solved, 27 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 67/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 21:02:03] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 3/114 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 21:02:03] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 294/408 variables, 114/122 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 24/189 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 21:02:04] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:02:04] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 4/412 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 21:02:05] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 21:02:05] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 0/412 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 200 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3498 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 6/6 constraints]
After SMT, in 4392ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 18 properties in 8138 ms.
Support contains 16 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 318/318 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 320
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 117 transition count 317
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 117 transition count 318
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 115 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 115 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 114 transition count 313
Applied a total of 14 rules in 62 ms. Remains 114 /118 variables (removed 4) and now considering 313/318 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 114/118 places, 313/318 transitions.
RANDOM walk for 40000 steps (2286 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (520 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (566 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (555 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (619 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (547 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (638 resets) in 158 ms. (251 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (771 resets) in 176 ms. (226 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (802 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (562 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 873793 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :7 out of 9
Probabilistic random walk after 873793 steps, saw 180189 distinct states, run finished after 3009 ms. (steps per millisecond=290 ) properties seen :7
[2024-06-02 21:02:18] [INFO ] Flow matrix only has 286 transitions (discarded 27 similar events)
// Phase 1: matrix 286 rows 114 cols
[2024-06-02 21:02:18] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:02:18] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 277/371 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/399 variables, 19/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/400 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/400 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:02:18] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 277/371 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/399 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 42/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:02:18] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:02:18] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/400 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/400 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 163 ms.
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 313/313 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 111 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 111 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 110 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 110 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 109 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 108 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 108 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 107 transition count 301
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 107 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 107 transition count 298
Applied a total of 17 rules in 54 ms. Remains 107 /114 variables (removed 7) and now considering 298/313 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 107/114 places, 298/313 transitions.
RANDOM walk for 40000 steps (2326 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (793 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (570 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1140116 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :0 out of 2
Probabilistic random walk after 1140116 steps, saw 240324 distinct states, run finished after 3001 ms. (steps per millisecond=379 ) properties seen :0
[2024-06-02 21:02:22] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
// Phase 1: matrix 269 rows 107 cols
[2024-06-02 21:02:22] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 21:02:22] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 79/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 260/347 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/375 variables, 19/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/376 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 79/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:02:22] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 260/347 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/375 variables, 19/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:02:22] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/376 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/376 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 8 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 298/298 transitions.
Applied a total of 0 rules in 25 ms. Remains 107 /107 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 107/107 places, 298/298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 298/298 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2024-06-02 21:02:22] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2024-06-02 21:02:22] [INFO ] Invariant cache hit.
[2024-06-02 21:02:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 21:02:22] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2024-06-02 21:02:22] [INFO ] Invariant cache hit.
[2024-06-02 21:02:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:02:22] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-02 21:02:23] [INFO ] Redundant transitions in 16 ms returned []
Running 296 sub problems to find dead transitions.
[2024-06-02 21:02:23] [INFO ] Flow matrix only has 269 transitions (discarded 29 similar events)
[2024-06-02 21:02:23] [INFO ] Invariant cache hit.
[2024-06-02 21:02:23] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-02 21:02:24] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:02:24] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-06-02 21:02:24] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:02:24] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2024-06-02 21:02:24] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-02 21:02:25] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 269/375 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 159 constraints, problems are : Problem set: 0 solved, 296 unsolved in 11361 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 269/375 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 296/454 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-02 21:02:37] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:02:40] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:02:41] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 458 constraints, problems are : Problem set: 0 solved, 296 unsolved in 24885 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 9/9 constraints]
After SMT, in 36475ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 36479ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36813 ms. Remains : 107/107 places, 298/298 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 102 edges and 107 vertex of which 20 / 107 are part of one of the 3 SCC in 3 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 89 transition count 179
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 21 place count 89 transition count 177
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 87 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 86 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 86 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 85 transition count 175
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 84 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 84 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 83 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 82 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 82 transition count 144
Free-agglomeration rule applied 4 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 82 transition count 138
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 44 place count 78 transition count 137
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 78 transition count 137
Applied a total of 46 rules in 34 ms. Remains 78 /107 variables (removed 29) and now considering 137/298 (removed 161) transitions.
Running SMT prover for 2 properties.
[2024-06-02 21:02:59] [INFO ] Flow matrix only has 136 transitions (discarded 1 similar events)
// Phase 1: matrix 136 rows 78 cols
[2024-06-02 21:02:59] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:02:59] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:02:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 21:02:59] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 21:02:59] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-02 21:02:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
TRAPS : Iteration 1
[2024-06-02 21:02:59] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-06-02 21:02:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
TRAPS : Iteration 2
[2024-06-02 21:02:59] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:02:59] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 241 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-06-02 21:02:59] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:02:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:02:59] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:02:59] [INFO ] Input system was already deterministic with 344 transitions.
Support contains 80 out of 128 places (down from 85) after GAL structural reductions.
Computed a total of 23 stabilizing places and 48 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 122 transition count 331
Applied a total of 12 rules in 30 ms. Remains 122 /128 variables (removed 6) and now considering 331/344 (removed 13) transitions.
[2024-06-02 21:02:59] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
// Phase 1: matrix 305 rows 122 cols
[2024-06-02 21:02:59] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 21:02:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 21:02:59] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 21:02:59] [INFO ] Invariant cache hit.
[2024-06-02 21:02:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 21:03:00] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-02 21:03:00] [INFO ] Redundant transitions in 7 ms returned []
Running 328 sub problems to find dead transitions.
[2024-06-02 21:03:00] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 21:03:00] [INFO ] Invariant cache hit.
[2024-06-02 21:03:00] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-02 21:03:01] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 13 ms to minimize.
[2024-06-02 21:03:01] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
[2024-06-02 21:03:01] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:03:01] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2024-06-02 21:03:01] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:03:02] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:03:02] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:03:02] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 304/425 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (OVERLAPS) 1/426 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/427 variables, and 178 constraints, problems are : Problem set: 0 solved, 328 unsolved in 12380 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 304/425 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 328/505 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-02 21:03:17] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:03:17] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:03:18] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 3/508 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 1/426 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/427 variables, and 509 constraints, problems are : Problem set: 0 solved, 328 unsolved in 29301 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 11/11 constraints]
After SMT, in 41933ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 41938ms
Starting structural reductions in SI_CTL mode, iteration 1 : 122/128 places, 331/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42182 ms. Remains : 122/128 places, 331/344 transitions.
[2024-06-02 21:03:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:03:42] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:03:42] [INFO ] Input system was already deterministic with 331 transitions.
[2024-06-02 21:03:42] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:03:42] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:03:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17267469358419648353.gal : 13 ms
[2024-06-02 21:03:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality13043502346185214496.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17267469358419648353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13043502346185214496.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,9.67097e+06,6.06947,170244,2,8576,5,453286,6,0,818,559080,0


Converting to forward existential form...Done !
original formula: EF((E((p32==1) U ((AG(((p118==1)||(p105==1))) * (((p30==0)||(p114==0))||(p24==1))) * ((p4==0)&&((p46==0)||(p80==1))))) * AG((((p65==0)&&(...177
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E((p32==1) U ((!(E(TRUE U !(((p118==1)||(p105==1))))) * (((p30==0)||(p114==0))||(p24==1))) ...253
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...694
(forward)formula 0,0,21.1331,512700,1,0,932,2.70732e+06,689,476,7104,2.13213e+06,1019
FORMULA FireWire-PT-10-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 111 transition count 305
Applied a total of 34 rules in 46 ms. Remains 111 /128 variables (removed 17) and now considering 305/344 (removed 39) transitions.
[2024-06-02 21:04:03] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
// Phase 1: matrix 279 rows 111 cols
[2024-06-02 21:04:03] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:04:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 21:04:03] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 21:04:03] [INFO ] Invariant cache hit.
[2024-06-02 21:04:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:04:03] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-02 21:04:03] [INFO ] Redundant transitions in 3 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-02 21:04:03] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 21:04:03] [INFO ] Invariant cache hit.
[2024-06-02 21:04:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:04:04] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:04:04] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:04:04] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:04:05] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:04:05] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 278/388 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:04:08] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:04:10] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:04:15] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/390 variables, and 163 constraints, problems are : Problem set: 0 solved, 302 unsolved in 17134 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 278/388 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 302/464 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:04:30] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:04:35] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/390 variables, and 467 constraints, problems are : Problem set: 0 solved, 302 unsolved in 25882 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 10/10 constraints]
After SMT, in 43203ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 43206ms
Starting structural reductions in SI_CTL mode, iteration 1 : 111/128 places, 305/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43548 ms. Remains : 111/128 places, 305/344 transitions.
[2024-06-02 21:04:47] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:04:47] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:04:47] [INFO ] Input system was already deterministic with 305 transitions.
[2024-06-02 21:04:47] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:04:47] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:04:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality7685705171893485457.gal : 4 ms
[2024-06-02 21:04:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality16883850915889635076.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/CTLCardinality7685705171893485457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16883850915889635076.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,9.44654e+06,3.71606,117440,2,5782,5,304347,6,0,748,391545,0


Converting to forward existential form...Done !
original formula: EG(EF((p110==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p110==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...633
Detected timeout of ITS tools.
[2024-06-02 21:05:17] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:05:17] [INFO ] Applying decomposition
[2024-06-02 21:05:17] [INFO ] Flatten gal took : 10 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/graph11144814330946085012.txt' '-o' '/tmp/graph11144814330946085012.bin' '-w' '/tmp/graph11144814330946085012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11144814330946085012.bin' '-l' '-1' '-v' '-w' '/tmp/graph11144814330946085012.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:05:17] [INFO ] Decomposing Gal with order
[2024-06-02 21:05:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:05:17] [INFO ] Removed a total of 475 redundant transitions.
[2024-06-02 21:05:17] [INFO ] Flatten gal took : 50 ms
[2024-06-02 21:05:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 15 ms.
[2024-06-02 21:05:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality13030763720464909881.gal : 4 ms
[2024-06-02 21:05:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality8823736482997497625.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/CTLCardinality13030763720464909881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8823736482997497625.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,9.44654e+06,9.99908,248460,2095,230,293719,1458,589,1.5769e+06,85,14848,0


Converting to forward existential form...Done !
original formula: EG(EF((i6.u36.p110==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i6.u36.p110==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t40, t44, t45, t47, t55, t60, t65, t70, t75, t78, t90, t95, t132, t133, t134, t136, ...762
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 126 transition count 338
Applied a total of 6 rules in 18 ms. Remains 126 /128 variables (removed 2) and now considering 338/344 (removed 6) transitions.
[2024-06-02 21:05:47] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
// Phase 1: matrix 312 rows 126 cols
[2024-06-02 21:05:47] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:05:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:05:47] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 21:05:47] [INFO ] Invariant cache hit.
[2024-06-02 21:05:47] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:05:47] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-06-02 21:05:47] [INFO ] Redundant transitions in 4 ms returned []
Running 337 sub problems to find dead transitions.
[2024-06-02 21:05:47] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 21:05:47] [INFO ] Invariant cache hit.
[2024-06-02 21:05:47] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-02 21:05:49] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 4 ms to minimize.
[2024-06-02 21:05:49] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:05:49] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:05:49] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:05:49] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 311/437 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (OVERLAPS) 1/438 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 337 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 182 constraints, problems are : Problem set: 0 solved, 337 unsolved in 14228 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 311/437 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 337/518 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-02 21:06:08] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-02 21:06:16] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:06:21] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 337 unsolved
SMT process timed out in 44463ms, After SMT, problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 44467ms
Starting structural reductions in SI_CTL mode, iteration 1 : 126/128 places, 338/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44791 ms. Remains : 126/128 places, 338/344 transitions.
[2024-06-02 21:06:32] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:06:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:06:32] [INFO ] Input system was already deterministic with 338 transitions.
[2024-06-02 21:06:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:06:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:06:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality14829177453378205672.gal : 2 ms
[2024-06-02 21:06:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality3010945905219071276.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/CTLCardinality14829177453378205672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3010945905219071276.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.18424e+07,2.32937,68380,2,2856,5,202264,6,0,841,206114,0


Converting to forward existential form...Done !
original formula: A(((!(AF(EG((((p25==1)||(p129==0))||(p72==1))))) + (p99==0)) + (p127==1)) U AG((EF((p56==1)) + (((p14==0)||(p95==1)) * ((EF((p5==1)) + (p...204
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((E(TRUE U (p56==1)) + (((p14==0)||(p95==1)) * ((E(TRUE U (p5==1)) + (p128!=1)) + (...577
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t18, t20, t24, t25, t27, t28, t30, t32, t36, t37,...712
Detected timeout of ITS tools.
[2024-06-02 21:07:02] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:07:02] [INFO ] Applying decomposition
[2024-06-02 21:07:02] [INFO ] Flatten gal took : 9 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/graph6708327840421446863.txt' '-o' '/tmp/graph6708327840421446863.bin' '-w' '/tmp/graph6708327840421446863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6708327840421446863.bin' '-l' '-1' '-v' '-w' '/tmp/graph6708327840421446863.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:07:02] [INFO ] Decomposing Gal with order
[2024-06-02 21:07:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:07:02] [INFO ] Removed a total of 541 redundant transitions.
[2024-06-02 21:07:02] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:07:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 7 ms.
[2024-06-02 21:07:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality15988743919181228879.gal : 3 ms
[2024-06-02 21:07:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality786687725625148770.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/CTLCardinality15988743919181228879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality786687725625148770.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18424e+07,6.3766,164152,2014,231,226679,1930,645,730057,86,16426,0


Converting to forward existential form...Done !
original formula: A(((!(AF(EG((((i3.i0.u5.p25==1)||(i1.u3.p129==0))||(i7.i0.u23.p72==1))))) + (i5.u34.p99==0)) + (i1.u3.p127==1)) U AG((EF((i4.u19.p56==1))...304
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((E(TRUE U (i4.u19.p56==1)) + (((i3.i0.u4.p14==0)||(i5.u32.p95==1)) * ((E(TRUE U (i...801
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t43, t46, t47, t49, t55, t57, t62, t67, t72, t77, t92, t95, t97, t134, t135, t136, ...830
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 126 transition count 339
Applied a total of 5 rules in 3 ms. Remains 126 /128 variables (removed 2) and now considering 339/344 (removed 5) transitions.
[2024-06-02 21:07:32] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 126 cols
[2024-06-02 21:07:32] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:07:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 21:07:32] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
[2024-06-02 21:07:32] [INFO ] Invariant cache hit.
[2024-06-02 21:07:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:07:32] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2024-06-02 21:07:32] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
[2024-06-02 21:07:32] [INFO ] Invariant cache hit.
[2024-06-02 21:07:32] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-06-02 21:07:34] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:07:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:07:34] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 0 ms to minimize.
[2024-06-02 21:07:34] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:07:34] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 312/438 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/439 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (OVERLAPS) 0/439 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 182 constraints, problems are : Problem set: 0 solved, 338 unsolved in 13931 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 312/438 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 338/519 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-06-02 21:07:53] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:07:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:07:54] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (OVERLAPS) 1/439 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 523 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 8/8 constraints]
After SMT, in 44156ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 44161ms
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 339/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44491 ms. Remains : 126/128 places, 339/344 transitions.
[2024-06-02 21:08:17] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:08:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:08:17] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-02 21:08:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:08:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:08:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality16894129070807341671.gal : 2 ms
[2024-06-02 21:08:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality1153766086972739295.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/CTLCardinality16894129070807341671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1153766086972739295.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.2152e+07,2.39803,77516,2,2988,5,226791,6,0,842,235699,0


Converting to forward existential form...Done !
original formula: AX(AG(((EF(((p88==0)||(p122==1))) + (p26==1)) + ((A(((p48==0)||(p77==1)) U ((p117==0)||(p79==1))) * (p5==1)) * ((p14==0)||(p20==1))))))
=> equivalent forward existential formula: [(((FwdU(EY(Init),TRUE) * !(((!((E(!(((p117==0)||(p79==1))) U (!(((p48==0)||(p77==1))) * !(((p117==0)||(p79==1))...290
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...718
(forward)formula 0,0,10.0311,267456,1,0,968,1.21497e+06,713,494,7403,1.18505e+06,1064
FORMULA FireWire-PT-10-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 118 transition count 321
Applied a total of 20 rules in 24 ms. Remains 118 /128 variables (removed 10) and now considering 321/344 (removed 23) transitions.
[2024-06-02 21:08:27] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 118 cols
[2024-06-02 21:08:27] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 21:08:27] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:08:27] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 21:08:27] [INFO ] Invariant cache hit.
[2024-06-02 21:08:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:08:27] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-06-02 21:08:27] [INFO ] Redundant transitions in 1 ms returned []
Running 318 sub problems to find dead transitions.
[2024-06-02 21:08:27] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 21:08:27] [INFO ] Invariant cache hit.
[2024-06-02 21:08:27] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 21:08:28] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:08:28] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:08:28] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:08:28] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:08:29] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-06-02 21:08:29] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:08:29] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:08:29] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 294/411 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 1/412 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 21:08:36] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/413 variables, and 173 constraints, problems are : Problem set: 0 solved, 318 unsolved in 15234 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 294/411 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 318/490 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 21:08:46] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:08:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 21:08:53] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (OVERLAPS) 1/412 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 11 (OVERLAPS) 0/412 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/413 variables, and 494 constraints, problems are : Problem set: 0 solved, 318 unsolved in 29904 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 12/12 constraints]
After SMT, in 45331ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 45334ms
Starting structural reductions in SI_CTL mode, iteration 1 : 118/128 places, 321/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45660 ms. Remains : 118/128 places, 321/344 transitions.
[2024-06-02 21:09:12] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:09:12] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:09:12] [INFO ] Input system was already deterministic with 321 transitions.
[2024-06-02 21:09:12] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:09:12] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:09:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality17498613371361626124.gal : 2 ms
[2024-06-02 21:09:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality13911968897693078451.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/CTLCardinality17498613371361626124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13911968897693078451.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,9.58886e+06,5.54791,169828,2,8153,5,441578,6,0,792,554912,0


Converting to forward existential form...Done !
original formula: A((p122==1) U AF(AG((!(((p51==0)||(p124==1))) + AF(((p129==0)||(p61==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !((!(((p51==0)||(p124==1))) + !(EG(!(((p129==0)||(p61==1)))))))))))))))) * !(...368
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...670
Detected timeout of ITS tools.
[2024-06-02 21:09:42] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:09:42] [INFO ] Applying decomposition
[2024-06-02 21:09:42] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4782130461802263074.txt' '-o' '/tmp/graph4782130461802263074.bin' '-w' '/tmp/graph4782130461802263074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4782130461802263074.bin' '-l' '-1' '-v' '-w' '/tmp/graph4782130461802263074.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:09:42] [INFO ] Decomposing Gal with order
[2024-06-02 21:09:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:09:43] [INFO ] Removed a total of 512 redundant transitions.
[2024-06-02 21:09:43] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:09:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 8 ms.
[2024-06-02 21:09:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality11743478459196150354.gal : 2 ms
[2024-06-02 21:09:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality7376873398563483070.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/CTLCardinality11743478459196150354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7376873398563483070.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,9.58886e+06,2.68001,88584,2073,96,142927,1485,597,370103,77,8349,0


Converting to forward existential form...Done !
original formula: A((i0.u41.p122==1) U AF(AG((!(((i2.i2.u14.p51==0)||(i0.u42.p124==1))) + AF(((i1.u3.p129==0)||(i4.u20.p61==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !((!(((i2.i2.u14.p51==0)||(i0.u42.p124==1))) + !(EG(!(((i1.u3.p129==0)||(i4.u...465
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t40, t41, t44, t45, t47, t55, t60, t65, t66, t70, t75, t90, t93, t95, t132, t133, t1...803
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,19.3174,471308,1,0,732021,1712,3070,1.90388e+06,309,8349,1633032
FORMULA FireWire-PT-10-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 113 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 112 transition count 306
Applied a total of 34 rules in 48 ms. Remains 112 /128 variables (removed 16) and now considering 306/344 (removed 38) transitions.
[2024-06-02 21:10:02] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 112 cols
[2024-06-02 21:10:02] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:10:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 21:10:02] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 21:10:02] [INFO ] Invariant cache hit.
[2024-06-02 21:10:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:10:02] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-02 21:10:02] [INFO ] Redundant transitions in 1 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-02 21:10:02] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 21:10:02] [INFO ] Invariant cache hit.
[2024-06-02 21:10:02] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 21:10:04] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:10:04] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:10:04] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:10:04] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 11260 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 21:10:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 21:10:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 469 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 6/6 constraints]
After SMT, in 41450ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 41455ms
Starting structural reductions in SI_CTL mode, iteration 1 : 112/128 places, 306/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41723 ms. Remains : 112/128 places, 306/344 transitions.
[2024-06-02 21:10:44] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:10:44] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:10:44] [INFO ] Input system was already deterministic with 306 transitions.
[2024-06-02 21:10:44] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:10:44] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:10:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15592504711686271820.gal : 2 ms
[2024-06-02 21:10:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18295961271641175197.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15592504711686271820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18295961271641175197.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (2222 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (791 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Finished probabilistic random walk after 15873 steps, run visited all 1 properties in 44 ms. (steps per millisecond=360 )
Probabilistic random walk after 15873 steps, saw 5157 distinct states, run finished after 59 ms. (steps per millisecond=269 ) properties seen :1
FORMULA FireWire-PT-10-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 126 transition count 338
Applied a total of 6 rules in 2 ms. Remains 126 /128 variables (removed 2) and now considering 338/344 (removed 6) transitions.
[2024-06-02 21:10:44] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
// Phase 1: matrix 312 rows 126 cols
[2024-06-02 21:10:44] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:10:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:10:44] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 21:10:44] [INFO ] Invariant cache hit.
[2024-06-02 21:10:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:10:44] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2024-06-02 21:10:44] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 21:10:44] [INFO ] Invariant cache hit.
[2024-06-02 21:10:44] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-02 21:10:46] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:10:46] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:10:46] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:10:46] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:10:46] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 311/437 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (OVERLAPS) 1/438 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 337 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 182 constraints, problems are : Problem set: 0 solved, 337 unsolved in 14331 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 311/437 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 337/518 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-02 21:11:05] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-02 21:11:13] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:11:17] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 337 unsolved
SMT process timed out in 44555ms, After SMT, problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 44558ms
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 338/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44889 ms. Remains : 126/128 places, 338/344 transitions.
[2024-06-02 21:11:29] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:11:29] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:11:29] [INFO ] Input system was already deterministic with 338 transitions.
[2024-06-02 21:11:29] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:11:29] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:11:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality4842103169421291426.gal : 2 ms
[2024-06-02 21:11:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality12283837457877542274.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/CTLCardinality4842103169421291426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12283837457877542274.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.18424e+07,2.04616,68368,2,2856,5,202264,6,0,841,206114,0


Converting to forward existential form...Done !
original formula: EF((EF(AG(((p120==0)||(p78==1)))) * EG(AG(AX((p73==1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * E(TRUE U !(E(TRUE U !(((p120==0)||(p78==1))))))),!(E(TRUE U !(!(EX(!((p73==1))))))))] !...162
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t18, t20, t24, t25, t27, t28, t30, t32, t36, t37,...712
(forward)formula 0,1,11.7594,315092,1,0,723,1.58266e+06,703,371,7204,1.06883e+06,830
FORMULA FireWire-PT-10-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 321
Applied a total of 20 rules in 6 ms. Remains 119 /128 variables (removed 9) and now considering 321/344 (removed 23) transitions.
[2024-06-02 21:11:41] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 119 cols
[2024-06-02 21:11:41] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 21:11:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 21:11:41] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 21:11:41] [INFO ] Invariant cache hit.
[2024-06-02 21:11:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 21:11:41] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-06-02 21:11:41] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 21:11:41] [INFO ] Invariant cache hit.
[2024-06-02 21:11:41] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 21:11:43] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:11:43] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:11:43] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:11:43] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:11:43] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/413 variables, 119/130 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 41/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 1/414 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 0/414 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 172 constraints, problems are : Problem set: 0 solved, 320 unsolved in 12561 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/413 variables, 119/130 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 41/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 320/491 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 21:11:57] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 21:12:04] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:12:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:12:05] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 1/414 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 496 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 9/9 constraints]
After SMT, in 42792ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 42795ms
Starting structural reductions in LTL mode, iteration 1 : 119/128 places, 321/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43013 ms. Remains : 119/128 places, 321/344 transitions.
[2024-06-02 21:12:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:12:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:12:24] [INFO ] Input system was already deterministic with 321 transitions.
[2024-06-02 21:12:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:12:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:12:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality3610551950827030616.gal : 5 ms
[2024-06-02 21:12:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality2468731387049646310.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/CTLCardinality3610551950827030616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2468731387049646310.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.16984e+07,7.00008,203580,2,9074,5,538341,6,0,796,694155,0


Converting to forward existential form...Done !
original formula: E(AF((!(AX((((p109==0)||(p51==1))&&(p104==0)))) * ((p3==0)||(p5==1)))) U EF(!((AG((p99!=1)) + E(!(((p88==0)||(p36==1))) U (p85!=1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(FwdU(Init,!(EG(!((!(!(EX(!((((p109==0)||(p51==1))&&(p104==0)))))) * ((p3==0)||(p5==1))))))),TRUE) *...228
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...675
Detected timeout of ITS tools.
[2024-06-02 21:12:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:12:54] [INFO ] Applying decomposition
[2024-06-02 21:12:54] [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/graph9310648146106279254.txt' '-o' '/tmp/graph9310648146106279254.bin' '-w' '/tmp/graph9310648146106279254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9310648146106279254.bin' '-l' '-1' '-v' '-w' '/tmp/graph9310648146106279254.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:12:54] [INFO ] Decomposing Gal with order
[2024-06-02 21:12:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:12:54] [INFO ] Removed a total of 507 redundant transitions.
[2024-06-02 21:12:54] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:12:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 7 ms.
[2024-06-02 21:12:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality3516589298850665269.gal : 3 ms
[2024-06-02 21:12:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality6284864772516499633.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/CTLCardinality3516589298850665269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6284864772516499633.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16984e+07,5.73746,169932,2535,218,197631,2942,680,1.0409e+06,87,30550,0


Converting to forward existential form...Done !
original formula: E(AF((!(AX((((i6.i0.u37.p109==0)||(i2.i1.u14.p51==1))&&(i6.i0.u36.p104==0)))) * ((i5.u0.p3==0)||(i0.i2.u1.p5==1)))) U EF(!((AG((i0.i2.u25...232
=> equivalent forward existential formula: [(FwdU((FwdU(FwdU(Init,!(EG(!((!(!(EX(!((((i6.i0.u37.p109==0)||(i2.i1.u14.p51==1))&&(i6.i0.u36.p104==0)))))) * (...307
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t70, t71, t76, t80, t91, t94, t133, t134, t1...811
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,27.0713,634164,1,0,674469,7469,3767,4.11354e+06,391,60575,1706958
FORMULA FireWire-PT-10-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 111 transition count 305
Applied a total of 34 rules in 32 ms. Remains 111 /128 variables (removed 17) and now considering 305/344 (removed 39) transitions.
[2024-06-02 21:13:21] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
// Phase 1: matrix 279 rows 111 cols
[2024-06-02 21:13:21] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:13:21] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 21:13:21] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 21:13:21] [INFO ] Invariant cache hit.
[2024-06-02 21:13:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:13:21] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-06-02 21:13:21] [INFO ] Redundant transitions in 1 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-02 21:13:21] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 21:13:21] [INFO ] Invariant cache hit.
[2024-06-02 21:13:21] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:13:23] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:13:23] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 278/388 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:13:26] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:13:28] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:13:33] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/390 variables, and 163 constraints, problems are : Problem set: 0 solved, 302 unsolved in 17074 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 278/388 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 302/464 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:13:48] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 21:13:53] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/390 variables, and 467 constraints, problems are : Problem set: 0 solved, 302 unsolved in 26224 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 10/10 constraints]
After SMT, in 43463ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 43466ms
Starting structural reductions in SI_CTL mode, iteration 1 : 111/128 places, 305/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43748 ms. Remains : 111/128 places, 305/344 transitions.
[2024-06-02 21:14:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:14:05] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:14:05] [INFO ] Input system was already deterministic with 305 transitions.
[2024-06-02 21:14:05] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:14:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:14:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12835015284359920101.gal : 12 ms
[2024-06-02 21:14:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5283204104753998738.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12835015284359920101.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5283204104753998738.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5283204104753998738.prop.
RANDOM walk for 40000 steps (2358 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 17
BEST_FIRST walk for 40003 steps (566 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 22
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :22 after 34
Finished probabilistic random walk after 15845 steps, run visited all 1 properties in 34 ms. (steps per millisecond=466 )
Probabilistic random walk after 15845 steps, saw 5130 distinct states, run finished after 34 ms. (steps per millisecond=466 ) properties seen :1
FORMULA FireWire-PT-10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 340
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 125 transition count 339
Applied a total of 5 rules in 13 ms. Remains 125 /128 variables (removed 3) and now considering 339/344 (removed 5) transitions.
[2024-06-02 21:14:05] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 125 cols
[2024-06-02 21:14:05] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:14:05] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-02 21:14:05] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
[2024-06-02 21:14:05] [INFO ] Invariant cache hit.
[2024-06-02 21:14:05] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 21:14:05] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-06-02 21:14:05] [INFO ] Redundant transitions in 2 ms returned []
Running 336 sub problems to find dead transitions.
[2024-06-02 21:14:05] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
[2024-06-02 21:14:05] [INFO ] Invariant cache hit.
[2024-06-02 21:14:05] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 21:14:06] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:14:07] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:14:07] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:14:07] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:14:07] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:14:07] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:14:08] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (OVERLAPS) 312/436 variables, 124/137 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 43/180 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 21:14:11] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:14:11] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (OVERLAPS) 1/437 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 21:14:17] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (OVERLAPS) 0/437 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/438 variables, and 184 constraints, problems are : Problem set: 0 solved, 336 unsolved in 18846 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (OVERLAPS) 312/436 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 43/183 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 336/519 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 21:14:28] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:14:30] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (OVERLAPS) 1/437 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 21:14:40] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/438 variables, and 523 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 13/13 constraints]
After SMT, in 49073ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 49078ms
Starting structural reductions in SI_CTL mode, iteration 1 : 125/128 places, 339/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49406 ms. Remains : 125/128 places, 339/344 transitions.
[2024-06-02 21:14:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:14:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:14:54] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-02 21:14:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:14:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:14:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6798836558932222131.gal : 2 ms
[2024-06-02 21:14:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality2842461644129207469.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/CTLCardinality6798836558932222131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2842461644129207469.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,9.98352e+06,1.59571,55700,2,2440,5,176937,6,0,838,175797,0


Converting to forward existential form...Done !
original formula: AF(!(E((((AG(((p129==0)||(p4==1))) + A((p20==0) U ((p26==0)||(p78==1)))) * (p88!=1)) * A((p96==0) U (p29==0))) U !(EG(((p89==0)||(p33==1)...161
=> equivalent forward existential formula: [FwdG(Init,!(!(E((((!(E(TRUE U !(((p129==0)||(p4==1))))) + !((E(!(((p26==0)||(p78==1))) U (!((p20==0)) * !(((p26...332
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36,...712
Detected timeout of ITS tools.
[2024-06-02 21:15:25] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:15:25] [INFO ] Applying decomposition
[2024-06-02 21:15:25] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1738320287711630316.txt' '-o' '/tmp/graph1738320287711630316.bin' '-w' '/tmp/graph1738320287711630316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1738320287711630316.bin' '-l' '-1' '-v' '-w' '/tmp/graph1738320287711630316.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:15:25] [INFO ] Decomposing Gal with order
[2024-06-02 21:15:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:15:25] [INFO ] Removed a total of 539 redundant transitions.
[2024-06-02 21:15:25] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:15:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 8 ms.
[2024-06-02 21:15:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality17536594960385641338.gal : 2 ms
[2024-06-02 21:15:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality3757910184586588492.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/CTLCardinality17536594960385641338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3757910184586588492.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,9.98352e+06,3.71,104988,1821,224,137910,1444,652,516642,88,12383,0


Converting to forward existential form...Done !
original formula: AF(!(E((((AG(((i2.u3.p129==0)||(i1.i0.u1.p4==1))) + A((i1.i0.u6.p20==0) U ((i1.i0.u4.p26==0)||(i7.u24.p78==1)))) * (i2.u29.p88!=1)) * A((...235
=> equivalent forward existential formula: [FwdG(Init,!(!(E((((!(E(TRUE U !(((i2.u3.p129==0)||(i1.i0.u1.p4==1))))) + !((E(!(((i1.i0.u4.p26==0)||(i7.u24.p78...450
Reverse transition relation is NOT exact ! Due to transitions t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t84, t91, t94, t96, t133, t134, t135, ...829
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 312
Applied a total of 26 rules in 31 ms. Remains 115 /128 variables (removed 13) and now considering 312/344 (removed 32) transitions.
[2024-06-02 21:15:55] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
// Phase 1: matrix 286 rows 115 cols
[2024-06-02 21:15:55] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:15:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 21:15:55] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2024-06-02 21:15:55] [INFO ] Invariant cache hit.
[2024-06-02 21:15:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:15:55] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 21:15:55] [INFO ] Redundant transitions in 1 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-02 21:15:55] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2024-06-02 21:15:55] [INFO ] Invariant cache hit.
[2024-06-02 21:15:55] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:15:56] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:15:56] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:15:56] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:15:56] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:15:56] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:15:57] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:15:57] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 285/399 variables, 114/127 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/401 variables, and 166 constraints, problems are : Problem set: 0 solved, 309 unsolved in 12581 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 285/399 variables, 114/127 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 309/474 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:16:11] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:16:13] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:16:17] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 1/400 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 11 (OVERLAPS) 0/400 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/401 variables, and 478 constraints, problems are : Problem set: 0 solved, 309 unsolved in 24745 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 10/10 constraints]
After SMT, in 37488ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 37492ms
Starting structural reductions in SI_CTL mode, iteration 1 : 115/128 places, 312/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37765 ms. Remains : 115/128 places, 312/344 transitions.
[2024-06-02 21:16:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:16:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:16:32] [INFO ] Input system was already deterministic with 312 transitions.
[2024-06-02 21:16:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:16:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:16:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality13283307079678914273.gal : 1 ms
[2024-06-02 21:16:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality18318106190816815564.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/CTLCardinality13283307079678914273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18318106190816815564.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.16372e+07,6.52435,184716,2,6528,5,519438,6,0,771,623525,0


Converting to forward existential form...Done !
original formula: EF((AG(((p33==0)||(p126==1))) + EG(((((p90==1)&&(p43!=0))&&((p33!=1)&&(p34!=1))) + (EF(((p22!=0)&&(p73!=1))) * AF((p110!=1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((p33==0)||(p126==1))))))] != FALSE + [FwdG(FwdU(Init,TRUE),((((p90==1)&&(p43!...252
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...652
(forward)formula 0,1,26.2667,627796,1,0,587,2.9844e+06,643,302,6427,2.10236e+06,670
FORMULA FireWire-PT-10-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 126 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 125 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 124 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 124 transition count 334
Applied a total of 9 rules in 5 ms. Remains 124 /128 variables (removed 4) and now considering 334/344 (removed 10) transitions.
[2024-06-02 21:16:59] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
// Phase 1: matrix 308 rows 124 cols
[2024-06-02 21:16:59] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 21:16:59] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:16:59] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
[2024-06-02 21:16:59] [INFO ] Invariant cache hit.
[2024-06-02 21:16:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 21:16:59] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-06-02 21:16:59] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
[2024-06-02 21:16:59] [INFO ] Invariant cache hit.
[2024-06-02 21:16:59] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 21:17:01] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:17:01] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:17:01] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:17:01] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:17:01] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:17:01] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 307/431 variables, 124/136 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 43/179 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (OVERLAPS) 1/432 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (OVERLAPS) 0/432 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 180 constraints, problems are : Problem set: 0 solved, 333 unsolved in 13970 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 307/431 variables, 124/136 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 43/179 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 333/512 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 21:17:19] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:17:22] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:17:22] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:17:23] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 21:17:28] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 10 (OVERLAPS) 1/432 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 518 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 11/11 constraints]
After SMT, in 44225ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 44230ms
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 334/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44502 ms. Remains : 124/128 places, 334/344 transitions.
[2024-06-02 21:17:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:17:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:17:43] [INFO ] Input system was already deterministic with 334 transitions.
[2024-06-02 21:17:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:17:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:17:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality8041812250076807583.gal : 2 ms
[2024-06-02 21:17:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality13426517598447514565.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/CTLCardinality8041812250076807583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13426517598447514565.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.21097e+07,1.48046,47600,2,2834,5,124424,6,0,829,128885,0


Converting to forward existential form...Done !
original formula: !(E(((p99==0)||(p53==1)) U ((!(AX((p91==0))) * !((((p12==0)&&((p20==0)||(p54==1)))&&(p119!=0)))) + !((EF(((p127==0)||(p114==1))) + (p52==...162
=> equivalent forward existential formula: ([(EY((FwdU(Init,((p99==0)||(p53==1))) * !((((p12==0)&&((p20==0)||(p54==1)))&&(p119!=0))))) * !((p91==0)))] = FA...259
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...705
Hit Full ! (commute/partial/dont) 317/0/17
(forward)formula 0,0,6.90388,175148,1,0,622,599141,695,317,7090,588093,698
FORMULA FireWire-PT-10-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 113 transition count 307
Applied a total of 32 rules in 28 ms. Remains 113 /128 variables (removed 15) and now considering 307/344 (removed 37) transitions.
[2024-06-02 21:17:50] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 113 cols
[2024-06-02 21:17:50] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 21:17:51] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:17:51] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:17:51] [INFO ] Invariant cache hit.
[2024-06-02 21:17:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:17:51] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-06-02 21:17:51] [INFO ] Redundant transitions in 1 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-02 21:17:51] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:17:51] [INFO ] Invariant cache hit.
[2024-06-02 21:17:51] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:17:52] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:17:52] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:17:53] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:17:53] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:17:53] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/394 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 164 constraints, problems are : Problem set: 0 solved, 306 unsolved in 9720 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 306/469 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:18:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:18:10] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:18:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 473 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 8/8 constraints]
After SMT, in 39934ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 39938ms
Starting structural reductions in SI_CTL mode, iteration 1 : 113/128 places, 307/344 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40190 ms. Remains : 113/128 places, 307/344 transitions.
[2024-06-02 21:18:31] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:18:31] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:18:31] [INFO ] Input system was already deterministic with 307 transitions.
[2024-06-02 21:18:31] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:18:31] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:18:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality13467684584019589864.gal : 2 ms
[2024-06-02 21:18:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality7586132467385754276.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/CTLCardinality13467684584019589864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7586132467385754276.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.1577e+07,6.75809,184512,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: (!(E(!(((p73==1)&&(!(((p97==1)||(p25==0))||(p50==1))))) U ((((EG(AG((p42==1))) + AG((p0==1))) + (((p44==1)&&((p101==0)||(p72==1)))||(!(((...300
=> equivalent forward existential formula: ((([FwdG(((FwdU(Init,!(((p73==1)&&(!(((p97==1)||(p25==0))||(p50==1)))))) * (((p57==1)||(p57==0))||(p114==1))) * ...693
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...639
Detected timeout of ITS tools.
[2024-06-02 21:19:01] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:19:01] [INFO ] Applying decomposition
[2024-06-02 21:19:01] [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/graph14092870862354600107.txt' '-o' '/tmp/graph14092870862354600107.bin' '-w' '/tmp/graph14092870862354600107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14092870862354600107.bin' '-l' '-1' '-v' '-w' '/tmp/graph14092870862354600107.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:19:01] [INFO ] Decomposing Gal with order
[2024-06-02 21:19:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:19:01] [INFO ] Removed a total of 480 redundant transitions.
[2024-06-02 21:19:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:19:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 4 ms.
[2024-06-02 21:19:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality4093501366618172363.gal : 2 ms
[2024-06-02 21:19:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality8312446755781880760.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/CTLCardinality4093501366618172363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8312446755781880760.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,2.18621,66600,1703,167,102568,1709,581,233183,86,9523,0


Converting to forward existential form...Done !
original formula: (!(E(!(((i6.i0.u23.p73==1)&&(!(((i5.u32.p97==1)||(i3.i0.u8.p25==0))||(i3.i1.u17.p50==1))))) U ((((EG(AG((i3.i1.u14.p42==1))) + AG((i3.i0....460
=> equivalent forward existential formula: ((([FwdG(((FwdU(Init,!(((i6.i0.u23.p73==1)&&(!(((i5.u32.p97==1)||(i3.i0.u8.p25==0))||(i3.i1.u17.p50==1)))))) * (...1001
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t79, t88, t89, t90, t91, t96, t137...761
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 316
Applied a total of 24 rules in 12 ms. Remains 117 /128 variables (removed 11) and now considering 316/344 (removed 28) transitions.
[2024-06-02 21:19:31] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
// Phase 1: matrix 290 rows 117 cols
[2024-06-02 21:19:31] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:19:31] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 21:19:31] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2024-06-02 21:19:31] [INFO ] Invariant cache hit.
[2024-06-02 21:19:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 21:19:31] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2024-06-02 21:19:31] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2024-06-02 21:19:31] [INFO ] Invariant cache hit.
[2024-06-02 21:19:31] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 21:19:33] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:19:33] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:19:33] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:19:33] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:19:33] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/406 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/407 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 0/407 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 169 constraints, problems are : Problem set: 0 solved, 315 unsolved in 12264 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/406 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 315/483 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 21:19:47] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 21:19:53] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 10 (OVERLAPS) 1/407 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 487 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 8/8 constraints]
After SMT, in 42487ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 42491ms
Starting structural reductions in LTL mode, iteration 1 : 117/128 places, 316/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42716 ms. Remains : 117/128 places, 316/344 transitions.
[2024-06-02 21:20:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:20:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:20:14] [INFO ] Input system was already deterministic with 316 transitions.
[2024-06-02 21:20:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:20:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:20:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality7398649446919643098.gal : 1 ms
[2024-06-02 21:20:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality4698963322577548937.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/CTLCardinality7398649446919643098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4698963322577548937.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.16573e+07,7.22714,200780,2,8961,5,533336,6,0,783,706435,0


Converting to forward existential form...Done !
original formula: ((AG(((EF((p21==1)) * (p54==1)) * (((p40==0)||(p33==1))&&((p92==0)||(p44==1))))) + AF(((!(E(((p42==0)||(p87==1)) U (p108==0))) + EG((p128...213
=> equivalent forward existential formula: [FwdG(((Init * !(EX(E(TRUE U ((p105==0)&&(p24==1)))))) * !(!(E(TRUE U !(((E(TRUE U (p21==1)) * (p54==1)) * (((p4...294
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...663
Detected timeout of ITS tools.
[2024-06-02 21:20:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:20:44] [INFO ] Applying decomposition
[2024-06-02 21:20:44] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15248616947615120470.txt' '-o' '/tmp/graph15248616947615120470.bin' '-w' '/tmp/graph15248616947615120470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15248616947615120470.bin' '-l' '-1' '-v' '-w' '/tmp/graph15248616947615120470.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:20:44] [INFO ] Decomposing Gal with order
[2024-06-02 21:20:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:20:44] [INFO ] Removed a total of 487 redundant transitions.
[2024-06-02 21:20:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:20:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 4 ms.
[2024-06-02 21:20:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality2593715939567070945.gal : 2 ms
[2024-06-02 21:20:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality7517041212479549862.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/CTLCardinality2593715939567070945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7517041212479549862.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16573e+07,6.42761,176812,1971,154,255999,1481,631,736204,97,9469,0


Converting to forward existential form...Done !
original formula: ((AG(((EF((i1.i0.u6.p21==1)) * (i4.u18.p54==1)) * (((i3.i1.u13.p40==0)||(i2.u12.p33==1))&&((i0.u29.p92==0)||(i3.i0.u14.p44==1))))) + AF((...321
=> equivalent forward existential formula: [FwdG(((Init * !(EX(E(TRUE U ((i6.u38.p105==0)&&(i1.i0.u7.p24==1)))))) * !(!(E(TRUE U !(((E(TRUE U (i1.i0.u6.p21...402
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t79, t80, t84, t91, t94, t133, t134, t1...802
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,23.3376,502008,1,0,748130,2741,3249,1.92333e+06,442,13200,2033157
FORMULA FireWire-PT-10-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-06-02 21:21:07] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:21:07] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:21:07] [INFO ] Applying decomposition
[2024-06-02 21:21:07] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10040155003193132075.txt' '-o' '/tmp/graph10040155003193132075.bin' '-w' '/tmp/graph10040155003193132075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10040155003193132075.bin' '-l' '-1' '-v' '-w' '/tmp/graph10040155003193132075.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:21:07] [INFO ] Decomposing Gal with order
[2024-06-02 21:21:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:21:07] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-02 21:21:07] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:21:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 3 ms.
[2024-06-02 21:21:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4456427380999884819.gal : 3 ms
[2024-06-02 21:21:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality3409056619337864292.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/CTLCardinality4456427380999884819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3409056619337864292.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 4 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.25133e+07,8.16087,193192,2103,236,270129,1794,626,865033,89,15776,0


Converting to forward existential form...Done !
original formula: EG(EF((i5.u36.p110==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i5.u36.p110==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t43, t46, t47, t49, t55, t57, t62, t67, t72, t77, t92, t95, t97, t134, t135, t136, ...827
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,52.4001,1017528,1,0,1.33923e+06,5683,3311,4.59939e+06,375,40913,3053034
FORMULA FireWire-PT-10-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((!(AF(EG((((i2.u4.p25==1)||(i1.u3.p129==0))||(i7.i0.u21.p72==1))))) + (i6.u23.p99==0)) + (i1.u3.p127==1)) U AG((EF((i4.u17.p56==1)) + ...295
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((E(TRUE U (i4.u17.p56==1)) + (((i2.u4.p14==0)||(i6.u31.p95==1)) * ((E(TRUE U (i2.u...780
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 1,0,95.1011,1940952,1,0,2.46677e+06,9497,3471,8.89539e+06,387,85020,5735643
FORMULA FireWire-PT-10-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(!(E((((AG(((i1.u3.p129==0)||(i2.u1.p4==1))) + A((i2.u6.p20==0) U ((i2.u4.p26==0)||(i7.i1.u24.p78==1)))) * (i1.u29.p88!=1)) * A((i6.u32...229
=> equivalent forward existential formula: [FwdG(Init,!(!(E((((!(E(TRUE U !(((i1.u3.p129==0)||(i2.u1.p4==1))))) + !((E(!(((i2.u4.p26==0)||(i7.i1.u24.p78==1...444
(forward)formula 2,0,147.58,2200200,1,0,2.84052e+06,10087,1915,9.77112e+06,227,92598,2668920
FORMULA FireWire-PT-10-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(E(!(((i7.i0.u21.p73==1)&&(!(((i6.u32.p97==1)||(i2.u4.p25==0))||(i2.u15.p50==1))))) U ((((EG(AG((i2.u12.p42==1))) + AG((i6.u20.p0==1)))...446
=> equivalent forward existential formula: ((([FwdG(((FwdU(Init,!(((i7.i0.u21.p73==1)&&(!(((i6.u32.p97==1)||(i2.u4.p25==0))||(i2.u15.p50==1)))))) * (((i4.u...975
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 3,0,183.732,2200200,1,0,2.84052e+06,10087,2622,9.77112e+06,269,92598,5551643
FORMULA FireWire-PT-10-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1338728 ms.

BK_STOP 1717363452048

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="FireWire-PT-10"
export BK_EXAMINATION="CTLCardinality"
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 FireWire-PT-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898900241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-10.tgz
mv FireWire-PT-10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;