fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654447200458
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBNT-PT-S05J40

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16202.436 3600000.00 3906154.00 1735.20 ?????TF?TTTFF??F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447200458.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-PT-S05J40, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 17K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Apr 12 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 346K Apr 12 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 10:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 438K Apr 12 10:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716929934354

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 20:58:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 20:58:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:58:56] [INFO ] Load time of PNML (sax parser for PT used): 357 ms
[2024-05-28 20:58:56] [INFO ] Transformed 629 places.
[2024-05-28 20:58:56] [INFO ] Transformed 1590 transitions.
[2024-05-28 20:58:56] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 556 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 61 ms.
[2024-05-28 20:58:56] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 20:58:56] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 20:58:56] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 20:58:56] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 20:58:56] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 20:58:56] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 20:58:56] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 626 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Applied a total of 0 rules in 89 ms. Remains 629 /629 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Running 929 sub problems to find dead transitions.
[2024-05-28 20:58:57] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-05-28 20:58:57] [INFO ] Computed 102 invariants in 101 ms
[2024-05-28 20:58:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1560 variables, and 91 constraints, problems are : Problem set: 0 solved, 929 unsolved in 20110 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/629 variables, 11/102 constraints. Problems are: Problem set: 95 solved, 834 unsolved
[2024-05-28 20:59:33] [INFO ] Deduced a trap composed of 100 places in 190 ms of which 24 ms to minimize.
[2024-05-28 20:59:34] [INFO ] Deduced a trap composed of 14 places in 314 ms of which 2 ms to minimize.
[2024-05-28 20:59:35] [INFO ] Deduced a trap composed of 24 places in 363 ms of which 6 ms to minimize.
[2024-05-28 20:59:35] [INFO ] Deduced a trap composed of 101 places in 334 ms of which 4 ms to minimize.
[2024-05-28 20:59:35] [INFO ] Deduced a trap composed of 16 places in 322 ms of which 8 ms to minimize.
[2024-05-28 20:59:36] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/1560 variables, and 108 constraints, problems are : Problem set: 95 solved, 834 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/929 constraints, Known Traps: 6/6 constraints]
After SMT, in 42986ms problems are : Problem set: 95 solved, 834 unsolved
Search for dead transitions found 95 dead transitions in 43061ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2024-05-28 20:59:40] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 629 cols
[2024-05-28 20:59:40] [INFO ] Computed 102 invariants in 22 ms
[2024-05-28 20:59:40] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-28 20:59:40] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-05-28 20:59:40] [INFO ] Invariant cache hit.
[2024-05-28 20:59:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:59:41] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 840/935 transitions.
Applied a total of 0 rules in 10 ms. Remains 629 /629 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44393 ms. Remains : 629/629 places, 840/935 transitions.
Support contains 626 out of 629 places after structural reductions.
[2024-05-28 20:59:41] [INFO ] Flatten gal took : 129 ms
[2024-05-28 20:59:42] [INFO ] Flatten gal took : 134 ms
[2024-05-28 20:59:42] [INFO ] Input system was already deterministic with 840 transitions.
Reduction of identical properties reduced properties to check from 81 to 78
RANDOM walk for 40000 steps (2739 resets) in 3620 ms. (11 steps per ms) remains 34/78 properties
BEST_FIRST walk for 4004 steps (47 resets) in 440 ms. (9 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (100 resets) in 64 ms. (61 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (13 resets) in 249 ms. (16 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (20 resets) in 24 ms. (160 steps per ms) remains 29/33 properties
BEST_FIRST walk for 4004 steps (63 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (100 resets) in 53 ms. (74 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (62 resets) in 96 ms. (41 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (120 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (92 resets) in 50 ms. (78 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (99 resets) in 89 ms. (44 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (87 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (70 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (85 resets) in 27 ms. (143 steps per ms) remains 29/29 properties
[2024-05-28 20:59:44] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-05-28 20:59:44] [INFO ] Invariant cache hit.
[2024-05-28 20:59:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 3 (OVERLAPS) 202/601 variables, 75/77 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 2/79 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 6 (OVERLAPS) 28/629 variables, 23/102 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 0/102 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 836/1465 variables, 629/731 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1465 variables, 1/732 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1465 variables, 0/732 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1465 variables, 0/732 constraints. Problems are: Problem set: 26 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1465/1465 variables, and 732 constraints, problems are : Problem set: 26 solved, 3 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 5/5 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 118/158 variables, 1/6 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/6 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 174/332 variables, 29/35 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/35 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 145/477 variables, 29/64 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/64 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 139/616 variables, 26/90 constraints. Problems are: Problem set: 26 solved, 3 unsolved
[2024-05-28 20:59:48] [INFO ] Deduced a trap composed of 272 places in 530 ms of which 33 ms to minimize.
[2024-05-28 20:59:49] [INFO ] Deduced a trap composed of 141 places in 274 ms of which 4 ms to minimize.
[2024-05-28 20:59:49] [INFO ] Deduced a trap composed of 141 places in 271 ms of which 5 ms to minimize.
[2024-05-28 20:59:49] [INFO ] Deduced a trap composed of 141 places in 292 ms of which 5 ms to minimize.
[2024-05-28 20:59:50] [INFO ] Deduced a trap composed of 135 places in 352 ms of which 5 ms to minimize.
[2024-05-28 20:59:50] [INFO ] Deduced a trap composed of 159 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:59:50] [INFO ] Deduced a trap composed of 24 places in 315 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 7/97 constraints. Problems are: Problem set: 26 solved, 3 unsolved
[2024-05-28 20:59:51] [INFO ] Deduced a trap composed of 263 places in 253 ms of which 4 ms to minimize.
[2024-05-28 20:59:51] [INFO ] Deduced a trap composed of 261 places in 285 ms of which 3 ms to minimize.
[2024-05-28 20:59:51] [INFO ] Deduced a trap composed of 266 places in 252 ms of which 3 ms to minimize.
[2024-05-28 20:59:51] [INFO ] Deduced a trap composed of 266 places in 265 ms of which 3 ms to minimize.
[2024-05-28 20:59:52] [INFO ] Deduced a trap composed of 261 places in 183 ms of which 3 ms to minimize.
[2024-05-28 20:59:52] [INFO ] Deduced a trap composed of 260 places in 189 ms of which 3 ms to minimize.
[2024-05-28 20:59:52] [INFO ] Deduced a trap composed of 275 places in 273 ms of which 3 ms to minimize.
[2024-05-28 20:59:52] [INFO ] Deduced a trap composed of 251 places in 244 ms of which 3 ms to minimize.
SMT process timed out in 8490ms, After SMT, problems are : Problem set: 26 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 93 place count 580 transition count 796
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 93 place count 580 transition count 751
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 183 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 534 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 532 transition count 748
Applied a total of 189 rules in 225 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-05-28 20:59:53] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-05-28 20:59:53] [INFO ] Computed 97 invariants in 9 ms
[2024-05-28 20:59:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 20:59:59] [INFO ] Deduced a trap composed of 139 places in 269 ms of which 4 ms to minimize.
[2024-05-28 20:59:59] [INFO ] Deduced a trap composed of 182 places in 224 ms of which 4 ms to minimize.
[2024-05-28 20:59:59] [INFO ] Deduced a trap composed of 173 places in 223 ms of which 4 ms to minimize.
[2024-05-28 21:00:00] [INFO ] Deduced a trap composed of 150 places in 202 ms of which 3 ms to minimize.
[2024-05-28 21:00:00] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 4 ms to minimize.
[2024-05-28 21:00:00] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 3 ms to minimize.
[2024-05-28 21:00:00] [INFO ] Deduced a trap composed of 175 places in 191 ms of which 3 ms to minimize.
[2024-05-28 21:00:01] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:00:01] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-05-28 21:00:01] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 21:00:01] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 2 ms to minimize.
[2024-05-28 21:00:01] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 3 ms to minimize.
[2024-05-28 21:00:01] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 3 ms to minimize.
[2024-05-28 21:00:02] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 7 ms to minimize.
[2024-05-28 21:00:02] [INFO ] Deduced a trap composed of 154 places in 223 ms of which 4 ms to minimize.
[2024-05-28 21:00:02] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 4 ms to minimize.
[2024-05-28 21:00:03] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 4 ms to minimize.
[2024-05-28 21:00:03] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:00:03] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:00:03] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:00:04] [INFO ] Deduced a trap composed of 163 places in 211 ms of which 4 ms to minimize.
[2024-05-28 21:00:04] [INFO ] Deduced a trap composed of 142 places in 197 ms of which 4 ms to minimize.
[2024-05-28 21:00:04] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 4 ms to minimize.
[2024-05-28 21:00:05] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 4 ms to minimize.
[2024-05-28 21:00:05] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 3 ms to minimize.
[2024-05-28 21:00:05] [INFO ] Deduced a trap composed of 172 places in 186 ms of which 3 ms to minimize.
[2024-05-28 21:00:05] [INFO ] Deduced a trap composed of 165 places in 178 ms of which 3 ms to minimize.
[2024-05-28 21:00:05] [INFO ] Deduced a trap composed of 142 places in 180 ms of which 3 ms to minimize.
[2024-05-28 21:00:06] [INFO ] Deduced a trap composed of 144 places in 174 ms of which 3 ms to minimize.
[2024-05-28 21:00:06] [INFO ] Deduced a trap composed of 145 places in 190 ms of which 4 ms to minimize.
[2024-05-28 21:00:06] [INFO ] Deduced a trap composed of 143 places in 179 ms of which 3 ms to minimize.
[2024-05-28 21:00:06] [INFO ] Deduced a trap composed of 144 places in 178 ms of which 2 ms to minimize.
[2024-05-28 21:00:06] [INFO ] Deduced a trap composed of 142 places in 176 ms of which 3 ms to minimize.
[2024-05-28 21:00:07] [INFO ] Deduced a trap composed of 172 places in 219 ms of which 3 ms to minimize.
[2024-05-28 21:00:07] [INFO ] Deduced a trap composed of 146 places in 222 ms of which 3 ms to minimize.
[2024-05-28 21:00:07] [INFO ] Deduced a trap composed of 148 places in 181 ms of which 6 ms to minimize.
[2024-05-28 21:00:07] [INFO ] Deduced a trap composed of 149 places in 211 ms of which 3 ms to minimize.
[2024-05-28 21:00:08] [INFO ] Deduced a trap composed of 150 places in 235 ms of which 3 ms to minimize.
[2024-05-28 21:00:08] [INFO ] Deduced a trap composed of 147 places in 310 ms of which 5 ms to minimize.
[2024-05-28 21:00:08] [INFO ] Deduced a trap composed of 175 places in 276 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 132 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:00:18] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 4 ms to minimize.
[2024-05-28 21:00:18] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-05-28 21:00:19] [INFO ] Deduced a trap composed of 170 places in 313 ms of which 5 ms to minimize.
[2024-05-28 21:00:19] [INFO ] Deduced a trap composed of 163 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:00:19] [INFO ] Deduced a trap composed of 175 places in 213 ms of which 4 ms to minimize.
[2024-05-28 21:00:20] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 3 ms to minimize.
[2024-05-28 21:00:20] [INFO ] Deduced a trap composed of 182 places in 194 ms of which 3 ms to minimize.
[2024-05-28 21:00:20] [INFO ] Deduced a trap composed of 163 places in 167 ms of which 2 ms to minimize.
[2024-05-28 21:00:20] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 2 ms to minimize.
[2024-05-28 21:00:20] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 3 ms to minimize.
[2024-05-28 21:00:21] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 3 ms to minimize.
[2024-05-28 21:00:21] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:00:21] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
[2024-05-28 21:00:21] [INFO ] Deduced a trap composed of 176 places in 222 ms of which 3 ms to minimize.
[2024-05-28 21:00:21] [INFO ] Deduced a trap composed of 154 places in 208 ms of which 4 ms to minimize.
[2024-05-28 21:00:22] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 3 ms to minimize.
[2024-05-28 21:00:22] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-05-28 21:00:22] [INFO ] Deduced a trap composed of 172 places in 212 ms of which 3 ms to minimize.
[2024-05-28 21:00:22] [INFO ] Deduced a trap composed of 150 places in 155 ms of which 3 ms to minimize.
[2024-05-28 21:00:23] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:00:33] [INFO ] Deduced a trap composed of 166 places in 303 ms of which 7 ms to minimize.
[2024-05-28 21:00:33] [INFO ] Deduced a trap composed of 185 places in 241 ms of which 3 ms to minimize.
[2024-05-28 21:00:34] [INFO ] Deduced a trap composed of 182 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1276 variables, and 155 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/742 constraints, Known Traps: 63/63 constraints]
After SMT, in 41287ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 41299ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41529 ms. Remains : 532/629 places, 748/840 transitions.
RANDOM walk for 40000 steps (2083 resets) in 913 ms. (43 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (170 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
[2024-05-28 21:00:34] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 21:00:34] [INFO ] Invariant cache hit.
[2024-05-28 21:00:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/507 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/531 variables, 19/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 744/1275 variables, 531/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1275 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1275 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1276 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1276 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1276 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1276/1276 variables, and 630 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 532/532 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/507 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:00:35] [INFO ] Deduced a trap composed of 84 places in 305 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/531 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:00:36] [INFO ] Deduced a trap composed of 172 places in 252 ms of which 5 ms to minimize.
[2024-05-28 21:00:36] [INFO ] Deduced a trap composed of 170 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:00:36] [INFO ] Deduced a trap composed of 155 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:00:36] [INFO ] Deduced a trap composed of 193 places in 202 ms of which 4 ms to minimize.
[2024-05-28 21:00:37] [INFO ] Deduced a trap composed of 181 places in 184 ms of which 3 ms to minimize.
[2024-05-28 21:00:37] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 3 ms to minimize.
[2024-05-28 21:00:37] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 3 ms to minimize.
[2024-05-28 21:00:37] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 3 ms to minimize.
[2024-05-28 21:00:37] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 3 ms to minimize.
[2024-05-28 21:00:38] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 3 ms to minimize.
[2024-05-28 21:00:38] [INFO ] Deduced a trap composed of 173 places in 191 ms of which 3 ms to minimize.
[2024-05-28 21:00:38] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 3 ms to minimize.
[2024-05-28 21:00:38] [INFO ] Deduced a trap composed of 170 places in 186 ms of which 3 ms to minimize.
[2024-05-28 21:00:39] [INFO ] Deduced a trap composed of 184 places in 246 ms of which 3 ms to minimize.
[2024-05-28 21:00:39] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 3 ms to minimize.
[2024-05-28 21:00:39] [INFO ] Deduced a trap composed of 181 places in 189 ms of which 3 ms to minimize.
[2024-05-28 21:00:39] [INFO ] Deduced a trap composed of 169 places in 183 ms of which 2 ms to minimize.
[2024-05-28 21:00:39] [INFO ] Deduced a trap composed of 166 places in 165 ms of which 2 ms to minimize.
[2024-05-28 21:00:40] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:00:40] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:00:40] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:00:40] [INFO ] Deduced a trap composed of 173 places in 215 ms of which 3 ms to minimize.
[2024-05-28 21:00:41] [INFO ] Deduced a trap composed of 167 places in 208 ms of which 2 ms to minimize.
[2024-05-28 21:00:41] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 2 ms to minimize.
[2024-05-28 21:00:41] [INFO ] Deduced a trap composed of 181 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:00:41] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 4 ms to minimize.
[2024-05-28 21:00:42] [INFO ] Deduced a trap composed of 184 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:00:42] [INFO ] Deduced a trap composed of 173 places in 204 ms of which 3 ms to minimize.
[2024-05-28 21:00:42] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 3 ms to minimize.
[2024-05-28 21:00:42] [INFO ] Deduced a trap composed of 124 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:00:42] [INFO ] Deduced a trap composed of 172 places in 190 ms of which 3 ms to minimize.
[2024-05-28 21:00:43] [INFO ] Deduced a trap composed of 169 places in 256 ms of which 3 ms to minimize.
[2024-05-28 21:00:43] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 3 ms to minimize.
[2024-05-28 21:00:43] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 8 ms to minimize.
[2024-05-28 21:00:44] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:00:44] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 4 ms to minimize.
[2024-05-28 21:00:44] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 4 ms to minimize.
[2024-05-28 21:00:44] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 4 ms to minimize.
[2024-05-28 21:00:44] [INFO ] Deduced a trap composed of 175 places in 184 ms of which 3 ms to minimize.
[2024-05-28 21:00:45] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:00:45] [INFO ] Deduced a trap composed of 172 places in 239 ms of which 3 ms to minimize.
[2024-05-28 21:00:45] [INFO ] Deduced a trap composed of 173 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:00:46] [INFO ] Deduced a trap composed of 175 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:00:46] [INFO ] Deduced a trap composed of 163 places in 217 ms of which 4 ms to minimize.
[2024-05-28 21:00:46] [INFO ] Deduced a trap composed of 172 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:00:46] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 4 ms to minimize.
[2024-05-28 21:00:47] [INFO ] Deduced a trap composed of 187 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:00:47] [INFO ] Deduced a trap composed of 160 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:00:47] [INFO ] Deduced a trap composed of 173 places in 231 ms of which 4 ms to minimize.
[2024-05-28 21:00:48] [INFO ] Deduced a trap composed of 184 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:00:48] [INFO ] Deduced a trap composed of 169 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:00:48] [INFO ] Deduced a trap composed of 169 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:00:48] [INFO ] Deduced a trap composed of 175 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:00:49] [INFO ] Deduced a trap composed of 172 places in 229 ms of which 3 ms to minimize.
[2024-05-28 21:00:49] [INFO ] Deduced a trap composed of 163 places in 277 ms of which 5 ms to minimize.
[2024-05-28 21:00:49] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:00:49] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 4 ms to minimize.
[2024-05-28 21:00:50] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 6 ms to minimize.
[2024-05-28 21:00:50] [INFO ] Deduced a trap composed of 169 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:00:50] [INFO ] Deduced a trap composed of 163 places in 229 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:00:50] [INFO ] Deduced a trap composed of 157 places in 191 ms of which 3 ms to minimize.
[2024-05-28 21:00:51] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 3 ms to minimize.
[2024-05-28 21:00:51] [INFO ] Deduced a trap composed of 194 places in 188 ms of which 3 ms to minimize.
[2024-05-28 21:00:51] [INFO ] Deduced a trap composed of 177 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:00:51] [INFO ] Deduced a trap composed of 179 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:00:51] [INFO ] Deduced a trap composed of 180 places in 176 ms of which 2 ms to minimize.
[2024-05-28 21:00:52] [INFO ] Deduced a trap composed of 155 places in 210 ms of which 4 ms to minimize.
[2024-05-28 21:00:52] [INFO ] Deduced a trap composed of 177 places in 169 ms of which 2 ms to minimize.
[2024-05-28 21:00:52] [INFO ] Deduced a trap composed of 195 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:00:52] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 4 ms to minimize.
[2024-05-28 21:00:53] [INFO ] Deduced a trap composed of 191 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:00:53] [INFO ] Deduced a trap composed of 181 places in 208 ms of which 4 ms to minimize.
[2024-05-28 21:00:53] [INFO ] Deduced a trap composed of 172 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:00:54] [INFO ] Deduced a trap composed of 191 places in 270 ms of which 4 ms to minimize.
[2024-05-28 21:00:54] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 4 ms to minimize.
[2024-05-28 21:00:54] [INFO ] Deduced a trap composed of 172 places in 214 ms of which 4 ms to minimize.
[2024-05-28 21:00:54] [INFO ] Deduced a trap composed of 183 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:00:55] [INFO ] Deduced a trap composed of 179 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:00:55] [INFO ] Deduced a trap composed of 173 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:00:55] [INFO ] Deduced a trap composed of 163 places in 244 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:00:56] [INFO ] Deduced a trap composed of 191 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:00:56] [INFO ] Deduced a trap composed of 184 places in 208 ms of which 4 ms to minimize.
[2024-05-28 21:00:56] [INFO ] Deduced a trap composed of 184 places in 255 ms of which 3 ms to minimize.
[2024-05-28 21:00:57] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:00:57] [INFO ] Deduced a trap composed of 179 places in 210 ms of which 4 ms to minimize.
[2024-05-28 21:00:57] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 4 ms to minimize.
[2024-05-28 21:00:57] [INFO ] Deduced a trap composed of 181 places in 188 ms of which 3 ms to minimize.
[2024-05-28 21:00:58] [INFO ] Deduced a trap composed of 169 places in 237 ms of which 3 ms to minimize.
[2024-05-28 21:00:58] [INFO ] Deduced a trap composed of 178 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:00:59] [INFO ] Deduced a trap composed of 163 places in 204 ms of which 4 ms to minimize.
[2024-05-28 21:00:59] [INFO ] Deduced a trap composed of 157 places in 197 ms of which 3 ms to minimize.
[2024-05-28 21:00:59] [INFO ] Deduced a trap composed of 172 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:01:00] [INFO ] Deduced a trap composed of 172 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:01:00] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 6 ms to minimize.
[2024-05-28 21:01:00] [INFO ] Deduced a trap composed of 172 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:01:01] [INFO ] Deduced a trap composed of 176 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:01:01] [INFO ] Deduced a trap composed of 163 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:01:01] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 4 ms to minimize.
[2024-05-28 21:01:02] [INFO ] Deduced a trap composed of 172 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:01:02] [INFO ] Deduced a trap composed of 169 places in 246 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:01:03] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 3 ms to minimize.
[2024-05-28 21:01:03] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 6 ms to minimize.
[2024-05-28 21:01:03] [INFO ] Deduced a trap composed of 163 places in 268 ms of which 4 ms to minimize.
[2024-05-28 21:01:04] [INFO ] Deduced a trap composed of 160 places in 249 ms of which 3 ms to minimize.
[2024-05-28 21:01:04] [INFO ] Deduced a trap composed of 181 places in 213 ms of which 3 ms to minimize.
[2024-05-28 21:01:05] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 3 ms to minimize.
[2024-05-28 21:01:05] [INFO ] Deduced a trap composed of 172 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:01:05] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 3 ms to minimize.
[2024-05-28 21:01:05] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 3 ms to minimize.
[2024-05-28 21:01:06] [INFO ] Deduced a trap composed of 184 places in 215 ms of which 3 ms to minimize.
[2024-05-28 21:01:06] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 4 ms to minimize.
[2024-05-28 21:01:06] [INFO ] Deduced a trap composed of 179 places in 288 ms of which 3 ms to minimize.
[2024-05-28 21:01:06] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:01:07] [INFO ] Deduced a trap composed of 181 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:01:08] [INFO ] Deduced a trap composed of 172 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:01:08] [INFO ] Deduced a trap composed of 163 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:01:08] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 4 ms to minimize.
[2024-05-28 21:01:09] [INFO ] Deduced a trap composed of 178 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:01:09] [INFO ] Deduced a trap composed of 181 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:01:10] [INFO ] Deduced a trap composed of 161 places in 234 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:01:10] [INFO ] Deduced a trap composed of 160 places in 249 ms of which 5 ms to minimize.
[2024-05-28 21:01:11] [INFO ] Deduced a trap composed of 160 places in 261 ms of which 3 ms to minimize.
[2024-05-28 21:01:11] [INFO ] Deduced a trap composed of 172 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:01:12] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:01:13] [INFO ] Deduced a trap composed of 151 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:01:13] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 4 ms to minimize.
[2024-05-28 21:01:13] [INFO ] Deduced a trap composed of 181 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:01:13] [INFO ] Deduced a trap composed of 161 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:01:14] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 3 ms to minimize.
[2024-05-28 21:01:14] [INFO ] Deduced a trap composed of 172 places in 265 ms of which 4 ms to minimize.
[2024-05-28 21:01:16] [INFO ] Deduced a trap composed of 166 places in 258 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1276 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 132/132 constraints]
After SMT, in 45531ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 748/748 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 532 transition count 746
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 746
Applied a total of 4 rules in 38 ms. Remains 530 /532 variables (removed 2) and now considering 746/748 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 530/532 places, 746/748 transitions.
RANDOM walk for 40000 steps (2052 resets) in 466 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (165 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 280732 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 280732 steps, saw 83922 distinct states, run finished after 3006 ms. (steps per millisecond=93 ) properties seen :0
[2024-05-28 21:01:23] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2024-05-28 21:01:23] [INFO ] Computed 97 invariants in 21 ms
[2024-05-28 21:01:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/505 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:01:23] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 3 ms to minimize.
[2024-05-28 21:01:24] [INFO ] Deduced a trap composed of 126 places in 197 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/529 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 742/1271 variables, 529/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1271 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1271 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1272 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1272 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1272 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 630 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 530/530 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/505 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/529 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:01:25] [INFO ] Deduced a trap composed of 173 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:01:25] [INFO ] Deduced a trap composed of 165 places in 216 ms of which 3 ms to minimize.
[2024-05-28 21:01:25] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:01:25] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:01:26] [INFO ] Deduced a trap composed of 182 places in 226 ms of which 4 ms to minimize.
[2024-05-28 21:01:26] [INFO ] Deduced a trap composed of 161 places in 212 ms of which 3 ms to minimize.
[2024-05-28 21:01:26] [INFO ] Deduced a trap composed of 182 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:01:26] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:01:27] [INFO ] Deduced a trap composed of 161 places in 209 ms of which 3 ms to minimize.
[2024-05-28 21:01:27] [INFO ] Deduced a trap composed of 161 places in 193 ms of which 3 ms to minimize.
[2024-05-28 21:01:27] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 3 ms to minimize.
[2024-05-28 21:01:27] [INFO ] Deduced a trap composed of 176 places in 182 ms of which 3 ms to minimize.
[2024-05-28 21:01:27] [INFO ] Deduced a trap composed of 152 places in 187 ms of which 3 ms to minimize.
[2024-05-28 21:01:28] [INFO ] Deduced a trap composed of 173 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:01:28] [INFO ] Deduced a trap composed of 161 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:01:29] [INFO ] Deduced a trap composed of 170 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:01:29] [INFO ] Deduced a trap composed of 174 places in 228 ms of which 4 ms to minimize.
[2024-05-28 21:01:29] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 4 ms to minimize.
[2024-05-28 21:01:29] [INFO ] Deduced a trap composed of 155 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:01:29] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:01:30] [INFO ] Deduced a trap composed of 174 places in 188 ms of which 3 ms to minimize.
[2024-05-28 21:01:30] [INFO ] Deduced a trap composed of 167 places in 165 ms of which 3 ms to minimize.
[2024-05-28 21:01:30] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:01:30] [INFO ] Deduced a trap composed of 173 places in 193 ms of which 2 ms to minimize.
[2024-05-28 21:01:30] [INFO ] Deduced a trap composed of 177 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:01:31] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 4 ms to minimize.
[2024-05-28 21:01:31] [INFO ] Deduced a trap composed of 188 places in 231 ms of which 5 ms to minimize.
[2024-05-28 21:01:31] [INFO ] Deduced a trap composed of 167 places in 216 ms of which 4 ms to minimize.
[2024-05-28 21:01:32] [INFO ] Deduced a trap composed of 173 places in 281 ms of which 5 ms to minimize.
[2024-05-28 21:01:32] [INFO ] Deduced a trap composed of 176 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:01:32] [INFO ] Deduced a trap composed of 170 places in 301 ms of which 8 ms to minimize.
[2024-05-28 21:01:32] [INFO ] Deduced a trap composed of 167 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:01:33] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 3 ms to minimize.
[2024-05-28 21:01:33] [INFO ] Deduced a trap composed of 173 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:01:34] [INFO ] Deduced a trap composed of 177 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:01:34] [INFO ] Deduced a trap composed of 177 places in 230 ms of which 5 ms to minimize.
[2024-05-28 21:01:34] [INFO ] Deduced a trap composed of 180 places in 224 ms of which 4 ms to minimize.
[2024-05-28 21:01:34] [INFO ] Deduced a trap composed of 165 places in 272 ms of which 6 ms to minimize.
[2024-05-28 21:01:35] [INFO ] Deduced a trap composed of 173 places in 271 ms of which 5 ms to minimize.
[2024-05-28 21:01:35] [INFO ] Deduced a trap composed of 167 places in 185 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:01:35] [INFO ] Deduced a trap composed of 170 places in 186 ms of which 2 ms to minimize.
[2024-05-28 21:01:35] [INFO ] Deduced a trap composed of 152 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:01:36] [INFO ] Deduced a trap composed of 161 places in 195 ms of which 3 ms to minimize.
[2024-05-28 21:01:36] [INFO ] Deduced a trap composed of 149 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:01:37] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 4 ms to minimize.
[2024-05-28 21:01:38] [INFO ] Deduced a trap composed of 168 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:01:38] [INFO ] Deduced a trap composed of 179 places in 236 ms of which 3 ms to minimize.
[2024-05-28 21:01:38] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 3 ms to minimize.
[2024-05-28 21:01:39] [INFO ] Deduced a trap composed of 180 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:01:39] [INFO ] Deduced a trap composed of 179 places in 223 ms of which 4 ms to minimize.
[2024-05-28 21:01:39] [INFO ] Deduced a trap composed of 170 places in 223 ms of which 4 ms to minimize.
[2024-05-28 21:01:39] [INFO ] Deduced a trap composed of 167 places in 214 ms of which 3 ms to minimize.
[2024-05-28 21:01:40] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 3 ms to minimize.
[2024-05-28 21:01:41] [INFO ] Deduced a trap composed of 161 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:01:41] [INFO ] Deduced a trap composed of 176 places in 220 ms of which 4 ms to minimize.
[2024-05-28 21:01:42] [INFO ] Deduced a trap composed of 185 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:01:42] [INFO ] Deduced a trap composed of 182 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:01:42] [INFO ] Deduced a trap composed of 176 places in 219 ms of which 3 ms to minimize.
[2024-05-28 21:01:43] [INFO ] Deduced a trap composed of 176 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:01:43] [INFO ] Deduced a trap composed of 179 places in 207 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:01:43] [INFO ] Deduced a trap composed of 146 places in 228 ms of which 3 ms to minimize.
[2024-05-28 21:01:44] [INFO ] Deduced a trap composed of 182 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:01:45] [INFO ] Deduced a trap composed of 179 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:01:45] [INFO ] Deduced a trap composed of 177 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:01:45] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 3 ms to minimize.
[2024-05-28 21:01:46] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 3 ms to minimize.
[2024-05-28 21:01:46] [INFO ] Deduced a trap composed of 170 places in 255 ms of which 5 ms to minimize.
[2024-05-28 21:01:46] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:01:46] [INFO ] Deduced a trap composed of 177 places in 223 ms of which 3 ms to minimize.
[2024-05-28 21:01:47] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 3 ms to minimize.
[2024-05-28 21:01:47] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 2 ms to minimize.
[2024-05-28 21:01:47] [INFO ] Deduced a trap composed of 170 places in 180 ms of which 2 ms to minimize.
[2024-05-28 21:01:47] [INFO ] Deduced a trap composed of 173 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:01:48] [INFO ] Deduced a trap composed of 158 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:01:48] [INFO ] Deduced a trap composed of 170 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:01:48] [INFO ] Deduced a trap composed of 168 places in 262 ms of which 4 ms to minimize.
[2024-05-28 21:01:49] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 3 ms to minimize.
[2024-05-28 21:01:49] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 4 ms to minimize.
[2024-05-28 21:01:49] [INFO ] Deduced a trap composed of 161 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:01:49] [INFO ] Deduced a trap composed of 173 places in 207 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:01:50] [INFO ] Deduced a trap composed of 167 places in 192 ms of which 3 ms to minimize.
[2024-05-28 21:01:50] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 3 ms to minimize.
[2024-05-28 21:01:50] [INFO ] Deduced a trap composed of 155 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:01:50] [INFO ] Deduced a trap composed of 173 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:01:51] [INFO ] Deduced a trap composed of 93 places in 250 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/1272 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38459 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 87/87 constraints]
After SMT, in 39513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 29 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 23 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2024-05-28 21:02:03] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-28 21:02:03] [INFO ] Invariant cache hit.
[2024-05-28 21:02:03] [INFO ] Implicit Places using invariants in 817 ms returned []
[2024-05-28 21:02:03] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-28 21:02:03] [INFO ] Invariant cache hit.
[2024-05-28 21:02:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:02:10] [INFO ] Implicit Places using invariants and state equation in 6665 ms returned []
Implicit Place search using SMT with State Equation took 7487 ms to find 0 implicit places.
[2024-05-28 21:02:10] [INFO ] Redundant transitions in 61 ms returned []
Running 740 sub problems to find dead transitions.
[2024-05-28 21:02:10] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2024-05-28 21:02:10] [INFO ] Invariant cache hit.
[2024-05-28 21:02:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 21:02:17] [INFO ] Deduced a trap composed of 151 places in 222 ms of which 3 ms to minimize.
[2024-05-28 21:02:17] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 4 ms to minimize.
[2024-05-28 21:02:17] [INFO ] Deduced a trap composed of 145 places in 194 ms of which 4 ms to minimize.
[2024-05-28 21:02:17] [INFO ] Deduced a trap composed of 142 places in 202 ms of which 4 ms to minimize.
[2024-05-28 21:02:18] [INFO ] Deduced a trap composed of 147 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:02:18] [INFO ] Deduced a trap composed of 140 places in 223 ms of which 3 ms to minimize.
[2024-05-28 21:02:18] [INFO ] Deduced a trap composed of 143 places in 190 ms of which 3 ms to minimize.
[2024-05-28 21:02:18] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 3 ms to minimize.
[2024-05-28 21:02:19] [INFO ] Deduced a trap composed of 143 places in 187 ms of which 2 ms to minimize.
[2024-05-28 21:02:19] [INFO ] Deduced a trap composed of 143 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:02:19] [INFO ] Deduced a trap composed of 142 places in 220 ms of which 4 ms to minimize.
[2024-05-28 21:02:19] [INFO ] Deduced a trap composed of 139 places in 246 ms of which 5 ms to minimize.
[2024-05-28 21:02:20] [INFO ] Deduced a trap composed of 137 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:02:20] [INFO ] Deduced a trap composed of 138 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:02:20] [INFO ] Deduced a trap composed of 142 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:02:20] [INFO ] Deduced a trap composed of 145 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:02:21] [INFO ] Deduced a trap composed of 140 places in 217 ms of which 4 ms to minimize.
[2024-05-28 21:02:21] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 4 ms to minimize.
[2024-05-28 21:02:21] [INFO ] Deduced a trap composed of 175 places in 212 ms of which 4 ms to minimize.
[2024-05-28 21:02:21] [INFO ] Deduced a trap composed of 144 places in 235 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 21:02:22] [INFO ] Deduced a trap composed of 159 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:02:23] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 4 ms to minimize.
[2024-05-28 21:02:23] [INFO ] Deduced a trap composed of 142 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:02:23] [INFO ] Deduced a trap composed of 143 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:02:24] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 4 ms to minimize.
[2024-05-28 21:02:24] [INFO ] Deduced a trap composed of 136 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:02:24] [INFO ] Deduced a trap composed of 136 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:02:24] [INFO ] Deduced a trap composed of 142 places in 226 ms of which 4 ms to minimize.
[2024-05-28 21:02:25] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 3 ms to minimize.
[2024-05-28 21:02:25] [INFO ] Deduced a trap composed of 141 places in 238 ms of which 3 ms to minimize.
[2024-05-28 21:02:25] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 3 ms to minimize.
[2024-05-28 21:02:25] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 3 ms to minimize.
[2024-05-28 21:02:26] [INFO ] Deduced a trap composed of 143 places in 183 ms of which 3 ms to minimize.
[2024-05-28 21:02:26] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 3 ms to minimize.
[2024-05-28 21:02:26] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 3 ms to minimize.
[2024-05-28 21:02:26] [INFO ] Deduced a trap composed of 165 places in 189 ms of which 3 ms to minimize.
[2024-05-28 21:02:26] [INFO ] Deduced a trap composed of 136 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:02:27] [INFO ] Deduced a trap composed of 142 places in 198 ms of which 5 ms to minimize.
[2024-05-28 21:02:27] [INFO ] Deduced a trap composed of 140 places in 204 ms of which 5 ms to minimize.
[2024-05-28 21:02:27] [INFO ] Deduced a trap composed of 142 places in 215 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 21:02:35] [INFO ] Deduced a trap composed of 161 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:02:35] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 4 ms to minimize.
[2024-05-28 21:02:36] [INFO ] Deduced a trap composed of 136 places in 286 ms of which 3 ms to minimize.
[2024-05-28 21:02:36] [INFO ] Deduced a trap composed of 136 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:02:36] [INFO ] Deduced a trap composed of 172 places in 230 ms of which 4 ms to minimize.
[2024-05-28 21:02:37] [INFO ] Deduced a trap composed of 142 places in 201 ms of which 3 ms to minimize.
[2024-05-28 21:02:37] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 3 ms to minimize.
[2024-05-28 21:02:37] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 3 ms to minimize.
[2024-05-28 21:02:37] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 3 ms to minimize.
[2024-05-28 21:02:37] [INFO ] Deduced a trap composed of 140 places in 148 ms of which 3 ms to minimize.
[2024-05-28 21:02:38] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 3 ms to minimize.
[2024-05-28 21:02:38] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 2 ms to minimize.
[2024-05-28 21:02:38] [INFO ] Deduced a trap composed of 169 places in 159 ms of which 3 ms to minimize.
[2024-05-28 21:02:38] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 3 ms to minimize.
[2024-05-28 21:02:39] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 3 ms to minimize.
[2024-05-28 21:02:39] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 4 ms to minimize.
[2024-05-28 21:02:39] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 4 ms to minimize.
[2024-05-28 21:02:40] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 18/150 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/1272 variables, and 150 constraints, problems are : Problem set: 0 solved, 740 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 740 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 58/150 constraints. Problems are: Problem set: 0 solved, 740 unsolved
[2024-05-28 21:03:11] [INFO ] Deduced a trap composed of 167 places in 297 ms of which 5 ms to minimize.
[2024-05-28 21:03:11] [INFO ] Deduced a trap composed of 137 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:03:12] [INFO ] Deduced a trap composed of 96 places in 276 ms of which 4 ms to minimize.
SMT process timed out in 61466ms, After SMT, problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 61476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69061 ms. Remains : 530/530 places, 746/746 transitions.
Successfully simplified 26 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:03:12] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 21:03:12] [INFO ] Flatten gal took : 83 ms
[2024-05-28 21:03:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:03:12] [INFO ] Flatten gal took : 77 ms
[2024-05-28 21:03:12] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 151 out of 629 places (down from 441) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 27 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-05-28 21:03:12] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-05-28 21:03:12] [INFO ] Computed 97 invariants in 19 ms
[2024-05-28 21:03:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:03:36] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 2 ms to minimize.
[2024-05-28 21:03:36] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-28 21:03:41] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 2 ms to minimize.
[2024-05-28 21:03:41] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-28 21:03:41] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-28 21:03:42] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 3 ms to minimize.
[2024-05-28 21:03:44] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:03:44] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-05-28 21:03:44] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 1 ms to minimize.
[2024-05-28 21:03:45] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:03:49] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41560ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41574ms
[2024-05-28 21:03:54] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:03:54] [INFO ] Invariant cache hit.
[2024-05-28 21:03:54] [INFO ] Implicit Places using invariants in 786 ms returned []
[2024-05-28 21:03:54] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:03:54] [INFO ] Invariant cache hit.
[2024-05-28 21:03:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:04:01] [INFO ] Implicit Places using invariants and state equation in 6449 ms returned []
Implicit Place search using SMT with State Equation took 7238 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-28 21:04:01] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:04:01] [INFO ] Invariant cache hit.
[2024-05-28 21:04:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 145 places in 310 ms of which 5 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 24 places in 358 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 329 places in 275 ms of which 4 ms to minimize.
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 325 places in 234 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:04:34] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 2 ms to minimize.
[2024-05-28 21:04:35] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 2 ms to minimize.
[2024-05-28 21:04:35] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
[2024-05-28 21:04:40] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 2 ms to minimize.
[2024-05-28 21:04:41] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-28 21:04:42] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-28 21:04:42] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 3 ms to minimize.
[2024-05-28 21:04:43] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-28 21:04:43] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 2 ms to minimize.
[2024-05-28 21:04:43] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-28 21:04:43] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-05-28 21:04:43] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 1 ms to minimize.
[2024-05-28 21:04:44] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 3 ms to minimize.
[2024-05-28 21:04:44] [INFO ] Deduced a trap composed of 98 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:04:45] [INFO ] Deduced a trap composed of 97 places in 200 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:04:46] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/20 constraints]
After SMT, in 61613ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61635ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110483 ms. Remains : 623/629 places, 839/840 transitions.
[2024-05-28 21:05:03] [INFO ] Flatten gal took : 78 ms
[2024-05-28 21:05:03] [INFO ] Flatten gal took : 63 ms
[2024-05-28 21:05:03] [INFO ] Input system was already deterministic with 839 transitions.
[2024-05-28 21:05:03] [INFO ] Flatten gal took : 46 ms
[2024-05-28 21:05:03] [INFO ] Flatten gal took : 50 ms
[2024-05-28 21:05:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4914112827763133670.gal : 24 ms
[2024-05-28 21:05:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7383678689099356959.ctl : 5 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/CTLFireability4914112827763133670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7383678689099356959.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.
Detected timeout of ITS tools.
[2024-05-28 21:05:33] [INFO ] Flatten gal took : 63 ms
[2024-05-28 21:05:33] [INFO ] Applying decomposition
[2024-05-28 21:05:33] [INFO ] Flatten gal took : 50 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/graph16033720110398995166.txt' '-o' '/tmp/graph16033720110398995166.bin' '-w' '/tmp/graph16033720110398995166.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16033720110398995166.bin' '-l' '-1' '-v' '-w' '/tmp/graph16033720110398995166.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:05:34] [INFO ] Decomposing Gal with order
[2024-05-28 21:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:05:34] [INFO ] Removed a total of 889 redundant transitions.
[2024-05-28 21:05:34] [INFO ] Flatten gal took : 206 ms
[2024-05-28 21:05:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 173 labels/synchronizations in 50 ms.
[2024-05-28 21:05:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17454625594901674385.gal : 46 ms
[2024-05-28 21:05:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9832298182775868346.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/CTLFireability17454625594901674385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9832298182775868346.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Applied a total of 5 rules in 35 ms. Remains 624 /629 variables (removed 5) and now considering 840/840 (removed 0) transitions.
Running 834 sub problems to find dead transitions.
[2024-05-28 21:06:04] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2024-05-28 21:06:04] [INFO ] Computed 97 invariants in 26 ms
[2024-05-28 21:06:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 6/624 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1460 variables, and 97 constraints, problems are : Problem set: 0 solved, 834 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 834/834 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-05-28 21:06:27] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 1 ms to minimize.
[2024-05-28 21:06:27] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 4 ms to minimize.
[2024-05-28 21:06:27] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 1 ms to minimize.
[2024-05-28 21:06:29] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:06:29] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 4 ms to minimize.
[2024-05-28 21:06:31] [INFO ] Deduced a trap composed of 97 places in 190 ms of which 3 ms to minimize.
[2024-05-28 21:06:31] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 3 ms to minimize.
[2024-05-28 21:06:33] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-28 21:06:33] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
[2024-05-28 21:06:33] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 1 ms to minimize.
[2024-05-28 21:06:34] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:06:35] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-05-28 21:06:35] [INFO ] Deduced a trap composed of 97 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-05-28 21:06:37] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1460 variables, and 105 constraints, problems are : Problem set: 0 solved, 834 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/834 constraints, Known Traps: 14/14 constraints]
After SMT, in 41481ms problems are : Problem set: 0 solved, 834 unsolved
Search for dead transitions found 0 dead transitions in 41498ms
[2024-05-28 21:06:46] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-05-28 21:06:46] [INFO ] Invariant cache hit.
[2024-05-28 21:06:46] [INFO ] Implicit Places using invariants in 708 ms returned []
[2024-05-28 21:06:46] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-05-28 21:06:46] [INFO ] Invariant cache hit.
[2024-05-28 21:06:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:06:53] [INFO ] Implicit Places using invariants and state equation in 6841 ms returned []
Implicit Place search using SMT with State Equation took 7551 ms to find 0 implicit places.
Running 834 sub problems to find dead transitions.
[2024-05-28 21:06:53] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-05-28 21:06:53] [INFO ] Invariant cache hit.
[2024-05-28 21:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 6/624 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-05-28 21:07:15] [INFO ] Deduced a trap composed of 24 places in 322 ms of which 3 ms to minimize.
[2024-05-28 21:07:17] [INFO ] Deduced a trap composed of 301 places in 206 ms of which 4 ms to minimize.
[2024-05-28 21:07:17] [INFO ] Deduced a trap composed of 291 places in 313 ms of which 4 ms to minimize.
[2024-05-28 21:07:17] [INFO ] Deduced a trap composed of 297 places in 211 ms of which 3 ms to minimize.
[2024-05-28 21:07:17] [INFO ] Deduced a trap composed of 294 places in 203 ms of which 3 ms to minimize.
[2024-05-28 21:07:18] [INFO ] Deduced a trap composed of 290 places in 276 ms of which 4 ms to minimize.
[2024-05-28 21:07:18] [INFO ] Deduced a trap composed of 301 places in 269 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 7/104 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1460 variables, and 104 constraints, problems are : Problem set: 0 solved, 834 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 834/834 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-05-28 21:07:26] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2024-05-28 21:07:26] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-05-28 21:07:26] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-28 21:07:27] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-05-28 21:07:31] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-05-28 21:07:37] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 3 ms to minimize.
[2024-05-28 21:07:43] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1460 variables, and 98 constraints, problems are : Problem set: 0 solved, 834 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/834 constraints, Known Traps: 7/14 constraints]
After SMT, in 61409ms problems are : Problem set: 0 solved, 834 unsolved
Search for dead transitions found 0 dead transitions in 61420ms
Starting structural reductions in LTL mode, iteration 1 : 624/629 places, 840/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110514 ms. Remains : 624/629 places, 840/840 transitions.
[2024-05-28 21:07:55] [INFO ] Flatten gal took : 32 ms
[2024-05-28 21:07:55] [INFO ] Flatten gal took : 30 ms
[2024-05-28 21:07:55] [INFO ] Input system was already deterministic with 840 transitions.
[2024-05-28 21:07:55] [INFO ] Flatten gal took : 32 ms
[2024-05-28 21:07:55] [INFO ] Flatten gal took : 35 ms
[2024-05-28 21:07:55] [INFO ] Time to serialize gal into /tmp/CTLFireability3269744276498614990.gal : 9 ms
[2024-05-28 21:07:55] [INFO ] Time to serialize properties into /tmp/CTLFireability9727155936452954029.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/CTLFireability3269744276498614990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9727155936452954029.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.
Detected timeout of ITS tools.
[2024-05-28 21:08:25] [INFO ] Flatten gal took : 54 ms
[2024-05-28 21:08:25] [INFO ] Applying decomposition
[2024-05-28 21:08:25] [INFO ] Flatten gal took : 44 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/graph1765342177131704274.txt' '-o' '/tmp/graph1765342177131704274.bin' '-w' '/tmp/graph1765342177131704274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1765342177131704274.bin' '-l' '-1' '-v' '-w' '/tmp/graph1765342177131704274.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:08:25] [INFO ] Decomposing Gal with order
[2024-05-28 21:08:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:08:25] [INFO ] Removed a total of 1001 redundant transitions.
[2024-05-28 21:08:26] [INFO ] Flatten gal took : 96 ms
[2024-05-28 21:08:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 17 ms.
[2024-05-28 21:08:26] [INFO ] Time to serialize gal into /tmp/CTLFireability646455907257731208.gal : 14 ms
[2024-05-28 21:08:26] [INFO ] Time to serialize properties into /tmp/CTLFireability8097548371070082795.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/CTLFireability646455907257731208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8097548371070082795.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 95 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-05-28 21:08:56] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-05-28 21:08:56] [INFO ] Computed 97 invariants in 21 ms
[2024-05-28 21:08:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:09:19] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-28 21:09:19] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-28 21:09:23] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-28 21:09:23] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-28 21:09:23] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 1 ms to minimize.
[2024-05-28 21:09:23] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-05-28 21:09:25] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 2 ms to minimize.
[2024-05-28 21:09:25] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 2 ms to minimize.
[2024-05-28 21:09:26] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-28 21:09:26] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:09:30] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41421ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41432ms
[2024-05-28 21:09:37] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:09:37] [INFO ] Invariant cache hit.
[2024-05-28 21:09:38] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-05-28 21:09:38] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:09:38] [INFO ] Invariant cache hit.
[2024-05-28 21:09:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:09:47] [INFO ] Implicit Places using invariants and state equation in 8811 ms returned []
Implicit Place search using SMT with State Equation took 9440 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-28 21:09:47] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:09:47] [INFO ] Invariant cache hit.
[2024-05-28 21:09:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:10:07] [INFO ] Deduced a trap composed of 145 places in 200 ms of which 3 ms to minimize.
[2024-05-28 21:10:08] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:10:14] [INFO ] Deduced a trap composed of 329 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:10:14] [INFO ] Deduced a trap composed of 325 places in 225 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:10:19] [INFO ] Deduced a trap composed of 97 places in 73 ms of which 1 ms to minimize.
[2024-05-28 21:10:20] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-05-28 21:10:20] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-28 21:10:24] [INFO ] Deduced a trap composed of 98 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:10:25] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-28 21:10:26] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:10:26] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-05-28 21:10:26] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-28 21:10:27] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 1 ms to minimize.
[2024-05-28 21:10:27] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 1 ms to minimize.
[2024-05-28 21:10:27] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-28 21:10:27] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-28 21:10:28] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 2 ms to minimize.
[2024-05-28 21:10:28] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 4 ms to minimize.
[2024-05-28 21:10:28] [INFO ] Deduced a trap composed of 97 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:10:29] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 6/623 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1458 variables, and 117 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 20/20 constraints]
After SMT, in 61391ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61406ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112381 ms. Remains : 623/629 places, 839/840 transitions.
[2024-05-28 21:10:48] [INFO ] Flatten gal took : 53 ms
[2024-05-28 21:10:48] [INFO ] Flatten gal took : 32 ms
[2024-05-28 21:10:48] [INFO ] Input system was already deterministic with 839 transitions.
[2024-05-28 21:10:48] [INFO ] Flatten gal took : 75 ms
[2024-05-28 21:10:48] [INFO ] Flatten gal took : 75 ms
[2024-05-28 21:10:48] [INFO ] Time to serialize gal into /tmp/CTLFireability5572386596159403374.gal : 22 ms
[2024-05-28 21:10:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5602082575584360888.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/CTLFireability5572386596159403374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5602082575584360888.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.
Detected timeout of ITS tools.
[2024-05-28 21:11:18] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:11:18] [INFO ] Applying decomposition
[2024-05-28 21:11:19] [INFO ] Flatten gal took : 24 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/graph9043281415262344122.txt' '-o' '/tmp/graph9043281415262344122.bin' '-w' '/tmp/graph9043281415262344122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9043281415262344122.bin' '-l' '-1' '-v' '-w' '/tmp/graph9043281415262344122.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:11:19] [INFO ] Decomposing Gal with order
[2024-05-28 21:11:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:11:19] [INFO ] Removed a total of 881 redundant transitions.
[2024-05-28 21:11:19] [INFO ] Flatten gal took : 107 ms
[2024-05-28 21:11:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 17 ms.
[2024-05-28 21:11:19] [INFO ] Time to serialize gal into /tmp/CTLFireability7900076274539870551.gal : 10 ms
[2024-05-28 21:11:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17714723231977349463.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/CTLFireability7900076274539870551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17714723231977349463.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 49 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-05-28 21:11:49] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:11:49] [INFO ] Invariant cache hit.
[2024-05-28 21:11:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:12:11] [INFO ] Deduced a trap composed of 145 places in 332 ms of which 5 ms to minimize.
SMT process timed out in 21678ms, After SMT, problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 21692ms
[2024-05-28 21:12:11] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:12:11] [INFO ] Invariant cache hit.
[2024-05-28 21:12:11] [INFO ] Implicit Places using invariants in 858 ms returned []
[2024-05-28 21:12:11] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:12:12] [INFO ] Invariant cache hit.
[2024-05-28 21:12:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:12:18] [INFO ] Implicit Places using invariants and state equation in 6443 ms returned []
Implicit Place search using SMT with State Equation took 7302 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-28 21:12:18] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:12:18] [INFO ] Invariant cache hit.
[2024-05-28 21:12:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:12:39] [INFO ] Deduced a trap composed of 145 places in 233 ms of which 3 ms to minimize.
[2024-05-28 21:12:39] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:12:44] [INFO ] Deduced a trap composed of 329 places in 203 ms of which 3 ms to minimize.
[2024-05-28 21:12:45] [INFO ] Deduced a trap composed of 325 places in 191 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:12:50] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-28 21:12:51] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 1 ms to minimize.
[2024-05-28 21:12:51] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2024-05-28 21:12:54] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 2 ms to minimize.
[2024-05-28 21:12:55] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 1 ms to minimize.
[2024-05-28 21:12:56] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 1 ms to minimize.
[2024-05-28 21:12:57] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 1 ms to minimize.
[2024-05-28 21:12:57] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-28 21:12:57] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 1 ms to minimize.
[2024-05-28 21:12:57] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-28 21:12:57] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2024-05-28 21:12:57] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-28 21:12:58] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 1 ms to minimize.
[2024-05-28 21:12:58] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 2 ms to minimize.
[2024-05-28 21:12:58] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:12:59] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 6/623 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:13:18] [INFO ] Deduced a trap composed of 250 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:13:18] [INFO ] Deduced a trap composed of 245 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:13:18] [INFO ] Deduced a trap composed of 259 places in 221 ms of which 3 ms to minimize.
[2024-05-28 21:13:18] [INFO ] Deduced a trap composed of 262 places in 196 ms of which 3 ms to minimize.
[2024-05-28 21:13:19] [INFO ] Deduced a trap composed of 262 places in 184 ms of which 2 ms to minimize.
[2024-05-28 21:13:19] [INFO ] Deduced a trap composed of 253 places in 194 ms of which 3 ms to minimize.
[2024-05-28 21:13:19] [INFO ] Deduced a trap composed of 259 places in 189 ms of which 3 ms to minimize.
[2024-05-28 21:13:19] [INFO ] Deduced a trap composed of 256 places in 200 ms of which 2 ms to minimize.
SMT process timed out in 61355ms, After SMT, problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61363ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90411 ms. Remains : 623/629 places, 839/840 transitions.
[2024-05-28 21:13:19] [INFO ] Flatten gal took : 27 ms
[2024-05-28 21:13:19] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:13:19] [INFO ] Input system was already deterministic with 839 transitions.
[2024-05-28 21:13:19] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:13:19] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:13:19] [INFO ] Time to serialize gal into /tmp/CTLFireability3766086398918538381.gal : 17 ms
[2024-05-28 21:13:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2409837274486971791.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/CTLFireability3766086398918538381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2409837274486971791.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.
Detected timeout of ITS tools.
[2024-05-28 21:13:50] [INFO ] Flatten gal took : 69 ms
[2024-05-28 21:13:50] [INFO ] Applying decomposition
[2024-05-28 21:13:50] [INFO ] Flatten gal took : 37 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/graph17365298865724908262.txt' '-o' '/tmp/graph17365298865724908262.bin' '-w' '/tmp/graph17365298865724908262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17365298865724908262.bin' '-l' '-1' '-v' '-w' '/tmp/graph17365298865724908262.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:13:50] [INFO ] Decomposing Gal with order
[2024-05-28 21:13:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:13:50] [INFO ] Removed a total of 881 redundant transitions.
[2024-05-28 21:13:50] [INFO ] Flatten gal took : 99 ms
[2024-05-28 21:13:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 25 ms.
[2024-05-28 21:13:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15039608880776658582.gal : 13 ms
[2024-05-28 21:13:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12244152088258136049.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/CTLFireability15039608880776658582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12244152088258136049.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 90 place count 579 transition count 752
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 176 place count 536 transition count 752
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 535 transition count 751
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 535 transition count 751
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 182 place count 533 transition count 749
Applied a total of 182 rules in 141 ms. Remains 533 /629 variables (removed 96) and now considering 749/840 (removed 91) transitions.
Running 743 sub problems to find dead transitions.
[2024-05-28 21:14:20] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2024-05-28 21:14:20] [INFO ] Computed 97 invariants in 22 ms
[2024-05-28 21:14:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 21:14:27] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 3 ms to minimize.
[2024-05-28 21:14:27] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 2 ms to minimize.
[2024-05-28 21:14:27] [INFO ] Deduced a trap composed of 157 places in 153 ms of which 2 ms to minimize.
[2024-05-28 21:14:27] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 3 ms to minimize.
[2024-05-28 21:14:27] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 2 ms to minimize.
[2024-05-28 21:14:28] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 3 ms to minimize.
[2024-05-28 21:14:28] [INFO ] Deduced a trap composed of 139 places in 156 ms of which 3 ms to minimize.
[2024-05-28 21:14:28] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 3 ms to minimize.
[2024-05-28 21:14:28] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 3 ms to minimize.
[2024-05-28 21:14:28] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 2 ms to minimize.
[2024-05-28 21:14:28] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 4 ms to minimize.
[2024-05-28 21:14:29] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 2 ms to minimize.
[2024-05-28 21:14:29] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 4 ms to minimize.
[2024-05-28 21:14:29] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 3 ms to minimize.
[2024-05-28 21:14:29] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 3 ms to minimize.
[2024-05-28 21:14:29] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 4 ms to minimize.
[2024-05-28 21:14:30] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 4 ms to minimize.
[2024-05-28 21:14:30] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 2 ms to minimize.
[2024-05-28 21:14:30] [INFO ] Deduced a trap composed of 139 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:14:30] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 21:14:31] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 3 ms to minimize.
[2024-05-28 21:14:31] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 3 ms to minimize.
[2024-05-28 21:14:31] [INFO ] Deduced a trap composed of 139 places in 188 ms of which 2 ms to minimize.
[2024-05-28 21:14:32] [INFO ] Deduced a trap composed of 143 places in 182 ms of which 2 ms to minimize.
[2024-05-28 21:14:32] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:14:32] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 3 ms to minimize.
[2024-05-28 21:14:33] [INFO ] Deduced a trap composed of 139 places in 208 ms of which 3 ms to minimize.
[2024-05-28 21:14:33] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 4 ms to minimize.
[2024-05-28 21:14:33] [INFO ] Deduced a trap composed of 139 places in 211 ms of which 6 ms to minimize.
[2024-05-28 21:14:33] [INFO ] Deduced a trap composed of 139 places in 266 ms of which 5 ms to minimize.
[2024-05-28 21:14:34] [INFO ] Deduced a trap composed of 139 places in 280 ms of which 5 ms to minimize.
[2024-05-28 21:14:34] [INFO ] Deduced a trap composed of 139 places in 288 ms of which 18 ms to minimize.
[2024-05-28 21:14:34] [INFO ] Deduced a trap composed of 139 places in 257 ms of which 2 ms to minimize.
[2024-05-28 21:14:34] [INFO ] Deduced a trap composed of 139 places in 211 ms of which 2 ms to minimize.
[2024-05-28 21:14:35] [INFO ] Deduced a trap composed of 139 places in 250 ms of which 3 ms to minimize.
[2024-05-28 21:14:35] [INFO ] Deduced a trap composed of 176 places in 194 ms of which 2 ms to minimize.
[2024-05-28 21:14:35] [INFO ] Deduced a trap composed of 174 places in 401 ms of which 3 ms to minimize.
[2024-05-28 21:14:36] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 3 ms to minimize.
[2024-05-28 21:14:36] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 2 ms to minimize.
[2024-05-28 21:14:36] [INFO ] Deduced a trap composed of 170 places in 205 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 (/ 3.0 4.0))
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 (/ 3.0 4.0))
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 (/ 3.0 4.0))
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 (/ 1.0 2.0))
(s47 (/ 1.0 4.0))
(s48 0.0)
(s49 (/ 1.0 4.0))
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 9.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 (/ 1.0 4.0))
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 (/ 5.0 2.0))
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 (/ 3.0 4.0))
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 (/ 3.0 4.0))
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 timeout
(/ 1.0 4.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1278 variables, and 132 constraints, problems are : Problem set: 0 solved, 743 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 743/743 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 21:14:53] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-05-28 21:14:54] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 3 ms to minimize.
[2024-05-28 21:14:55] [INFO ] Deduced a trap composed of 121 places in 222 ms of which 3 ms to minimize.
[2024-05-28 21:14:55] [INFO ] Deduced a trap composed of 234 places in 197 ms of which 2 ms to minimize.
[2024-05-28 21:14:56] [INFO ] Deduced a trap composed of 146 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:14:56] [INFO ] Deduced a trap composed of 127 places in 202 ms of which 3 ms to minimize.
[2024-05-28 21:14:56] [INFO ] Deduced a trap composed of 249 places in 193 ms of which 3 ms to minimize.
[2024-05-28 21:14:56] [INFO ] Deduced a trap composed of 247 places in 194 ms of which 2 ms to minimize.
[2024-05-28 21:14:57] [INFO ] Deduced a trap composed of 244 places in 219 ms of which 3 ms to minimize.
[2024-05-28 21:14:57] [INFO ] Deduced a trap composed of 236 places in 182 ms of which 2 ms to minimize.
[2024-05-28 21:14:58] [INFO ] Deduced a trap composed of 96 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:14:58] [INFO ] Deduced a trap composed of 169 places in 189 ms of which 3 ms to minimize.
[2024-05-28 21:14:58] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 2 ms to minimize.
[2024-05-28 21:14:59] [INFO ] Deduced a trap composed of 142 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:14:59] [INFO ] Deduced a trap composed of 140 places in 163 ms of which 3 ms to minimize.
[2024-05-28 21:14:59] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 2 ms to minimize.
[2024-05-28 21:14:59] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 3 ms to minimize.
[2024-05-28 21:14:59] [INFO ] Deduced a trap composed of 170 places in 183 ms of which 3 ms to minimize.
[2024-05-28 21:15:00] [INFO ] Deduced a trap composed of 176 places in 165 ms of which 3 ms to minimize.
[2024-05-28 21:15:00] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1278 variables, and 152 constraints, problems are : Problem set: 0 solved, 743 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/743 constraints, Known Traps: 60/60 constraints]
After SMT, in 41193ms problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 41201ms
[2024-05-28 21:15:01] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 21:15:01] [INFO ] Invariant cache hit.
[2024-05-28 21:15:02] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-05-28 21:15:02] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 21:15:02] [INFO ] Invariant cache hit.
[2024-05-28 21:15:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:15:10] [INFO ] Implicit Places using invariants and state equation in 7523 ms returned []
Implicit Place search using SMT with State Equation took 8312 ms to find 0 implicit places.
[2024-05-28 21:15:10] [INFO ] Redundant transitions in 9 ms returned []
Running 743 sub problems to find dead transitions.
[2024-05-28 21:15:10] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2024-05-28 21:15:10] [INFO ] Invariant cache hit.
[2024-05-28 21:15:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 21:15:16] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 5 ms to minimize.
[2024-05-28 21:15:16] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 4 ms to minimize.
[2024-05-28 21:15:16] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 3 ms to minimize.
[2024-05-28 21:15:17] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 3 ms to minimize.
[2024-05-28 21:15:17] [INFO ] Deduced a trap composed of 147 places in 190 ms of which 2 ms to minimize.
[2024-05-28 21:15:17] [INFO ] Deduced a trap composed of 147 places in 149 ms of which 3 ms to minimize.
[2024-05-28 21:15:17] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 3 ms to minimize.
[2024-05-28 21:15:17] [INFO ] Deduced a trap composed of 150 places in 139 ms of which 3 ms to minimize.
[2024-05-28 21:15:18] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 3 ms to minimize.
[2024-05-28 21:15:18] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 3 ms to minimize.
[2024-05-28 21:15:18] [INFO ] Deduced a trap composed of 166 places in 144 ms of which 3 ms to minimize.
[2024-05-28 21:15:18] [INFO ] Deduced a trap composed of 139 places in 183 ms of which 3 ms to minimize.
[2024-05-28 21:15:18] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:15:18] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 3 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 2 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 139 places in 156 ms of which 3 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 140 places in 153 ms of which 3 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 140 places in 145 ms of which 2 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 139 places in 204 ms of which 4 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 21:15:20] [INFO ] Deduced a trap composed of 185 places in 147 ms of which 2 ms to minimize.
[2024-05-28 21:15:20] [INFO ] Deduced a trap composed of 170 places in 197 ms of which 3 ms to minimize.
[2024-05-28 21:15:21] [INFO ] Deduced a trap composed of 139 places in 203 ms of which 3 ms to minimize.
[2024-05-28 21:15:21] [INFO ] Deduced a trap composed of 168 places in 141 ms of which 3 ms to minimize.
[2024-05-28 21:15:21] [INFO ] Deduced a trap composed of 169 places in 154 ms of which 2 ms to minimize.
[2024-05-28 21:15:21] [INFO ] Deduced a trap composed of 149 places in 165 ms of which 2 ms to minimize.
[2024-05-28 21:15:21] [INFO ] Deduced a trap composed of 150 places in 168 ms of which 3 ms to minimize.
[2024-05-28 21:15:22] [INFO ] Deduced a trap composed of 147 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:15:22] [INFO ] Deduced a trap composed of 147 places in 193 ms of which 3 ms to minimize.
[2024-05-28 21:15:22] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:15:22] [INFO ] Deduced a trap composed of 143 places in 183 ms of which 3 ms to minimize.
[2024-05-28 21:15:22] [INFO ] Deduced a trap composed of 144 places in 173 ms of which 2 ms to minimize.
[2024-05-28 21:15:23] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 2 ms to minimize.
[2024-05-28 21:15:23] [INFO ] Deduced a trap composed of 163 places in 154 ms of which 2 ms to minimize.
[2024-05-28 21:15:24] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:15:24] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 3 ms to minimize.
[2024-05-28 21:15:24] [INFO ] Deduced a trap composed of 145 places in 160 ms of which 2 ms to minimize.
[2024-05-28 21:15:25] [INFO ] Deduced a trap composed of 157 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:15:25] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 3 ms to minimize.
[2024-05-28 21:15:25] [INFO ] Deduced a trap composed of 139 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 21:15:33] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 3 ms to minimize.
[2024-05-28 21:15:34] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 3 ms to minimize.
[2024-05-28 21:15:34] [INFO ] Deduced a trap composed of 150 places in 200 ms of which 3 ms to minimize.
[2024-05-28 21:15:34] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 3 ms to minimize.
[2024-05-28 21:15:34] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 3 ms to minimize.
[2024-05-28 21:15:36] [INFO ] Deduced a trap composed of 172 places in 167 ms of which 2 ms to minimize.
[2024-05-28 21:15:36] [INFO ] Deduced a trap composed of 174 places in 195 ms of which 3 ms to minimize.
[2024-05-28 21:15:36] [INFO ] Deduced a trap composed of 182 places in 182 ms of which 3 ms to minimize.
[2024-05-28 21:15:37] [INFO ] Deduced a trap composed of 182 places in 176 ms of which 3 ms to minimize.
[2024-05-28 21:15:37] [INFO ] Deduced a trap composed of 169 places in 178 ms of which 3 ms to minimize.
[2024-05-28 21:15:37] [INFO ] Deduced a trap composed of 166 places in 179 ms of which 3 ms to minimize.
[2024-05-28 21:15:37] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 2 ms to minimize.
[2024-05-28 21:15:37] [INFO ] Deduced a trap composed of 172 places in 176 ms of which 2 ms to minimize.
[2024-05-28 21:15:38] [INFO ] Deduced a trap composed of 184 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:15:38] [INFO ] Deduced a trap composed of 172 places in 177 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 15/147 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 21:15:40] [INFO ] Deduced a trap composed of 100 places in 197 ms of which 3 ms to minimize.
[2024-05-28 21:15:40] [INFO ] Deduced a trap composed of 99 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:15:41] [INFO ] Deduced a trap composed of 105 places in 175 ms of which 3 ms to minimize.
[2024-05-28 21:15:41] [INFO ] Deduced a trap composed of 99 places in 194 ms of which 3 ms to minimize.
[2024-05-28 21:15:41] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 3 ms to minimize.
SMT process timed out in 31240ms, After SMT, problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 31248ms
Starting structural reductions in SI_CTL mode, iteration 1 : 533/629 places, 749/840 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80929 ms. Remains : 533/629 places, 749/840 transitions.
[2024-05-28 21:15:41] [INFO ] Flatten gal took : 37 ms
[2024-05-28 21:15:41] [INFO ] Flatten gal took : 38 ms
[2024-05-28 21:15:41] [INFO ] Input system was already deterministic with 749 transitions.
[2024-05-28 21:15:41] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:15:41] [INFO ] Flatten gal took : 38 ms
[2024-05-28 21:15:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12374241316246366046.gal : 17 ms
[2024-05-28 21:15:41] [INFO ] Time to serialize properties into /tmp/CTLFireability10698217975811725017.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/CTLFireability12374241316246366046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10698217975811725017.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.
Detected timeout of ITS tools.
[2024-05-28 21:16:11] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:16:11] [INFO ] Applying decomposition
[2024-05-28 21:16:11] [INFO ] Flatten gal took : 23 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/graph6465435782814059685.txt' '-o' '/tmp/graph6465435782814059685.bin' '-w' '/tmp/graph6465435782814059685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6465435782814059685.bin' '-l' '-1' '-v' '-w' '/tmp/graph6465435782814059685.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:16:11] [INFO ] Decomposing Gal with order
[2024-05-28 21:16:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:16:12] [INFO ] Removed a total of 721 redundant transitions.
[2024-05-28 21:16:12] [INFO ] Flatten gal took : 153 ms
[2024-05-28 21:16:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 201 labels/synchronizations in 22 ms.
[2024-05-28 21:16:12] [INFO ] Time to serialize gal into /tmp/CTLFireability12476126225650151622.gal : 10 ms
[2024-05-28 21:16:12] [INFO ] Time to serialize properties into /tmp/CTLFireability424664200800106250.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/CTLFireability12476126225650151622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability424664200800106250.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 579 transition count 751
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 178 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 534 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 101 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-05-28 21:16:42] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-05-28 21:16:42] [INFO ] Computed 97 invariants in 26 ms
[2024-05-28 21:16:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:16:49] [INFO ] Deduced a trap composed of 162 places in 162 ms of which 2 ms to minimize.
[2024-05-28 21:16:49] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 3 ms to minimize.
[2024-05-28 21:16:49] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 3 ms to minimize.
[2024-05-28 21:16:49] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 2 ms to minimize.
[2024-05-28 21:16:49] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:16:50] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-05-28 21:16:50] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 2 ms to minimize.
[2024-05-28 21:16:50] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 3 ms to minimize.
[2024-05-28 21:16:50] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:16:50] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:16:51] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:16:51] [INFO ] Deduced a trap composed of 184 places in 166 ms of which 3 ms to minimize.
[2024-05-28 21:16:51] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 2 ms to minimize.
[2024-05-28 21:16:51] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 21:16:51] [INFO ] Deduced a trap composed of 153 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:16:52] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 3 ms to minimize.
[2024-05-28 21:16:52] [INFO ] Deduced a trap composed of 161 places in 165 ms of which 3 ms to minimize.
[2024-05-28 21:16:52] [INFO ] Deduced a trap composed of 166 places in 168 ms of which 2 ms to minimize.
[2024-05-28 21:16:52] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 3 ms to minimize.
[2024-05-28 21:16:53] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:16:54] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 3 ms to minimize.
[2024-05-28 21:16:54] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 2 ms to minimize.
[2024-05-28 21:16:54] [INFO ] Deduced a trap composed of 142 places in 189 ms of which 2 ms to minimize.
[2024-05-28 21:16:54] [INFO ] Deduced a trap composed of 143 places in 193 ms of which 3 ms to minimize.
[2024-05-28 21:16:54] [INFO ] Deduced a trap composed of 143 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:16:55] [INFO ] Deduced a trap composed of 144 places in 196 ms of which 3 ms to minimize.
[2024-05-28 21:16:55] [INFO ] Deduced a trap composed of 146 places in 283 ms of which 2 ms to minimize.
[2024-05-28 21:16:55] [INFO ] Deduced a trap composed of 145 places in 182 ms of which 2 ms to minimize.
[2024-05-28 21:16:55] [INFO ] Deduced a trap composed of 145 places in 163 ms of which 2 ms to minimize.
[2024-05-28 21:16:56] [INFO ] Deduced a trap composed of 169 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:16:56] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 3 ms to minimize.
[2024-05-28 21:16:56] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:16:57] [INFO ] Deduced a trap composed of 180 places in 172 ms of which 3 ms to minimize.
[2024-05-28 21:16:57] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 3 ms to minimize.
[2024-05-28 21:16:57] [INFO ] Deduced a trap composed of 167 places in 195 ms of which 3 ms to minimize.
[2024-05-28 21:16:57] [INFO ] Deduced a trap composed of 157 places in 188 ms of which 3 ms to minimize.
[2024-05-28 21:16:57] [INFO ] Deduced a trap composed of 179 places in 164 ms of which 2 ms to minimize.
[2024-05-28 21:16:58] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 2 ms to minimize.
[2024-05-28 21:16:58] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 3 ms to minimize.
[2024-05-28 21:16:58] [INFO ] Deduced a trap composed of 143 places in 187 ms of which 4 ms to minimize.
(s64 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 (/ 1.0 3.0))
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 (/ 2.0 3.0))
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 132 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:17:16] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 2 ms to minimize.
[2024-05-28 21:17:16] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-28 21:17:19] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 4 ms to minimize.
[2024-05-28 21:17:19] [INFO ] Deduced a trap composed of 101 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 98 places in 199 ms of which 3 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 169 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1276 variables, and 138 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/742 constraints, Known Traps: 46/46 constraints]
After SMT, in 41580ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 41594ms
[2024-05-28 21:17:23] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 21:17:23] [INFO ] Invariant cache hit.
[2024-05-28 21:17:24] [INFO ] Implicit Places using invariants in 778 ms returned []
[2024-05-28 21:17:24] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 21:17:24] [INFO ] Invariant cache hit.
[2024-05-28 21:17:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:17:31] [INFO ] Implicit Places using invariants and state equation in 6679 ms returned []
Implicit Place search using SMT with State Equation took 7459 ms to find 0 implicit places.
[2024-05-28 21:17:31] [INFO ] Redundant transitions in 6 ms returned []
Running 742 sub problems to find dead transitions.
[2024-05-28 21:17:31] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 21:17:31] [INFO ] Invariant cache hit.
[2024-05-28 21:17:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:17:38] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 3 ms to minimize.
[2024-05-28 21:17:38] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:17:38] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 3 ms to minimize.
[2024-05-28 21:17:38] [INFO ] Deduced a trap composed of 157 places in 165 ms of which 3 ms to minimize.
[2024-05-28 21:17:38] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 3 ms to minimize.
[2024-05-28 21:17:39] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 21:17:39] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 2 ms to minimize.
[2024-05-28 21:17:39] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-05-28 21:17:39] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-05-28 21:17:39] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-05-28 21:17:40] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 2 ms to minimize.
[2024-05-28 21:17:40] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 3 ms to minimize.
[2024-05-28 21:17:40] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 2 ms to minimize.
[2024-05-28 21:17:40] [INFO ] Deduced a trap composed of 166 places in 177 ms of which 3 ms to minimize.
[2024-05-28 21:17:40] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 2 ms to minimize.
[2024-05-28 21:17:41] [INFO ] Deduced a trap composed of 175 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:17:41] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 3 ms to minimize.
[2024-05-28 21:17:41] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 5 ms to minimize.
[2024-05-28 21:17:41] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 3 ms to minimize.
[2024-05-28 21:17:41] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:17:43] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-05-28 21:17:43] [INFO ] Deduced a trap composed of 140 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:17:43] [INFO ] Deduced a trap composed of 163 places in 165 ms of which 3 ms to minimize.
[2024-05-28 21:17:43] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:17:43] [INFO ] Deduced a trap composed of 167 places in 172 ms of which 3 ms to minimize.
[2024-05-28 21:17:44] [INFO ] Deduced a trap composed of 169 places in 311 ms of which 2 ms to minimize.
[2024-05-28 21:17:44] [INFO ] Deduced a trap composed of 138 places in 447 ms of which 3 ms to minimize.
[2024-05-28 21:17:44] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 2 ms to minimize.
[2024-05-28 21:17:45] [INFO ] Deduced a trap composed of 196 places in 166 ms of which 3 ms to minimize.
[2024-05-28 21:17:45] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 2 ms to minimize.
[2024-05-28 21:17:45] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 2 ms to minimize.
[2024-05-28 21:17:45] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-05-28 21:17:45] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 2 ms to minimize.
[2024-05-28 21:17:46] [INFO ] Deduced a trap composed of 172 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:17:46] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 2 ms to minimize.
[2024-05-28 21:17:46] [INFO ] Deduced a trap composed of 178 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:17:46] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 2 ms to minimize.
[2024-05-28 21:17:46] [INFO ] Deduced a trap composed of 184 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:17:47] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 2 ms to minimize.
[2024-05-28 21:17:47] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:17:54] [INFO ] Deduced a trap composed of 157 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:17:55] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-28 21:17:55] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 21:17:55] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 2 ms to minimize.
[2024-05-28 21:17:55] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 3 ms to minimize.
[2024-05-28 21:17:55] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:17:55] [INFO ] Deduced a trap composed of 105 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:17:56] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 2 ms to minimize.
[2024-05-28 21:17:56] [INFO ] Deduced a trap composed of 105 places in 206 ms of which 3 ms to minimize.
[2024-05-28 21:17:56] [INFO ] Deduced a trap composed of 143 places in 149 ms of which 3 ms to minimize.
[2024-05-28 21:17:56] [INFO ] Deduced a trap composed of 104 places in 217 ms of which 3 ms to minimize.
[2024-05-28 21:17:57] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 4 ms to minimize.
[2024-05-28 21:17:57] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 3 ms to minimize.
[2024-05-28 21:17:57] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 4 ms to minimize.
[2024-05-28 21:17:57] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-05-28 21:17:58] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 2 ms to minimize.
[2024-05-28 21:17:58] [INFO ] Deduced a trap composed of 138 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:17:58] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-28 21:17:58] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2024-05-28 21:17:59] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:18:01] [INFO ] Deduced a trap composed of 139 places in 210 ms of which 4 ms to minimize.
[2024-05-28 21:18:01] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 3 ms to minimize.
[2024-05-28 21:18:02] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:18:02] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 2 ms to minimize.
[2024-05-28 21:18:02] [INFO ] Deduced a trap composed of 144 places in 155 ms of which 3 ms to minimize.
[2024-05-28 21:18:02] [INFO ] Deduced a trap composed of 143 places in 144 ms of which 3 ms to minimize.
[2024-05-28 21:18:02] [INFO ] Deduced a trap composed of 145 places in 164 ms of which 3 ms to minimize.
SMT process timed out in 31491ms, After SMT, problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 31500ms
Starting structural reductions in SI_CTL mode, iteration 1 : 532/629 places, 748/840 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80681 ms. Remains : 532/629 places, 748/840 transitions.
[2024-05-28 21:18:02] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:18:03] [INFO ] Flatten gal took : 22 ms
[2024-05-28 21:18:03] [INFO ] Input system was already deterministic with 748 transitions.
[2024-05-28 21:18:03] [INFO ] Flatten gal took : 21 ms
[2024-05-28 21:18:03] [INFO ] Flatten gal took : 21 ms
[2024-05-28 21:18:03] [INFO ] Time to serialize gal into /tmp/CTLFireability1190917953966144773.gal : 3 ms
[2024-05-28 21:18:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11547103609463245273.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/CTLFireability1190917953966144773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11547103609463245273.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.
Detected timeout of ITS tools.
[2024-05-28 21:18:33] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:18:33] [INFO ] Applying decomposition
[2024-05-28 21:18:33] [INFO ] Flatten gal took : 35 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/graph12787196497402605689.txt' '-o' '/tmp/graph12787196497402605689.bin' '-w' '/tmp/graph12787196497402605689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12787196497402605689.bin' '-l' '-1' '-v' '-w' '/tmp/graph12787196497402605689.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:18:33] [INFO ] Decomposing Gal with order
[2024-05-28 21:18:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:18:33] [INFO ] Removed a total of 724 redundant transitions.
[2024-05-28 21:18:33] [INFO ] Flatten gal took : 89 ms
[2024-05-28 21:18:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 22 ms.
[2024-05-28 21:18:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6158347415577778195.gal : 19 ms
[2024-05-28 21:18:33] [INFO ] Time to serialize properties into /tmp/CTLFireability839094192267478596.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/CTLFireability6158347415577778195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability839094192267478596.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 579 transition count 751
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 178 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 534 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 75 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-05-28 21:19:03] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 21:19:03] [INFO ] Invariant cache hit.
[2024-05-28 21:19:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:19:09] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 3 ms to minimize.
[2024-05-28 21:19:10] [INFO ] Deduced a trap composed of 139 places in 204 ms of which 3 ms to minimize.
[2024-05-28 21:19:10] [INFO ] Deduced a trap composed of 157 places in 149 ms of which 3 ms to minimize.
[2024-05-28 21:19:10] [INFO ] Deduced a trap composed of 157 places in 147 ms of which 3 ms to minimize.
[2024-05-28 21:19:10] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:19:10] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 2 ms to minimize.
[2024-05-28 21:19:11] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-05-28 21:19:11] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 21:19:11] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 2 ms to minimize.
[2024-05-28 21:19:11] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 2 ms to minimize.
[2024-05-28 21:19:11] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 4 ms to minimize.
[2024-05-28 21:19:11] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-05-28 21:19:12] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 3 ms to minimize.
[2024-05-28 21:19:12] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 2 ms to minimize.
[2024-05-28 21:19:12] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:19:12] [INFO ] Deduced a trap composed of 175 places in 223 ms of which 4 ms to minimize.
[2024-05-28 21:19:12] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 4 ms to minimize.
[2024-05-28 21:19:13] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 4 ms to minimize.
[2024-05-28 21:19:13] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 3 ms to minimize.
[2024-05-28 21:19:13] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:19:14] [INFO ] Deduced a trap composed of 138 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:19:14] [INFO ] Deduced a trap composed of 140 places in 184 ms of which 2 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 163 places in 212 ms of which 3 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 4 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 4 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 169 places in 173 ms of which 2 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 196 places in 169 ms of which 3 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 2 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 2 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 3 ms to minimize.
[2024-05-28 21:19:17] [INFO ] Deduced a trap composed of 172 places in 222 ms of which 4 ms to minimize.
[2024-05-28 21:19:17] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-05-28 21:19:18] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 2 ms to minimize.
[2024-05-28 21:19:18] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 3 ms to minimize.
[2024-05-28 21:19:18] [INFO ] Deduced a trap composed of 184 places in 185 ms of which 2 ms to minimize.
[2024-05-28 21:19:18] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-05-28 21:19:18] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 132 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:19:32] [INFO ] Deduced a trap composed of 220 places in 187 ms of which 3 ms to minimize.
[2024-05-28 21:19:33] [INFO ] Deduced a trap composed of 158 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:19:33] [INFO ] Deduced a trap composed of 153 places in 206 ms of which 5 ms to minimize.
[2024-05-28 21:19:33] [INFO ] Deduced a trap composed of 206 places in 222 ms of which 3 ms to minimize.
[2024-05-28 21:19:35] [INFO ] Deduced a trap composed of 161 places in 274 ms of which 3 ms to minimize.
[2024-05-28 21:19:35] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:19:35] [INFO ] Deduced a trap composed of 153 places in 184 ms of which 3 ms to minimize.
[2024-05-28 21:19:35] [INFO ] Deduced a trap composed of 157 places in 158 ms of which 2 ms to minimize.
[2024-05-28 21:19:36] [INFO ] Deduced a trap composed of 218 places in 151 ms of which 2 ms to minimize.
[2024-05-28 21:19:36] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 2 ms to minimize.
[2024-05-28 21:19:36] [INFO ] Deduced a trap composed of 152 places in 158 ms of which 2 ms to minimize.
[2024-05-28 21:19:36] [INFO ] Deduced a trap composed of 212 places in 144 ms of which 3 ms to minimize.
[2024-05-28 21:19:36] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 2 ms to minimize.
[2024-05-28 21:19:37] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 3 ms to minimize.
[2024-05-28 21:19:37] [INFO ] Deduced a trap composed of 162 places in 154 ms of which 3 ms to minimize.
[2024-05-28 21:19:37] [INFO ] Deduced a trap composed of 158 places in 154 ms of which 2 ms to minimize.
[2024-05-28 21:19:37] [INFO ] Deduced a trap composed of 153 places in 154 ms of which 3 ms to minimize.
[2024-05-28 21:19:37] [INFO ] Deduced a trap composed of 207 places in 176 ms of which 3 ms to minimize.
[2024-05-28 21:19:38] [INFO ] Deduced a trap composed of 206 places in 165 ms of which 2 ms to minimize.
[2024-05-28 21:19:38] [INFO ] Deduced a trap composed of 154 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1276 variables, and 152 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/742 constraints, Known Traps: 60/60 constraints]
After SMT, in 41201ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 41208ms
[2024-05-28 21:19:44] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 21:19:44] [INFO ] Invariant cache hit.
[2024-05-28 21:19:45] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-28 21:19:45] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 21:19:45] [INFO ] Invariant cache hit.
[2024-05-28 21:19:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:19:52] [INFO ] Implicit Places using invariants and state equation in 6662 ms returned []
Implicit Place search using SMT with State Equation took 7267 ms to find 0 implicit places.
[2024-05-28 21:19:52] [INFO ] Redundant transitions in 12 ms returned []
Running 742 sub problems to find dead transitions.
[2024-05-28 21:19:52] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 21:19:52] [INFO ] Invariant cache hit.
[2024-05-28 21:19:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:19:58] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 2 ms to minimize.
[2024-05-28 21:19:58] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 2 ms to minimize.
[2024-05-28 21:19:58] [INFO ] Deduced a trap composed of 157 places in 152 ms of which 2 ms to minimize.
[2024-05-28 21:19:58] [INFO ] Deduced a trap composed of 157 places in 160 ms of which 3 ms to minimize.
[2024-05-28 21:19:59] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:19:59] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 2 ms to minimize.
[2024-05-28 21:19:59] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 2 ms to minimize.
[2024-05-28 21:19:59] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-05-28 21:19:59] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-05-28 21:19:59] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 2 ms to minimize.
[2024-05-28 21:20:00] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 2 ms to minimize.
[2024-05-28 21:20:00] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 21:20:00] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 2 ms to minimize.
[2024-05-28 21:20:00] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 2 ms to minimize.
[2024-05-28 21:20:00] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 2 ms to minimize.
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 175 places in 217 ms of which 3 ms to minimize.
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 3 ms to minimize.
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 140 places in 192 ms of which 3 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 163 places in 189 ms of which 3 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 2 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 169 places in 156 ms of which 3 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 3 ms to minimize.
[2024-05-28 21:20:04] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:20:04] [INFO ] Deduced a trap composed of 196 places in 191 ms of which 3 ms to minimize.
[2024-05-28 21:20:04] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 2 ms to minimize.
[2024-05-28 21:20:04] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 2 ms to minimize.
[2024-05-28 21:20:04] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-28 21:20:05] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 3 ms to minimize.
[2024-05-28 21:20:05] [INFO ] Deduced a trap composed of 172 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:20:05] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-05-28 21:20:06] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 2 ms to minimize.
[2024-05-28 21:20:06] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 2 ms to minimize.
[2024-05-28 21:20:06] [INFO ] Deduced a trap composed of 184 places in 172 ms of which 2 ms to minimize.
[2024-05-28 21:20:06] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 3 ms to minimize.
[2024-05-28 21:20:06] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:20:14] [INFO ] Deduced a trap composed of 157 places in 172 ms of which 3 ms to minimize.
[2024-05-28 21:20:15] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 2 ms to minimize.
[2024-05-28 21:20:15] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 21:20:15] [INFO ] Deduced a trap composed of 139 places in 180 ms of which 3 ms to minimize.
[2024-05-28 21:20:15] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 3 ms to minimize.
[2024-05-28 21:20:15] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 2 ms to minimize.
[2024-05-28 21:20:16] [INFO ] Deduced a trap composed of 105 places in 166 ms of which 3 ms to minimize.
[2024-05-28 21:20:16] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:20:16] [INFO ] Deduced a trap composed of 105 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:20:16] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:20:16] [INFO ] Deduced a trap composed of 104 places in 151 ms of which 3 ms to minimize.
[2024-05-28 21:20:17] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 3 ms to minimize.
[2024-05-28 21:20:17] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 21:20:17] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:20:17] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 21:20:17] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 4 ms to minimize.
[2024-05-28 21:20:18] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:20:18] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 2 ms to minimize.
[2024-05-28 21:20:18] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 2 ms to minimize.
[2024-05-28 21:20:19] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 21:20:21] [INFO ] Deduced a trap composed of 139 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:20:21] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 3 ms to minimize.
[2024-05-28 21:20:22] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-05-28 21:20:22] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 2 ms to minimize.
[2024-05-28 21:20:22] [INFO ] Deduced a trap composed of 144 places in 175 ms of which 2 ms to minimize.
[2024-05-28 21:20:22] [INFO ] Deduced a trap composed of 143 places in 209 ms of which 4 ms to minimize.
[2024-05-28 21:20:23] [INFO ] Deduced a trap composed of 145 places in 160 ms of which 2 ms to minimize.
[2024-05-28 21:20:23] [INFO ] Deduced a trap composed of 144 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:20:23] [INFO ] Deduced a trap composed of 144 places in 210 ms of which 3 ms to minimize.
[2024-05-28 21:20:23] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 2 ms to minimize.
SMT process timed out in 31495ms, After SMT, problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 31507ms
Starting structural reductions in SI_CTL mode, iteration 1 : 532/629 places, 748/840 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80090 ms. Remains : 532/629 places, 748/840 transitions.
[2024-05-28 21:20:23] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:20:23] [INFO ] Flatten gal took : 28 ms
[2024-05-28 21:20:23] [INFO ] Input system was already deterministic with 748 transitions.
[2024-05-28 21:20:23] [INFO ] Flatten gal took : 39 ms
[2024-05-28 21:20:23] [INFO ] Flatten gal took : 34 ms
[2024-05-28 21:20:23] [INFO ] Time to serialize gal into /tmp/CTLFireability8911440941940335906.gal : 5 ms
[2024-05-28 21:20:23] [INFO ] Time to serialize properties into /tmp/CTLFireability6254328222764216223.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/CTLFireability8911440941940335906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6254328222764216223.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.
Detected timeout of ITS tools.
[2024-05-28 21:20:53] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:20:53] [INFO ] Applying decomposition
[2024-05-28 21:20:53] [INFO ] Flatten gal took : 20 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/graph4685706392664386464.txt' '-o' '/tmp/graph4685706392664386464.bin' '-w' '/tmp/graph4685706392664386464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4685706392664386464.bin' '-l' '-1' '-v' '-w' '/tmp/graph4685706392664386464.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:20:54] [INFO ] Decomposing Gal with order
[2024-05-28 21:20:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:20:54] [INFO ] Removed a total of 724 redundant transitions.
[2024-05-28 21:20:54] [INFO ] Flatten gal took : 93 ms
[2024-05-28 21:20:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 337 labels/synchronizations in 11 ms.
[2024-05-28 21:20:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15981353611772692773.gal : 7 ms
[2024-05-28 21:20:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6135976363492215378.ctl : 12 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/CTLFireability15981353611772692773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6135976363492215378.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 28 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-05-28 21:21:24] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-05-28 21:21:24] [INFO ] Computed 97 invariants in 13 ms
[2024-05-28 21:21:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:21:45] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 3 ms to minimize.
[2024-05-28 21:21:45] [INFO ] Deduced a trap composed of 110 places in 200 ms of which 3 ms to minimize.
[2024-05-28 21:21:45] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 100 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:21:47] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-05-28 21:21:47] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-28 21:21:51] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 1 ms to minimize.
[2024-05-28 21:21:51] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-28 21:21:51] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 1 ms to minimize.
[2024-05-28 21:21:51] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 2 ms to minimize.
[2024-05-28 21:21:53] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 2 ms to minimize.
[2024-05-28 21:21:53] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-28 21:21:53] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2024-05-28 21:21:54] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:21:58] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/14 constraints]
After SMT, in 41452ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41462ms
[2024-05-28 21:22:05] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:22:05] [INFO ] Invariant cache hit.
[2024-05-28 21:22:06] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-05-28 21:22:06] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:22:06] [INFO ] Invariant cache hit.
[2024-05-28 21:22:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:22:14] [INFO ] Implicit Places using invariants and state equation in 8140 ms returned []
Implicit Place search using SMT with State Equation took 8729 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-28 21:22:14] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 21:22:14] [INFO ] Invariant cache hit.
[2024-05-28 21:22:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:22:34] [INFO ] Deduced a trap composed of 145 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:22:34] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:22:39] [INFO ] Deduced a trap composed of 329 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:22:40] [INFO ] Deduced a trap composed of 325 places in 196 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 101 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:22:46] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 1 ms to minimize.
[2024-05-28 21:22:47] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-28 21:22:47] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-28 21:22:51] [INFO ] Deduced a trap composed of 98 places in 284 ms of which 3 ms to minimize.
[2024-05-28 21:22:52] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-28 21:22:52] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 1 ms to minimize.
[2024-05-28 21:22:53] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 1 ms to minimize.
[2024-05-28 21:22:53] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 1 ms to minimize.
[2024-05-28 21:22:53] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 1 ms to minimize.
[2024-05-28 21:22:53] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 1 ms to minimize.
[2024-05-28 21:22:53] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-28 21:22:54] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 1 ms to minimize.
[2024-05-28 21:22:54] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-28 21:22:54] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 2 ms to minimize.
[2024-05-28 21:22:55] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:22:55] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 6/623 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 21:23:16] [INFO ] Deduced a trap composed of 250 places in 230 ms of which 4 ms to minimize.
SMT process timed out in 61587ms, After SMT, problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61594ms
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111830 ms. Remains : 623/629 places, 839/840 transitions.
[2024-05-28 21:23:16] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:23:16] [INFO ] Flatten gal took : 26 ms
[2024-05-28 21:23:16] [INFO ] Input system was already deterministic with 839 transitions.
[2024-05-28 21:23:16] [INFO ] Flatten gal took : 37 ms
[2024-05-28 21:23:16] [INFO ] Flatten gal took : 66 ms
[2024-05-28 21:23:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3111379539464492725.gal : 9 ms
[2024-05-28 21:23:16] [INFO ] Time to serialize properties into /tmp/CTLFireability16221057750224072549.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/CTLFireability3111379539464492725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16221057750224072549.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.
Detected timeout of ITS tools.
[2024-05-28 21:23:46] [INFO ] Flatten gal took : 54 ms
[2024-05-28 21:23:46] [INFO ] Applying decomposition
[2024-05-28 21:23:46] [INFO ] Flatten gal took : 41 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/graph13981389677174953481.txt' '-o' '/tmp/graph13981389677174953481.bin' '-w' '/tmp/graph13981389677174953481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13981389677174953481.bin' '-l' '-1' '-v' '-w' '/tmp/graph13981389677174953481.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:23:46] [INFO ] Decomposing Gal with order
[2024-05-28 21:23:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:23:46] [INFO ] Removed a total of 881 redundant transitions.
[2024-05-28 21:23:46] [INFO ] Flatten gal took : 87 ms
[2024-05-28 21:23:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 12 ms.
[2024-05-28 21:23:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3735757044281667347.gal : 11 ms
[2024-05-28 21:23:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16097813595470070496.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/CTLFireability3735757044281667347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16097813595470070496.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:24:16] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:24:16] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:24:16] [INFO ] Applying decomposition
[2024-05-28 21:24:16] [INFO ] Flatten gal took : 25 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/graph17499961712244420501.txt' '-o' '/tmp/graph17499961712244420501.bin' '-w' '/tmp/graph17499961712244420501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17499961712244420501.bin' '-l' '-1' '-v' '-w' '/tmp/graph17499961712244420501.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:24:17] [INFO ] Decomposing Gal with order
[2024-05-28 21:24:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:24:17] [INFO ] Removed a total of 1079 redundant transitions.
[2024-05-28 21:24:17] [INFO ] Flatten gal took : 101 ms
[2024-05-28 21:24:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 281 labels/synchronizations in 17 ms.
[2024-05-28 21:24:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15902222691035235519.gal : 11 ms
[2024-05-28 21:24:17] [INFO ] Time to serialize properties into /tmp/CTLFireability18344969509171376724.ctl : 3 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/CTLFireability15902222691035235519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18344969509171376724.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 21:40:53] [INFO ] Flatten gal took : 49 ms
[2024-05-28 21:40:53] [INFO ] Time to serialize gal into /tmp/CTLFireability3420100830075584869.gal : 6 ms
[2024-05-28 21:40:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6916113131234989424.ctl : 3 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/CTLFireability3420100830075584869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6916113131234989424.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 8 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 21:51:31] [INFO ] Flatten gal took : 46 ms
[2024-05-28 21:51:31] [INFO ] Input system was already deterministic with 840 transitions.
[2024-05-28 21:51:31] [INFO ] Transformed 629 places.
[2024-05-28 21:51:31] [INFO ] Transformed 840 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 21:52:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10261145065272483073.gal : 10 ms
[2024-05-28 21:52:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14004802756036241253.ctl : 3 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/CTLFireability10261145065272483073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14004802756036241253.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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