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-171654447000369.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-COL-S05J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.8K Apr 12 09:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 09:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 09:47 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 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Apr 12 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K 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-COL-S05J30-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-COL-S05J30-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716923141715

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-28 19:05:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 19:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:05:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 19:05:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 19:05:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2024-05-28 19:05:43] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
[2024-05-28 19:05:43] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-28 19:05:43] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (3202 resets) in 1269 ms. (31 steps per ms) remains 59/72 properties
BEST_FIRST walk for 4001 steps (96 resets) in 71 ms. (55 steps per ms) remains 55/59 properties
BEST_FIRST walk for 4002 steps (102 resets) in 61 ms. (64 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (76 resets) in 41 ms. (95 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (106 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (145 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (100 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (109 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (94 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (91 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (85 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (100 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (94 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (100 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (105 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (90 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (101 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (167 resets) in 43 ms. (91 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (106 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (92 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (155 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (169 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (99 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (94 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (91 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (99 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (115 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (93 resets) in 41 ms. (95 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (104 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (87 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (91 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4006 steps (80 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (96 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (115 resets) in 41 ms. (95 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (110 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (111 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (102 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (128 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (102 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (83 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (154 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (95 resets) in 38 ms. (102 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (95 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (93 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (86 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (107 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (101 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (107 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (91 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (103 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (94 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 19:05:44] [INFO ] Computed 13 invariants in 8 ms
[2024-05-28 19:05:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp69 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 16 solved, 39 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 3/8 constraints. Problems are: Problem set: 25 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 25 solved, 30 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/42 variables, 1/9 constraints. Problems are: Problem set: 40 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 40 solved, 15 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 5 (OVERLAPS) 6/48 variables, 4/13 constraints. Problems are: Problem set: 52 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 52 solved, 3 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 7 (OVERLAPS) 38/86 variables, 48/61 constraints. Problems are: Problem set: 53 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/62 constraints. Problems are: Problem set: 53 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/62 constraints. Problems are: Problem set: 53 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/62 constraints. Problems are: Problem set: 53 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 62 constraints, problems are : Problem set: 53 solved, 2 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 53 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 53 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 3/3 constraints. Problems are: Problem set: 53 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 53 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/39 variables, 2/5 constraints. Problems are: Problem set: 53 solved, 2 unsolved
[2024-05-28 19:05:45] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/6 constraints. Problems are: Problem set: 53 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 53 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/43 variables, 3/9 constraints. Problems are: Problem set: 53 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 53 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/48 variables, 5/14 constraints. Problems are: Problem set: 53 solved, 2 unsolved
[2024-05-28 19:05:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:05:45] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:05:45] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:05:45] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:05:45] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:05:45] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:05:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:05:45] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
Problem AtomicPropp61 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 8/22 constraints. Problems are: Problem set: 54 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/22 constraints. Problems are: Problem set: 54 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/86 variables, 48/70 constraints. Problems are: Problem set: 54 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 1/71 constraints. Problems are: Problem set: 54 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/86 variables, 1/72 constraints. Problems are: Problem set: 54 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/86 variables, 0/72 constraints. Problems are: Problem set: 54 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/86 variables, 0/72 constraints. Problems are: Problem set: 54 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 72 constraints, problems are : Problem set: 54 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/55 constraints, Known Traps: 9/9 constraints]
After SMT, in 905ms problems are : Problem set: 54 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 36
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 45 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 44 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 7 place count 44 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 41 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 40 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 40 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 40 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 39 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 37 transition count 31
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 37 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 36 transition count 30
Applied a total of 23 rules in 28 ms. Remains 36 /48 variables (removed 12) and now considering 30/38 (removed 8) transitions.
Running 27 sub problems to find dead transitions.
// Phase 1: matrix 30 rows 36 cols
[2024-05-28 19:05:45] [INFO ] Computed 12 invariants in 5 ms
[2024-05-28 19:05:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 30/66 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-28 19:05:46] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 50 constraints, problems are : Problem set: 0 solved, 27 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 30/66 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 77 constraints, problems are : Problem set: 0 solved, 27 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints]
After SMT, in 846ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 846ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 887 ms. Remains : 36/48 places, 30/38 transitions.
RANDOM walk for 40006 steps (4681 resets) in 351 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1630 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Probably explored full state space saw : 350 states, properties seen :0
Probabilistic random walk after 928 steps, saw 350 distinct states, run finished after 11 ms. (steps per millisecond=84 ) properties seen :0
Explored full state space saw : 350 states, properties seen :0
Exhaustive walk after 928 steps, saw 350 distinct states, run finished after 3 ms. (steps per millisecond=309 ) properties seen :0
Successfully simplified 55 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:05:46] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-28 19:05:46] [INFO ] Flatten gal took : 19 ms
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:05:46] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 19:05:47] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 43 ms.
[2024-05-28 19:05:47] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 443 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Applied a total of 0 rules in 6 ms. Remains 489 /489 variables (removed 0) and now considering 745/745 (removed 0) transitions.
Running 739 sub problems to find dead transitions.
[2024-05-28 19:05:47] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2024-05-28 19:05:47] [INFO ] Computed 82 invariants in 36 ms
[2024-05-28 19:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/487 variables, 9/80 constraints. Problems are: Problem set: 78 solved, 661 unsolved
[2024-05-28 19:06:06] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 1/81 constraints. Problems are: Problem set: 78 solved, 661 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 487/1230 variables, and 81 constraints, problems are : Problem set: 78 solved, 661 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 78 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 3 (OVERLAPS) 9/487 variables, 9/80 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 1/81 constraints. Problems are: Problem set: 78 solved, 661 unsolved
[2024-05-28 19:06:16] [INFO ] Deduced a trap composed of 230 places in 196 ms of which 10 ms to minimize.
[2024-05-28 19:06:16] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 2/83 constraints. Problems are: Problem set: 78 solved, 661 unsolved
[2024-05-28 19:06:21] [INFO ] Deduced a trap composed of 77 places in 194 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/84 constraints. Problems are: Problem set: 78 solved, 661 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 Int declared 487/1230 variables, and 84 constraints, problems are : Problem set: 78 solved, 661 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/739 constraints, Known Traps: 4/4 constraints]
After SMT, in 41424ms problems are : Problem set: 78 solved, 661 unsolved
Search for dead transitions found 78 dead transitions in 41434ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
[2024-05-28 19:06:28] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
// Phase 1: matrix 663 rows 489 cols
[2024-05-28 19:06:28] [INFO ] Computed 82 invariants in 26 ms
[2024-05-28 19:06:28] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-28 19:06:28] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
[2024-05-28 19:06:28] [INFO ] Invariant cache hit.
[2024-05-28 19:06:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:06:29] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 489/489 places, 667/745 transitions.
Applied a total of 0 rules in 8 ms. Remains 489 /489 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42310 ms. Remains : 489/489 places, 667/745 transitions.
Support contains 443 out of 489 places after structural reductions.
[2024-05-28 19:06:29] [INFO ] Flatten gal took : 137 ms
[2024-05-28 19:06:29] [INFO ] Flatten gal took : 78 ms
[2024-05-28 19:06:29] [INFO ] Input system was already deterministic with 667 transitions.
RANDOM walk for 40000 steps (2699 resets) in 2572 ms. (15 steps per ms) remains 27/37 properties
BEST_FIRST walk for 4004 steps (71 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (71 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (53 resets) in 51 ms. (77 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (60 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (63 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (68 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (120 resets) in 50 ms. (78 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (75 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (63 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (57 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (100 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (120 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (86 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (73 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (61 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (96 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (20 resets) in 18 ms. (210 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (100 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (69 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (91 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (49 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (64 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (68 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (34 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (64 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
[2024-05-28 19:06:31] [INFO ] Flow matrix only has 663 transitions (discarded 4 similar events)
[2024-05-28 19:06:31] [INFO ] Invariant cache hit.
[2024-05-28 19:06:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp25 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 31/31 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 2 (OVERLAPS) 110/484 variables, 44/75 constraints. Problems are: Problem set: 21 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 1/76 constraints. Problems are: Problem set: 21 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/76 constraints. Problems are: Problem set: 21 solved, 5 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 5 (OVERLAPS) 5/489 variables, 6/82 constraints. Problems are: Problem set: 23 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/82 constraints. Problems are: Problem set: 23 solved, 3 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 7 (OVERLAPS) 663/1152 variables, 489/571 constraints. Problems are: Problem set: 24 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1152 variables, 1/572 constraints. Problems are: Problem set: 24 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1152 variables, 0/572 constraints. Problems are: Problem set: 24 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1152 variables, 0/572 constraints. Problems are: Problem set: 24 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 572 constraints, problems are : Problem set: 24 solved, 2 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 489/489 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/442 variables, 40/40 constraints. Problems are: Problem set: 24 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/40 constraints. Problems are: Problem set: 24 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/476 variables, 34/74 constraints. Problems are: Problem set: 24 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/74 constraints. Problems are: Problem set: 24 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/488 variables, 7/81 constraints. Problems are: Problem set: 24 solved, 2 unsolved
[2024-05-28 19:06:32] [INFO ] Deduced a trap composed of 152 places in 222 ms of which 5 ms to minimize.
Problem AtomicPropp34 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 1/82 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/82 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/489 variables, 1/83 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/83 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 663/1152 variables, 489/572 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1152 variables, 1/573 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1152 variables, 1/574 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1152 variables, 0/574 constraints. Problems are: Problem set: 25 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1152 variables, 0/574 constraints. Problems are: Problem set: 25 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 574 constraints, problems are : Problem set: 25 solved, 1 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 489/489 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/26 constraints, Known Traps: 1/1 constraints]
After SMT, in 2411ms problems are : Problem set: 25 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 484 transition count 633
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 74 place count 450 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 449 transition count 632
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 75 place count 449 transition count 597
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 145 place count 414 transition count 597
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 413 transition count 596
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 413 transition count 595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 412 transition count 595
Applied a total of 149 rules in 107 ms. Remains 412 /489 variables (removed 77) and now considering 595/667 (removed 72) transitions.
Running 589 sub problems to find dead transitions.
[2024-05-28 19:06:33] [INFO ] Flow matrix only has 591 transitions (discarded 4 similar events)
// Phase 1: matrix 591 rows 412 cols
[2024-05-28 19:06:33] [INFO ] Computed 77 invariants in 10 ms
[2024-05-28 19:06:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-28 19:06:38] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 3 ms to minimize.
[2024-05-28 19:06:38] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-28 19:06:42] [INFO ] Deduced a trap composed of 108 places in 173 ms of which 3 ms to minimize.
[2024-05-28 19:06:42] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 3 ms to minimize.
[2024-05-28 19:06:42] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:06:42] [INFO ] Deduced a trap composed of 130 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:06:42] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:06:43] [INFO ] Deduced a trap composed of 124 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:06:43] [INFO ] Deduced a trap composed of 108 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:06:43] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:06:43] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:06:43] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:06:43] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:06:43] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 3 ms to minimize.
[2024-05-28 19:06:44] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 3 ms to minimize.
[2024-05-28 19:06:44] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 3 ms to minimize.
[2024-05-28 19:06:44] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:06:44] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:06:44] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 3 ms to minimize.
[2024-05-28 19:06:44] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 5 ms to minimize.
[2024-05-28 19:06:44] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 3 ms to minimize.
[2024-05-28 19:06:45] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-28 19:06:48] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:06:48] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 2 ms to minimize.
[2024-05-28 19:06:48] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 16 ms to minimize.
[2024-05-28 19:06:49] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:06:49] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:06:49] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:06:49] [INFO ] Deduced a trap composed of 108 places in 173 ms of which 3 ms to minimize.
[2024-05-28 19:06:49] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:06:49] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 3 ms to minimize.
[2024-05-28 19:06:49] [INFO ] Deduced a trap composed of 108 places in 95 ms of which 2 ms to minimize.
[2024-05-28 19:06:50] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 2 ms to minimize.
[2024-05-28 19:06:50] [INFO ] Deduced a trap composed of 108 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:06:50] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 5 ms to minimize.
[2024-05-28 19:06:50] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 3 ms to minimize.
[2024-05-28 19:06:50] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:06:50] [INFO ] Deduced a trap composed of 108 places in 108 ms of which 2 ms to minimize.
[2024-05-28 19:06:51] [INFO ] Deduced a trap composed of 108 places in 231 ms of which 2 ms to minimize.
[2024-05-28 19:06:51] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:06:51] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:06:51] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-28 19:06:51] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:06:52] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:06:52] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:06:52] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:06:52] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:06:52] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:06:52] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 15 ms to minimize.
[2024-05-28 19:06:53] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:06:53] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:06:53] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:06:53] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:06:53] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:06:53] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:06:53] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:06:53] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:06:54] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:06:54] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:06:54] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:06:54] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:06:54] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 2 ms to minimize.
SMT process timed out in 21092ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 21099ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21208 ms. Remains : 412/489 places, 595/667 transitions.
RANDOM walk for 40000 steps (2004 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1428 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 624069 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 1
Probabilistic random walk after 624069 steps, saw 191606 distinct states, run finished after 3006 ms. (steps per millisecond=207 ) properties seen :0
[2024-05-28 19:06:57] [INFO ] Flow matrix only has 591 transitions (discarded 4 similar events)
[2024-05-28 19:06:57] [INFO ] Invariant cache hit.
[2024-05-28 19:06:57] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 312/388 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/401 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/411 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/412 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 591/1003 variables, 412/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1003 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1003 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1003 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1003/1003 variables, and 490 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 412/412 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 312/388 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/401 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/411 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/412 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 591/1003 variables, 412/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1003 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1003 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 19:06:59] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:06:59] [INFO ] Deduced a trap composed of 133 places in 522 ms of which 2 ms to minimize.
[2024-05-28 19:06:59] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:07:00] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1003 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1003 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1003/1003 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2165 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 412/412 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2603ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 595/595 transitions.
Applied a total of 0 rules in 16 ms. Remains 412 /412 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 412/412 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 595/595 transitions.
Applied a total of 0 rules in 15 ms. Remains 412 /412 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-28 19:07:00] [INFO ] Flow matrix only has 591 transitions (discarded 4 similar events)
[2024-05-28 19:07:00] [INFO ] Invariant cache hit.
[2024-05-28 19:07:01] [INFO ] Implicit Places using invariants in 810 ms returned []
[2024-05-28 19:07:01] [INFO ] Flow matrix only has 591 transitions (discarded 4 similar events)
[2024-05-28 19:07:01] [INFO ] Invariant cache hit.
[2024-05-28 19:07:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:07:02] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
[2024-05-28 19:07:02] [INFO ] Redundant transitions in 34 ms returned []
Running 589 sub problems to find dead transitions.
[2024-05-28 19:07:02] [INFO ] Flow matrix only has 591 transitions (discarded 4 similar events)
[2024-05-28 19:07:02] [INFO ] Invariant cache hit.
[2024-05-28 19:07:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (OVERLAPS) 4/411 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/412 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 7 (OVERLAPS) 591/1003 variables, 412/489 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 1/490 constraints. Problems are: Problem set: 17 solved, 572 unsolved
[2024-05-28 19:07:24] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1003 variables, 1/491 constraints. Problems are: Problem set: 17 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1003 variables, and 491 constraints, problems are : Problem set: 17 solved, 572 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 412/412 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 6/72 constraints. Problems are: Problem set: 17 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 1/73 constraints. Problems are: Problem set: 17 solved, 572 unsolved
[2024-05-28 19:07:33] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:07:34] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:07:34] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:07:34] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:07:34] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:07:34] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:07:35] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:07:35] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:07:35] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:07:35] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:07:36] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:07:36] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:07:36] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 15 ms to minimize.
[2024-05-28 19:07:36] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:07:36] [INFO ] Deduced a trap composed of 112 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:07:36] [INFO ] Deduced a trap composed of 112 places in 173 ms of which 3 ms to minimize.
[2024-05-28 19:07:36] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:07:37] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:07:37] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:07:37] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 20/93 constraints. Problems are: Problem set: 17 solved, 572 unsolved
[2024-05-28 19:07:37] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:07:37] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:07:38] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:07:38] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:07:38] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:07:38] [INFO ] Deduced a trap composed of 119 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:07:38] [INFO ] Deduced a trap composed of 117 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:07:38] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:07:38] [INFO ] Deduced a trap composed of 142 places in 148 ms of which 14 ms to minimize.
[2024-05-28 19:07:39] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:07:39] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:07:39] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:07:39] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:07:39] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:07:39] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:07:40] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:07:40] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 1 ms to minimize.
[2024-05-28 19:07:40] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:07:40] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 2 ms to minimize.
[2024-05-28 19:07:40] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 20/113 constraints. Problems are: Problem set: 17 solved, 572 unsolved
[2024-05-28 19:07:41] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:07:41] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:07:41] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:07:41] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:07:41] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:07:41] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:07:41] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:07:42] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:07:42] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:07:42] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:07:42] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:07:42] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:07:42] [INFO ] Deduced a trap composed of 112 places in 124 ms of which 3 ms to minimize.
[2024-05-28 19:07:42] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:07:43] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:07:43] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:07:43] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:07:43] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:07:43] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:07:43] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 20/133 constraints. Problems are: Problem set: 17 solved, 572 unsolved
[2024-05-28 19:07:46] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 7 ms to minimize.
[2024-05-28 19:07:46] [INFO ] Deduced a trap composed of 160 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:07:47] [INFO ] Deduced a trap composed of 154 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:07:47] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 4/137 constraints. Problems are: Problem set: 17 solved, 572 unsolved
[2024-05-28 19:07:50] [INFO ] Deduced a trap composed of 155 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:07:50] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 3 ms to minimize.
[2024-05-28 19:07:51] [INFO ] Deduced a trap composed of 155 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:07:51] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 3 ms to minimize.
[2024-05-28 19:07:51] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 3 ms to minimize.
[2024-05-28 19:07:51] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:07:51] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:07:51] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:07:52] [INFO ] Deduced a trap composed of 154 places in 138 ms of which 3 ms to minimize.
[2024-05-28 19:07:52] [INFO ] Deduced a trap composed of 130 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:07:52] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:07:53] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:07:54] [INFO ] Deduced a trap composed of 112 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:07:54] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:07:54] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:07:54] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:07:54] [INFO ] Deduced a trap composed of 112 places in 102 ms of which 2 ms to minimize.
[2024-05-28 19:07:55] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:07:56] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:07:56] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 20/157 constraints. Problems are: Problem set: 17 solved, 572 unsolved
[2024-05-28 19:07:59] [INFO ] Deduced a trap composed of 121 places in 144 ms of which 3 ms to minimize.
[2024-05-28 19:08:00] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:08:00] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:08:00] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 3 ms to minimize.
[2024-05-28 19:08:00] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:08:00] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:08:00] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:08:01] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:08:01] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:08:01] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:08:01] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:08:01] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:08:01] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 2 ms to minimize.
[2024-05-28 19:08:03] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 2 ms to minimize.
SMT process timed out in 60751ms, After SMT, problems are : Problem set: 17 solved, 572 unsolved
Search for dead transitions found 17 dead transitions in 60757ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 412/412 places, 578/595 transitions.
Applied a total of 0 rules in 15 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-28 19:08:03] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63043 ms. Remains : 412/412 places, 578/595 transitions.
RANDOM walk for 40000 steps (2023 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1428 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 704915 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 1
Probabilistic random walk after 704915 steps, saw 217716 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
[2024-05-28 19:08:06] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-28 19:08:06] [INFO ] Computed 77 invariants in 24 ms
[2024-05-28 19:08:06] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 312/388 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/401 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/411 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/412 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 574/986 variables, 412/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/986 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/986 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/986 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 986/986 variables, and 490 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 412/412 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 312/388 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/401 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/411 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 19:08:07] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/412 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 574/986 variables, 412/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/986 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/986 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 19:08:07] [INFO ] Deduced a trap composed of 84 places in 171 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/986 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/986 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/986 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 986/986 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 412/412 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1215ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 16 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 412/412 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 17 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-28 19:08:07] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-28 19:08:07] [INFO ] Invariant cache hit.
[2024-05-28 19:08:08] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-28 19:08:08] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-28 19:08:08] [INFO ] Invariant cache hit.
[2024-05-28 19:08:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:08:09] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
[2024-05-28 19:08:09] [INFO ] Redundant transitions in 27 ms returned []
Running 572 sub problems to find dead transitions.
[2024-05-28 19:08:09] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-28 19:08:09] [INFO ] Invariant cache hit.
[2024-05-28 19:08:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:08:13] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:08:13] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:08:13] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:08:14] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:08:14] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:08:14] [INFO ] Deduced a trap composed of 127 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:08:14] [INFO ] Deduced a trap composed of 130 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:08:14] [INFO ] Deduced a trap composed of 130 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:08:14] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:08:14] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:08:15] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 3 ms to minimize.
[2024-05-28 19:08:15] [INFO ] Deduced a trap composed of 127 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:08:15] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:08:15] [INFO ] Deduced a trap composed of 121 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:08:15] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:08:15] [INFO ] Deduced a trap composed of 130 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:08:15] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:08:16] [INFO ] Deduced a trap composed of 127 places in 103 ms of which 2 ms to minimize.
[2024-05-28 19:08:16] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:08:16] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:08:16] [INFO ] Deduced a trap composed of 118 places in 106 ms of which 2 ms to minimize.
[2024-05-28 19:08:16] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:08:16] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:08:17] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:08:17] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:08:17] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:08:17] [INFO ] Deduced a trap composed of 108 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:08:17] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:08:17] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:08:17] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:08:18] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:08:18] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 2 ms to minimize.
[2024-05-28 19:08:18] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:08:18] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 1 ms to minimize.
[2024-05-28 19:08:18] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:08:18] [INFO ] Deduced a trap composed of 108 places in 230 ms of which 2 ms to minimize.
[2024-05-28 19:08:19] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:08:19] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:08:19] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:08:19] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:08:22] [INFO ] Deduced a trap composed of 130 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:08:22] [INFO ] Deduced a trap composed of 127 places in 97 ms of which 2 ms to minimize.
[2024-05-28 19:08:22] [INFO ] Deduced a trap composed of 162 places in 106 ms of which 2 ms to minimize.
[2024-05-28 19:08:22] [INFO ] Deduced a trap composed of 166 places in 109 ms of which 2 ms to minimize.
[2024-05-28 19:08:23] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:08:24] [INFO ] Deduced a trap composed of 127 places in 103 ms of which 2 ms to minimize.
[2024-05-28 19:08:25] [INFO ] Deduced a trap composed of 127 places in 110 ms of which 2 ms to minimize.
[2024-05-28 19:08:25] [INFO ] Deduced a trap composed of 130 places in 174 ms of which 2 ms to minimize.
[2024-05-28 19:08:25] [INFO ] Deduced a trap composed of 127 places in 109 ms of which 1 ms to minimize.
[2024-05-28 19:08:25] [INFO ] Deduced a trap composed of 121 places in 110 ms of which 16 ms to minimize.
[2024-05-28 19:08:25] [INFO ] Deduced a trap composed of 142 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:08:25] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:08:25] [INFO ] Deduced a trap composed of 124 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:08:26] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:08:26] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:08:26] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:08:26] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:08:26] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:08:26] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:08:26] [INFO ] Deduced a trap composed of 118 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:08:27] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:08:27] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:08:27] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:08:27] [INFO ] Deduced a trap composed of 124 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:08:27] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:08:28] [INFO ] Deduced a trap composed of 121 places in 101 ms of which 2 ms to minimize.
[2024-05-28 19:08:28] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 3 ms to minimize.
[2024-05-28 19:08:28] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:08:28] [INFO ] Deduced a trap composed of 130 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:08:28] [INFO ] Deduced a trap composed of 127 places in 111 ms of which 2 ms to minimize.
[2024-05-28 19:08:28] [INFO ] Deduced a trap composed of 130 places in 96 ms of which 2 ms to minimize.
[2024-05-28 19:08:28] [INFO ] Deduced a trap composed of 127 places in 110 ms of which 1 ms to minimize.
[2024-05-28 19:08:29] [INFO ] Deduced a trap composed of 112 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:08:29] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 15 ms to minimize.
[2024-05-28 19:08:29] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:08:29] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:08:29] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:08:29] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:08:29] [INFO ] Deduced a trap composed of 127 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:08:30] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:08:30] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:08:30] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:08:30] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 2 ms to minimize.
[2024-05-28 19:08:30] [INFO ] Deduced a trap composed of 108 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:08:30] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:08:35] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:08:35] [INFO ] Deduced a trap composed of 136 places in 109 ms of which 2 ms to minimize.
[2024-05-28 19:08:35] [INFO ] Deduced a trap composed of 121 places in 111 ms of which 1 ms to minimize.
[2024-05-28 19:08:35] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:08:35] [INFO ] Deduced a trap composed of 130 places in 101 ms of which 2 ms to minimize.
[2024-05-28 19:08:35] [INFO ] Deduced a trap composed of 127 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:08:36] [INFO ] Deduced a trap composed of 130 places in 108 ms of which 2 ms to minimize.
[2024-05-28 19:08:36] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:08:36] [INFO ] Deduced a trap composed of 127 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:08:36] [INFO ] Deduced a trap composed of 136 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:08:36] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 1 ms to minimize.
[2024-05-28 19:08:36] [INFO ] Deduced a trap composed of 121 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:08:36] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:08:37] [INFO ] Deduced a trap composed of 124 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:08:37] [INFO ] Deduced a trap composed of 115 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:08:37] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:08:37] [INFO ] Deduced a trap composed of 130 places in 110 ms of which 2 ms to minimize.
[2024-05-28 19:08:37] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 2 ms to minimize.
[2024-05-28 19:08:37] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:08:38] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/986 variables, and 177 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 66/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 105/177 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:08:43] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:08:44] [INFO ] Deduced a trap composed of 112 places in 208 ms of which 3 ms to minimize.
[2024-05-28 19:08:44] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:08:44] [INFO ] Deduced a trap composed of 112 places in 243 ms of which 3 ms to minimize.
[2024-05-28 19:08:44] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:08:45] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 3 ms to minimize.
[2024-05-28 19:08:45] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 2 ms to minimize.
[2024-05-28 19:08:45] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 3 ms to minimize.
[2024-05-28 19:08:45] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 2 ms to minimize.
[2024-05-28 19:08:45] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 3 ms to minimize.
[2024-05-28 19:08:45] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:08:46] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 2 ms to minimize.
[2024-05-28 19:08:46] [INFO ] Deduced a trap composed of 112 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:08:46] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 3 ms to minimize.
[2024-05-28 19:08:46] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 3 ms to minimize.
[2024-05-28 19:08:46] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 3 ms to minimize.
[2024-05-28 19:08:46] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:08:47] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:08:47] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 2 ms to minimize.
[2024-05-28 19:08:47] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:08:49] [INFO ] Deduced a trap composed of 127 places in 104 ms of which 2 ms to minimize.
[2024-05-28 19:08:49] [INFO ] Deduced a trap composed of 127 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:08:49] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 3 ms to minimize.
[2024-05-28 19:08:49] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 3 ms to minimize.
[2024-05-28 19:08:50] [INFO ] Deduced a trap composed of 130 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:08:50] [INFO ] Deduced a trap composed of 139 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:08:50] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 2 ms to minimize.
[2024-05-28 19:08:50] [INFO ] Deduced a trap composed of 136 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:08:50] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:08:50] [INFO ] Deduced a trap composed of 130 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:08:50] [INFO ] Deduced a trap composed of 130 places in 133 ms of which 3 ms to minimize.
[2024-05-28 19:08:51] [INFO ] Deduced a trap composed of 121 places in 143 ms of which 3 ms to minimize.
[2024-05-28 19:08:51] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:08:51] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 3 ms to minimize.
[2024-05-28 19:08:51] [INFO ] Deduced a trap composed of 108 places in 235 ms of which 3 ms to minimize.
[2024-05-28 19:08:51] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:08:52] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:08:52] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:08:52] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 3 ms to minimize.
[2024-05-28 19:08:52] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:08:54] [INFO ] Deduced a trap composed of 112 places in 171 ms of which 2 ms to minimize.
[2024-05-28 19:08:54] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 2 ms to minimize.
[2024-05-28 19:08:54] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:08:54] [INFO ] Deduced a trap composed of 108 places in 171 ms of which 2 ms to minimize.
[2024-05-28 19:08:55] [INFO ] Deduced a trap composed of 176 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:08:55] [INFO ] Deduced a trap composed of 177 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:08:55] [INFO ] Deduced a trap composed of 181 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:08:55] [INFO ] Deduced a trap composed of 179 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:08:55] [INFO ] Deduced a trap composed of 181 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:08:55] [INFO ] Deduced a trap composed of 185 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:08:55] [INFO ] Deduced a trap composed of 177 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:08:56] [INFO ] Deduced a trap composed of 182 places in 108 ms of which 2 ms to minimize.
[2024-05-28 19:08:56] [INFO ] Deduced a trap composed of 181 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:08:56] [INFO ] Deduced a trap composed of 176 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:08:56] [INFO ] Deduced a trap composed of 178 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:08:56] [INFO ] Deduced a trap composed of 179 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:08:56] [INFO ] Deduced a trap composed of 181 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:08:56] [INFO ] Deduced a trap composed of 177 places in 111 ms of which 2 ms to minimize.
[2024-05-28 19:08:56] [INFO ] Deduced a trap composed of 179 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:08:57] [INFO ] Deduced a trap composed of 182 places in 139 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:08:58] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 2 ms to minimize.
[2024-05-28 19:08:58] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 3 ms to minimize.
[2024-05-28 19:08:58] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:08:59] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:08:59] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:08:59] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:08:59] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:08:59] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:08:59] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:08:59] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:09:00] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:09:00] [INFO ] Deduced a trap composed of 112 places in 106 ms of which 2 ms to minimize.
[2024-05-28 19:09:00] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:09:00] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:09:00] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:09:00] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:09:00] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:09:01] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:09:01] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 1 ms to minimize.
[2024-05-28 19:09:01] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 19:09:05] [INFO ] Deduced a trap composed of 175 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:09:05] [INFO ] Deduced a trap composed of 183 places in 137 ms of which 3 ms to minimize.
[2024-05-28 19:09:06] [INFO ] Deduced a trap composed of 175 places in 145 ms of which 2 ms to minimize.
[2024-05-28 19:09:06] [INFO ] Deduced a trap composed of 178 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:09:06] [INFO ] Deduced a trap composed of 178 places in 153 ms of which 3 ms to minimize.
[2024-05-28 19:09:06] [INFO ] Deduced a trap composed of 112 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:09:06] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:09:06] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:09:07] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:09:07] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:09:07] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:09:07] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 1 ms to minimize.
[2024-05-28 19:09:07] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:09:07] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:09:07] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:09:08] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:09:08] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 2 ms to minimize.
[2024-05-28 19:09:08] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:09:08] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:09:08] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/986 variables, and 277 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 66/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/572 constraints, Known Traps: 205/205 constraints]
After SMT, in 60701ms problems are : Problem set: 0 solved, 572 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62595 ms. Remains : 412/412 places, 578/578 transitions.
Successfully simplified 25 atomic propositions for a total of 9 simplifications.
[2024-05-28 19:09:10] [INFO ] Flatten gal took : 53 ms
[2024-05-28 19:09:10] [INFO ] Flatten gal took : 52 ms
[2024-05-28 19:09:10] [INFO ] Input system was already deterministic with 667 transitions.
Support contains 265 out of 489 places (down from 266) after GAL structural reductions.
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 102 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-05-28 19:09:10] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 483 cols
[2024-05-28 19:09:10] [INFO ] Computed 77 invariants in 16 ms
[2024-05-28 19:09:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:09:26] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 3 ms to minimize.
[2024-05-28 19:09:26] [INFO ] Deduced a trap composed of 203 places in 136 ms of which 3 ms to minimize.
[2024-05-28 19:09:26] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 3 ms to minimize.
[2024-05-28 19:09:27] [INFO ] Deduced a trap composed of 209 places in 136 ms of which 3 ms to minimize.
[2024-05-28 19:09:27] [INFO ] Deduced a trap composed of 209 places in 145 ms of which 2 ms to minimize.
[2024-05-28 19:09:27] [INFO ] Deduced a trap composed of 203 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:09:27] [INFO ] Deduced a trap composed of 203 places in 133 ms of which 3 ms to minimize.
[2024-05-28 19:09:27] [INFO ] Deduced a trap composed of 200 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:09:27] [INFO ] Deduced a trap composed of 212 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:09:28] [INFO ] Deduced a trap composed of 212 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:09:28] [INFO ] Deduced a trap composed of 206 places in 139 ms of which 2 ms to minimize.
[2024-05-28 19:09:29] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:09:29] [INFO ] Deduced a trap composed of 203 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:09:29] [INFO ] Deduced a trap composed of 264 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 91 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:09:33] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 1/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 5/482 variables, 5/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 12/89 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:09:41] [INFO ] Deduced a trap composed of 209 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:09:43] [INFO ] Deduced a trap composed of 222 places in 136 ms of which 3 ms to minimize.
[2024-05-28 19:09:43] [INFO ] Deduced a trap composed of 230 places in 164 ms of which 2 ms to minimize.
[2024-05-28 19:09:43] [INFO ] Deduced a trap composed of 224 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:09:43] [INFO ] Deduced a trap composed of 226 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:09:45] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 6/95 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:09:47] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 19:09:49] [INFO ] Deduced a trap composed of 194 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:09:49] [INFO ] Deduced a trap composed of 194 places in 145 ms of which 2 ms to minimize.
[2024-05-28 19:09:49] [INFO ] Deduced a trap composed of 229 places in 148 ms of which 3 ms to minimize.
[2024-05-28 19:09:49] [INFO ] Deduced a trap composed of 224 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1145 variables, and 100 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 24/26 constraints]
After SMT, in 40930ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 40938ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2024-05-28 19:09:51] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-28 19:09:51] [INFO ] Computed 77 invariants in 7 ms
[2024-05-28 19:09:52] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-28 19:09:52] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-28 19:09:52] [INFO ] Invariant cache hit.
[2024-05-28 19:09:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:09:53] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 24 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42590 ms. Remains : 483/489 places, 649/667 transitions.
[2024-05-28 19:09:53] [INFO ] Flatten gal took : 71 ms
[2024-05-28 19:09:53] [INFO ] Flatten gal took : 52 ms
[2024-05-28 19:09:53] [INFO ] Input system was already deterministic with 649 transitions.
[2024-05-28 19:09:53] [INFO ] Flatten gal took : 82 ms
[2024-05-28 19:09:53] [INFO ] Flatten gal took : 77 ms
[2024-05-28 19:09:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality5567301873575126040.gal : 41 ms
[2024-05-28 19:09:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality1118311782962306410.ctl : 14 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/CTLCardinality5567301873575126040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1118311782962306410.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 19:10:24] [INFO ] Flatten gal took : 50 ms
[2024-05-28 19:10:24] [INFO ] Applying decomposition
[2024-05-28 19:10:24] [INFO ] Flatten gal took : 39 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/graph4237262704914385102.txt' '-o' '/tmp/graph4237262704914385102.bin' '-w' '/tmp/graph4237262704914385102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4237262704914385102.bin' '-l' '-1' '-v' '-w' '/tmp/graph4237262704914385102.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:10:24] [INFO ] Decomposing Gal with order
[2024-05-28 19:10:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:10:25] [INFO ] Removed a total of 685 redundant transitions.
[2024-05-28 19:10:25] [INFO ] Flatten gal took : 286 ms
[2024-05-28 19:10:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 47 ms.
[2024-05-28 19:10:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality8766812453659125182.gal : 12 ms
[2024-05-28 19:10:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality3338680402922554227.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/CTLCardinality8766812453659125182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3338680402922554227.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.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 53 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-05-28 19:10:55] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 483 cols
[2024-05-28 19:10:55] [INFO ] Computed 77 invariants in 13 ms
[2024-05-28 19:10:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:11:11] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 5 ms to minimize.
[2024-05-28 19:11:11] [INFO ] Deduced a trap composed of 203 places in 152 ms of which 3 ms to minimize.
[2024-05-28 19:11:11] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:11:12] [INFO ] Deduced a trap composed of 209 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:11:12] [INFO ] Deduced a trap composed of 209 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:11:12] [INFO ] Deduced a trap composed of 203 places in 150 ms of which 3 ms to minimize.
[2024-05-28 19:11:12] [INFO ] Deduced a trap composed of 203 places in 136 ms of which 3 ms to minimize.
[2024-05-28 19:11:12] [INFO ] Deduced a trap composed of 200 places in 131 ms of which 3 ms to minimize.
[2024-05-28 19:11:12] [INFO ] Deduced a trap composed of 212 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:11:12] [INFO ] Deduced a trap composed of 212 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:11:13] [INFO ] Deduced a trap composed of 206 places in 134 ms of which 3 ms to minimize.
[2024-05-28 19:11:14] [INFO ] Deduced a trap composed of 161 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:11:15] [INFO ] Deduced a trap composed of 203 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:11:15] [INFO ] Deduced a trap composed of 264 places in 150 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 91 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:11:18] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 1/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 5/482 variables, 5/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 12/89 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:11:26] [INFO ] Deduced a trap composed of 209 places in 146 ms of which 3 ms to minimize.
[2024-05-28 19:11:28] [INFO ] Deduced a trap composed of 222 places in 128 ms of which 3 ms to minimize.
[2024-05-28 19:11:28] [INFO ] Deduced a trap composed of 230 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:11:28] [INFO ] Deduced a trap composed of 224 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:11:28] [INFO ] Deduced a trap composed of 226 places in 137 ms of which 3 ms to minimize.
[2024-05-28 19:11:30] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 6/95 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:11:32] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-05-28 19:11:34] [INFO ] Deduced a trap composed of 194 places in 175 ms of which 4 ms to minimize.
[2024-05-28 19:11:34] [INFO ] Deduced a trap composed of 194 places in 170 ms of which 2 ms to minimize.
[2024-05-28 19:11:34] [INFO ] Deduced a trap composed of 229 places in 152 ms of which 3 ms to minimize.
[2024-05-28 19:11:35] [INFO ] Deduced a trap composed of 224 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1145 variables, and 100 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 24/26 constraints]
After SMT, in 40931ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 40940ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2024-05-28 19:11:36] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-28 19:11:36] [INFO ] Computed 77 invariants in 18 ms
[2024-05-28 19:11:36] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-28 19:11:36] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-28 19:11:36] [INFO ] Invariant cache hit.
[2024-05-28 19:11:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:11:38] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 15 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42815 ms. Remains : 483/489 places, 649/667 transitions.
[2024-05-28 19:11:38] [INFO ] Flatten gal took : 68 ms
[2024-05-28 19:11:38] [INFO ] Flatten gal took : 54 ms
[2024-05-28 19:11:38] [INFO ] Input system was already deterministic with 649 transitions.
[2024-05-28 19:11:38] [INFO ] Flatten gal took : 36 ms
[2024-05-28 19:11:38] [INFO ] Flatten gal took : 35 ms
[2024-05-28 19:11:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality4116399524757042724.gal : 7 ms
[2024-05-28 19:11:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality11948147345819654938.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/CTLCardinality4116399524757042724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11948147345819654938.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 19:12:08] [INFO ] Flatten gal took : 55 ms
[2024-05-28 19:12:08] [INFO ] Applying decomposition
[2024-05-28 19:12:08] [INFO ] Flatten gal took : 42 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/graph7162644208524509937.txt' '-o' '/tmp/graph7162644208524509937.bin' '-w' '/tmp/graph7162644208524509937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7162644208524509937.bin' '-l' '-1' '-v' '-w' '/tmp/graph7162644208524509937.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:12:08] [INFO ] Decomposing Gal with order
[2024-05-28 19:12:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:12:08] [INFO ] Removed a total of 661 redundant transitions.
[2024-05-28 19:12:09] [INFO ] Flatten gal took : 113 ms
[2024-05-28 19:12:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 27 ms.
[2024-05-28 19:12:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality9210419066811053714.gal : 14 ms
[2024-05-28 19:12:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality5345299533340090763.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/CTLCardinality9210419066811053714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5345299533340090763.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 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 632
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 449 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 448 transition count 631
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 597
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 414 transition count 597
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 413 transition count 596
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 413 transition count 596
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 3 with 4 rules applied. Total rules applied 146 place count 411 transition count 594
Applied a total of 146 rules in 101 ms. Remains 411 /489 variables (removed 78) and now considering 594/667 (removed 73) transitions.
Running 588 sub problems to find dead transitions.
[2024-05-28 19:12:39] [INFO ] Flow matrix only has 590 transitions (discarded 4 similar events)
// Phase 1: matrix 590 rows 411 cols
[2024-05-28 19:12:39] [INFO ] Computed 77 invariants in 11 ms
[2024-05-28 19:12:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:12:43] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 2 ms to minimize.
[2024-05-28 19:12:43] [INFO ] Deduced a trap composed of 107 places in 173 ms of which 3 ms to minimize.
[2024-05-28 19:12:44] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 3 ms to minimize.
[2024-05-28 19:12:44] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 3 ms to minimize.
[2024-05-28 19:12:44] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 3 ms to minimize.
[2024-05-28 19:12:44] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:12:47] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:12:47] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 3 ms to minimize.
[2024-05-28 19:12:48] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:12:48] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:12:48] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:12:48] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:12:48] [INFO ] Deduced a trap composed of 107 places in 180 ms of which 2 ms to minimize.
[2024-05-28 19:12:48] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 107 places in 177 ms of which 2 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 3 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 107 places in 193 ms of which 3 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 2 ms to minimize.
[2024-05-28 19:12:50] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:12:50] [INFO ] Deduced a trap composed of 107 places in 103 ms of which 1 ms to minimize.
[2024-05-28 19:12:50] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:12:50] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:12:50] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (OVERLAPS) 4/410 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:12:59] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.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 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.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 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.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.0)
(s65 0.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 (/ 1.0 3.0))
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 (/ 1.0 3.0))
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 (/ 2.0 3.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 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.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 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 (/ 2.0 3.0))
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.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 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 4.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 9.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.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 0.0)
(s246 0.0)
(s247 0.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 0.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 0.0)
(s271 0.0)
(s272 0.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 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)timeout

(s401 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1001 variables, and 103 constraints, problems are : Problem set: 0 solved, 588 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:13:02] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 2 ms to minimize.
[2024-05-28 19:13:02] [INFO ] Deduced a trap composed of 129 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:13:02] [INFO ] Deduced a trap composed of 129 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:13:03] [INFO ] Deduced a trap composed of 93 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:13:03] [INFO ] Deduced a trap composed of 127 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:13:03] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:13:06] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:13:06] [INFO ] Deduced a trap composed of 129 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:13:07] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 4 ms to minimize.
[2024-05-28 19:13:07] [INFO ] Deduced a trap composed of 133 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:13:07] [INFO ] Deduced a trap composed of 127 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:13:07] [INFO ] Deduced a trap composed of 131 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:13:07] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:13:08] [INFO ] Deduced a trap composed of 129 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:13:08] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-28 19:13:09] [INFO ] Deduced a trap composed of 129 places in 108 ms of which 1 ms to minimize.
[2024-05-28 19:13:09] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:13:09] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:13:10] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:13:10] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:13:13] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:13:13] [INFO ] Deduced a trap composed of 156 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:13:13] [INFO ] Deduced a trap composed of 158 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 16/122 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:13:15] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 3 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 133 places in 190 ms of which 3 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 127 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 182 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 133 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:13:17] [INFO ] Deduced a trap composed of 112 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:13:17] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:13:17] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:13:17] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:13:17] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:13:18] [INFO ] Deduced a trap composed of 107 places in 193 ms of which 2 ms to minimize.
[2024-05-28 19:13:18] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 3 ms to minimize.
[2024-05-28 19:13:18] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:13:18] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 4 ms to minimize.
[2024-05-28 19:13:18] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1001 variables, and 138 constraints, problems are : Problem set: 0 solved, 588 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 66/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/588 constraints, Known Traps: 66/66 constraints]
After SMT, in 41068ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 41079ms
[2024-05-28 19:13:20] [INFO ] Flow matrix only has 590 transitions (discarded 4 similar events)
[2024-05-28 19:13:20] [INFO ] Invariant cache hit.
[2024-05-28 19:13:20] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-28 19:13:20] [INFO ] Flow matrix only has 590 transitions (discarded 4 similar events)
[2024-05-28 19:13:20] [INFO ] Invariant cache hit.
[2024-05-28 19:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:13:21] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2024-05-28 19:13:21] [INFO ] Redundant transitions in 10 ms returned []
Running 588 sub problems to find dead transitions.
[2024-05-28 19:13:21] [INFO ] Flow matrix only has 590 transitions (discarded 4 similar events)
[2024-05-28 19:13:21] [INFO ] Invariant cache hit.
[2024-05-28 19:13:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:13:25] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:13:25] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:13:26] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:13:26] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:13:26] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:13:26] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:13:26] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 16 ms to minimize.
[2024-05-28 19:13:26] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:13:26] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 3 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:13:28] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:13:28] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:13:28] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:13:28] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:13:28] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 2 ms to minimize.
[2024-05-28 19:13:28] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 107 places in 205 ms of which 2 ms to minimize.
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 2 ms to minimize.
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 1 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:13:31] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:13:31] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:13:31] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:13:31] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 2 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 1 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:13:37] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:13:37] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 2 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 1 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 2 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:13:40] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:13:40] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:13:41] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:13:41] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:13:41] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:13:41] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:13:42] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:13:42] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:13:43] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:13:43] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:13:43] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:13:43] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:13:43] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:13:43] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 1 ms to minimize.
[2024-05-28 19:13:43] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 4 ms to minimize.
[2024-05-28 19:13:45] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-05-28 19:13:46] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:13:46] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 2 ms to minimize.
[2024-05-28 19:13:46] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:13:46] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:13:46] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:13:47] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:13:47] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:13:47] [INFO ] Deduced a trap composed of 152 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 18/158 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-28 19:13:50] [INFO ] Deduced a trap composed of 107 places in 103 ms of which 2 ms to minimize.
[2024-05-28 19:13:50] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:13:51] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:13:51] [INFO ] Deduced a trap composed of 113 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:13:51] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:13:51] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:13:51] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:13:51] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:13:52] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:13:52] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:13:52] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 2 ms to minimize.
[2024-05-28 19:13:52] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:13:52] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 1 ms to minimize.
SMT process timed out in 31010ms, After SMT, problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 31017ms
Starting structural reductions in SI_CTL mode, iteration 1 : 411/489 places, 594/667 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73428 ms. Remains : 411/489 places, 594/667 transitions.
[2024-05-28 19:13:52] [INFO ] Flatten gal took : 30 ms
[2024-05-28 19:13:52] [INFO ] Flatten gal took : 19 ms
[2024-05-28 19:13:52] [INFO ] Input system was already deterministic with 594 transitions.
[2024-05-28 19:13:52] [INFO ] Flatten gal took : 19 ms
[2024-05-28 19:13:52] [INFO ] Flatten gal took : 20 ms
[2024-05-28 19:13:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4024326483910375389.gal : 4 ms
[2024-05-28 19:13:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality15605713614008774529.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/CTLCardinality4024326483910375389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15605713614008774529.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 19:14:22] [INFO ] Flatten gal took : 20 ms
[2024-05-28 19:14:22] [INFO ] Applying decomposition
[2024-05-28 19:14:22] [INFO ] Flatten gal took : 18 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/graph2740468756368635529.txt' '-o' '/tmp/graph2740468756368635529.bin' '-w' '/tmp/graph2740468756368635529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2740468756368635529.bin' '-l' '-1' '-v' '-w' '/tmp/graph2740468756368635529.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:14:22] [INFO ] Decomposing Gal with order
[2024-05-28 19:14:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:14:23] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-28 19:14:23] [INFO ] Flatten gal took : 191 ms
[2024-05-28 19:14:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 18 ms.
[2024-05-28 19:14:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality12618141136796440242.gal : 7 ms
[2024-05-28 19:14:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality7685398600967773682.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/CTLCardinality12618141136796440242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7685398600967773682.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 484 transition count 634
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 451 transition count 632
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 449 transition count 632
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 70 place count 449 transition count 599
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 136 place count 416 transition count 599
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 415 transition count 598
Applied a total of 138 rules in 90 ms. Remains 415 /489 variables (removed 74) and now considering 598/667 (removed 69) transitions.
Running 592 sub problems to find dead transitions.
[2024-05-28 19:14:53] [INFO ] Flow matrix only has 594 transitions (discarded 4 similar events)
// Phase 1: matrix 594 rows 415 cols
[2024-05-28 19:14:53] [INFO ] Computed 77 invariants in 6 ms
[2024-05-28 19:14:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-28 19:14:57] [INFO ] Deduced a trap composed of 111 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:14:57] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:14:58] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 3 ms to minimize.
[2024-05-28 19:14:58] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:14:58] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:14:58] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 2 ms to minimize.
[2024-05-28 19:14:58] [INFO ] Deduced a trap composed of 120 places in 148 ms of which 3 ms to minimize.
[2024-05-28 19:14:59] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:14:59] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:14:59] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:14:59] [INFO ] Deduced a trap composed of 111 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:14:59] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:14:59] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:15:00] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:15:00] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:15:00] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 1 ms to minimize.
[2024-05-28 19:15:00] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:15:00] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:15:00] [INFO ] Deduced a trap composed of 156 places in 101 ms of which 2 ms to minimize.
[2024-05-28 19:15:00] [INFO ] Deduced a trap composed of 135 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-28 19:15:01] [INFO ] Deduced a trap composed of 112 places in 97 ms of which 2 ms to minimize.
[2024-05-28 19:15:01] [INFO ] Deduced a trap composed of 112 places in 103 ms of which 2 ms to minimize.
[2024-05-28 19:15:01] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:15:01] [INFO ] Deduced a trap composed of 111 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:15:01] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:15:01] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:15:02] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:15:02] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:15:02] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 3 ms to minimize.
[2024-05-28 19:15:03] [INFO ] Deduced a trap composed of 111 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:15:04] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:15:04] [INFO ] Deduced a trap composed of 149 places in 140 ms of which 3 ms to minimize.
[2024-05-28 19:15:04] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 13/105 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-28 19:15:09] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 3 ms to minimize.
[2024-05-28 19:15:10] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 3 ms to minimize.
[2024-05-28 19:15:10] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 3 ms to minimize.
[2024-05-28 19:15:10] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:15:10] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:15:10] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 3 ms to minimize.
[2024-05-28 19:15:10] [INFO ] Deduced a trap composed of 111 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:15:11] [INFO ] Deduced a trap composed of 111 places in 162 ms of which 2 ms to minimize.
[2024-05-28 19:15:11] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 3 ms to minimize.
[2024-05-28 19:15:11] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 3 ms to minimize.
[2024-05-28 19:15:11] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 3 ms to minimize.
[2024-05-28 19:15:11] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 3 ms to minimize.
[2024-05-28 19:15:11] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:15:11] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 3 ms to minimize.
[2024-05-28 19:15:12] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:15:12] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:15:12] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:15:12] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 3 ms to minimize.
[2024-05-28 19:15:12] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 3 ms to minimize.
[2024-05-28 19:15:12] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-28 19:15:13] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:15:13] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:15:13] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:15:13] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 3 ms to minimize.
[2024-05-28 19:15:13] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 3 ms to minimize.
[2024-05-28 19:15:14] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:15:14] [INFO ] Deduced a trap composed of 111 places in 122 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 410/1009 variables, and 132 constraints, problems are : Problem set: 0 solved, 592 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 66/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-28 19:15:15] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
[2024-05-28 19:15:15] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 2 ms to minimize.
[2024-05-28 19:15:15] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 3 ms to minimize.
[2024-05-28 19:15:15] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:15:15] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:15:16] [INFO ] Deduced a trap composed of 111 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:15:16] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 3 ms to minimize.
[2024-05-28 19:15:16] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 3 ms to minimize.
[2024-05-28 19:15:16] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:15:16] [INFO ] Deduced a trap composed of 111 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:15:17] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 3 ms to minimize.
[2024-05-28 19:15:17] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:15:17] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:15:17] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:15:17] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:15:17] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:15:17] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 2 ms to minimize.
[2024-05-28 19:15:18] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:15:18] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:15:18] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-28 19:15:18] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:15:19] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:15:19] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:15:19] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:15:19] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 3 ms to minimize.
[2024-05-28 19:15:19] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:15:19] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:15:20] [INFO ] Deduced a trap composed of 111 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:15:20] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:15:20] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:15:20] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:15:20] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 2 ms to minimize.
[2024-05-28 19:15:20] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 3 ms to minimize.
[2024-05-28 19:15:21] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 2 ms to minimize.
[2024-05-28 19:15:21] [INFO ] Deduced a trap composed of 112 places in 145 ms of which 2 ms to minimize.
[2024-05-28 19:15:21] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-28 19:15:22] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 4 ms to minimize.
[2024-05-28 19:15:22] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:15:22] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:15:22] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-28 19:15:23] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:15:23] [INFO ] Deduced a trap composed of 115 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:15:23] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:15:24] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:15:24] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 3 ms to minimize.
[2024-05-28 19:15:24] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 3 ms to minimize.
[2024-05-28 19:15:24] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:15:24] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 3 ms to minimize.
[2024-05-28 19:15:24] [INFO ] Deduced a trap composed of 115 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:15:25] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:15:25] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:15:25] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 3 ms to minimize.
[2024-05-28 19:15:25] [INFO ] Deduced a trap composed of 126 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:15:25] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:15:25] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:15:25] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 3 ms to minimize.
[2024-05-28 19:15:26] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:15:26] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:15:26] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 3 ms to minimize.
[2024-05-28 19:15:26] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-28 19:15:27] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:15:27] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:15:27] [INFO ] Deduced a trap composed of 115 places in 145 ms of which 2 ms to minimize.
[2024-05-28 19:15:27] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:15:27] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:15:28] [INFO ] Deduced a trap composed of 111 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:15:28] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:15:28] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:15:28] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:15:28] [INFO ] Deduced a trap composed of 115 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:15:28] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:15:28] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:15:29] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:15:29] [INFO ] Deduced a trap composed of 111 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:15:29] [INFO ] Deduced a trap composed of 115 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:15:29] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:15:29] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:15:29] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:15:30] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:15:30] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-28 19:15:31] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 2 ms to minimize.
[2024-05-28 19:15:31] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:15:31] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:15:31] [INFO ] Deduced a trap composed of 113 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:15:31] [INFO ] Deduced a trap composed of 111 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:15:31] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:15:32] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:15:32] [INFO ] Deduced a trap composed of 112 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:15:32] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:15:32] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:15:32] [INFO ] Deduced a trap composed of 112 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:15:32] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 1 ms to minimize.
[2024-05-28 19:15:32] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:15:33] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:15:33] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:15:33] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:15:33] [INFO ] Deduced a trap composed of 115 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:15:33] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 2 ms to minimize.
[2024-05-28 19:15:33] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:15:34] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1009 variables, and 232 constraints, problems are : Problem set: 0 solved, 592 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 66/70 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/592 constraints, Known Traps: 160/160 constraints]
After SMT, in 40735ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 40743ms
[2024-05-28 19:15:34] [INFO ] Flow matrix only has 594 transitions (discarded 4 similar events)
[2024-05-28 19:15:34] [INFO ] Invariant cache hit.
[2024-05-28 19:15:34] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-28 19:15:34] [INFO ] Flow matrix only has 594 transitions (discarded 4 similar events)
[2024-05-28 19:15:34] [INFO ] Invariant cache hit.
[2024-05-28 19:15:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:15:36] [INFO ] Implicit Places using invariants and state equation in 2158 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
[2024-05-28 19:15:36] [INFO ] Redundant transitions in 9 ms returned []
Running 592 sub problems to find dead transitions.
[2024-05-28 19:15:36] [INFO ] Flow matrix only has 594 transitions (discarded 4 similar events)
[2024-05-28 19:15:36] [INFO ] Invariant cache hit.
[2024-05-28 19:15:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (OVERLAPS) 4/414 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/415 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 575 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 575 unsolved
At refinement iteration 7 (OVERLAPS) 594/1009 variables, 415/492 constraints. Problems are: Problem set: 17 solved, 575 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1009 variables, 1/493 constraints. Problems are: Problem set: 17 solved, 575 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1009 variables, 0/493 constraints. Problems are: Problem set: 17 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 493 constraints, problems are : Problem set: 17 solved, 575 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 415/415 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 6/72 constraints. Problems are: Problem set: 17 solved, 575 unsolved
[2024-05-28 19:16:08] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:16:08] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 2 ms to minimize.
[2024-05-28 19:16:08] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 3 ms to minimize.
[2024-05-28 19:16:08] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:16:08] [INFO ] Deduced a trap composed of 152 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:16:09] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:16:09] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:16:09] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:16:09] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:16:09] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:16:09] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:16:10] [INFO ] Deduced a trap composed of 126 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:16:10] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:16:10] [INFO ] Deduced a trap composed of 115 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:16:10] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:16:10] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-28 19:16:11] [INFO ] Deduced a trap composed of 116 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:16:11] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:16:11] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:16:11] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/92 constraints. Problems are: Problem set: 17 solved, 575 unsolved
[2024-05-28 19:16:12] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 2 ms to minimize.
[2024-05-28 19:16:12] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:16:12] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:16:12] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:16:12] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:16:12] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:16:13] [INFO ] Deduced a trap composed of 111 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:16:13] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:16:13] [INFO ] Deduced a trap composed of 111 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:16:13] [INFO ] Deduced a trap composed of 111 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:16:13] [INFO ] Deduced a trap composed of 111 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:16:13] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 3 ms to minimize.
[2024-05-28 19:16:13] [INFO ] Deduced a trap composed of 126 places in 103 ms of which 1 ms to minimize.
[2024-05-28 19:16:14] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:16:14] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:16:14] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:16:14] [INFO ] Deduced a trap composed of 111 places in 99 ms of which 2 ms to minimize.
[2024-05-28 19:16:14] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:16:14] [INFO ] Deduced a trap composed of 129 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:16:14] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 20/112 constraints. Problems are: Problem set: 17 solved, 575 unsolved
[2024-05-28 19:16:16] [INFO ] Deduced a trap composed of 178 places in 108 ms of which 2 ms to minimize.
[2024-05-28 19:16:16] [INFO ] Deduced a trap composed of 182 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:16:16] [INFO ] Deduced a trap composed of 179 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:16:16] [INFO ] Deduced a trap composed of 180 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:16:16] [INFO ] Deduced a trap composed of 182 places in 139 ms of which 2 ms to minimize.
[2024-05-28 19:16:16] [INFO ] Deduced a trap composed of 175 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:16:17] [INFO ] Deduced a trap composed of 181 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:16:17] [INFO ] Deduced a trap composed of 179 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:16:17] [INFO ] Deduced a trap composed of 179 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:16:17] [INFO ] Deduced a trap composed of 180 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:16:18] [INFO ] Deduced a trap composed of 164 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:16:18] [INFO ] Deduced a trap composed of 156 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:16:18] [INFO ] Deduced a trap composed of 158 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:16:18] [INFO ] Deduced a trap composed of 156 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:16:18] [INFO ] Deduced a trap composed of 156 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:16:18] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:16:18] [INFO ] Deduced a trap composed of 148 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:16:19] [INFO ] Deduced a trap composed of 160 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:16:19] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 2 ms to minimize.
[2024-05-28 19:16:19] [INFO ] Deduced a trap composed of 152 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/132 constraints. Problems are: Problem set: 17 solved, 575 unsolved
[2024-05-28 19:16:20] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 2 ms to minimize.
[2024-05-28 19:16:20] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 1 ms to minimize.
[2024-05-28 19:16:20] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:16:20] [INFO ] Deduced a trap composed of 115 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:16:20] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:16:20] [INFO ] Deduced a trap composed of 115 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:16:20] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:16:21] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:16:21] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:16:21] [INFO ] Deduced a trap composed of 115 places in 106 ms of which 2 ms to minimize.
[2024-05-28 19:16:21] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:16:21] [INFO ] Deduced a trap composed of 115 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:16:21] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:16:22] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:16:22] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 2 ms to minimize.
[2024-05-28 19:16:22] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:16:22] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:16:22] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:16:22] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:16:22] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/152 constraints. Problems are: Problem set: 17 solved, 575 unsolved
[2024-05-28 19:16:24] [INFO ] Deduced a trap composed of 129 places in 156 ms of which 1 ms to minimize.
[2024-05-28 19:16:24] [INFO ] Deduced a trap composed of 139 places in 134 ms of which 1 ms to minimize.
[2024-05-28 19:16:24] [INFO ] Deduced a trap composed of 133 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:16:24] [INFO ] Deduced a trap composed of 141 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:16:24] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:16:25] [INFO ] Deduced a trap composed of 129 places in 101 ms of which 2 ms to minimize.
[2024-05-28 19:16:25] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:16:25] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:16:25] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 3 ms to minimize.
[2024-05-28 19:16:25] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:16:26] [INFO ] Deduced a trap composed of 135 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:16:26] [INFO ] Deduced a trap composed of 135 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:16:26] [INFO ] Deduced a trap composed of 127 places in 100 ms of which 2 ms to minimize.
[2024-05-28 19:16:26] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:16:26] [INFO ] Deduced a trap composed of 130 places in 102 ms of which 2 ms to minimize.
[2024-05-28 19:16:26] [INFO ] Deduced a trap composed of 123 places in 102 ms of which 2 ms to minimize.
[2024-05-28 19:16:27] [INFO ] Deduced a trap composed of 126 places in 207 ms of which 3 ms to minimize.
[2024-05-28 19:16:27] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:16:27] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:16:27] [INFO ] Deduced a trap composed of 133 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 20/172 constraints. Problems are: Problem set: 17 solved, 575 unsolved
[2024-05-28 19:16:30] [INFO ] Deduced a trap composed of 164 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:16:30] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:16:30] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:16:30] [INFO ] Deduced a trap composed of 158 places in 137 ms of which 3 ms to minimize.
[2024-05-28 19:16:30] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:16:31] [INFO ] Deduced a trap composed of 141 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:16:31] [INFO ] Deduced a trap composed of 160 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:16:31] [INFO ] Deduced a trap composed of 130 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:16:31] [INFO ] Deduced a trap composed of 133 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:16:31] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:16:32] [INFO ] Deduced a trap composed of 130 places in 173 ms of which 2 ms to minimize.
[2024-05-28 19:16:32] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:16:32] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:16:32] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:16:32] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:16:32] [INFO ] Deduced a trap composed of 160 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:16:32] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:16:33] [INFO ] Deduced a trap composed of 160 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:16:33] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:16:33] [INFO ] Deduced a trap composed of 127 places in 142 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 20/192 constraints. Problems are: Problem set: 17 solved, 575 unsolved
[2024-05-28 19:16:35] [INFO ] Deduced a trap composed of 121 places in 145 ms of which 2 ms to minimize.
[2024-05-28 19:16:35] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:16:35] [INFO ] Deduced a trap composed of 127 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:16:35] [INFO ] Deduced a trap composed of 127 places in 151 ms of which 9 ms to minimize.
[2024-05-28 19:16:36] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 3 ms to minimize.
[2024-05-28 19:16:36] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:16:37] [INFO ] Deduced a trap composed of 120 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:16:37] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:16:37] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 2 ms to minimize.
SMT process timed out in 60981ms, After SMT, problems are : Problem set: 17 solved, 575 unsolved
Search for dead transitions found 17 dead transitions in 60991ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 415/489 places, 581/667 transitions.
Applied a total of 0 rules in 22 ms. Remains 415 /415 variables (removed 0) and now considering 581/581 (removed 0) transitions.
[2024-05-28 19:16:37] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 104357 ms. Remains : 415/489 places, 581/667 transitions.
[2024-05-28 19:16:37] [INFO ] Flatten gal took : 31 ms
[2024-05-28 19:16:37] [INFO ] Flatten gal took : 19 ms
[2024-05-28 19:16:37] [INFO ] Input system was already deterministic with 581 transitions.
[2024-05-28 19:16:37] [INFO ] Flatten gal took : 31 ms
[2024-05-28 19:16:37] [INFO ] Flatten gal took : 31 ms
[2024-05-28 19:16:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality17221471942246256759.gal : 13 ms
[2024-05-28 19:16:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality7364505803997919014.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/CTLCardinality17221471942246256759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7364505803997919014.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 19:17:08] [INFO ] Flatten gal took : 39 ms
[2024-05-28 19:17:08] [INFO ] Applying decomposition
[2024-05-28 19:17:08] [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/graph17066807718138736802.txt' '-o' '/tmp/graph17066807718138736802.bin' '-w' '/tmp/graph17066807718138736802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17066807718138736802.bin' '-l' '-1' '-v' '-w' '/tmp/graph17066807718138736802.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:17:08] [INFO ] Decomposing Gal with order
[2024-05-28 19:17:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:17:08] [INFO ] Removed a total of 281 redundant transitions.
[2024-05-28 19:17:08] [INFO ] Flatten gal took : 85 ms
[2024-05-28 19:17:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 7 ms.
[2024-05-28 19:17:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality11979272796651343529.gal : 25 ms
[2024-05-28 19:17:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality1853685897063942962.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/CTLCardinality11979272796651343529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1853685897063942962.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 631
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 631
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 448 transition count 596
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 413 transition count 596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 412 transition count 595
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 412 transition count 595
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 148 place count 410 transition count 593
Applied a total of 148 rules in 111 ms. Remains 410 /489 variables (removed 79) and now considering 593/667 (removed 74) transitions.
Running 587 sub problems to find dead transitions.
[2024-05-28 19:17:38] [INFO ] Flow matrix only has 589 transitions (discarded 4 similar events)
// Phase 1: matrix 589 rows 410 cols
[2024-05-28 19:17:38] [INFO ] Computed 77 invariants in 6 ms
[2024-05-28 19:17:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-05-28 19:17:42] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:17:42] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-05-28 19:17:42] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 2 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 1 ms to minimize.
[2024-05-28 19:17:43] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:17:44] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 1 ms to minimize.
[2024-05-28 19:17:47] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:17:47] [INFO ] Deduced a trap composed of 141 places in 106 ms of which 2 ms to minimize.
[2024-05-28 19:17:47] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-05-28 19:17:50] [INFO ] Deduced a trap composed of 140 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (OVERLAPS) 4/409 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 587 unsolved
SMT process timed out in 20890ms, After SMT, problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 20897ms
[2024-05-28 19:17:59] [INFO ] Flow matrix only has 589 transitions (discarded 4 similar events)
[2024-05-28 19:17:59] [INFO ] Invariant cache hit.
[2024-05-28 19:17:59] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-28 19:17:59] [INFO ] Flow matrix only has 589 transitions (discarded 4 similar events)
[2024-05-28 19:17:59] [INFO ] Invariant cache hit.
[2024-05-28 19:17:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:18:00] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2024-05-28 19:18:00] [INFO ] Redundant transitions in 3 ms returned []
Running 587 sub problems to find dead transitions.
[2024-05-28 19:18:00] [INFO ] Flow matrix only has 589 transitions (discarded 4 similar events)
[2024-05-28 19:18:00] [INFO ] Invariant cache hit.
[2024-05-28 19:18:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 3 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 3 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 1 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:18:07] [INFO ] Deduced a trap composed of 116 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:18:07] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:18:07] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:18:09] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:18:10] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-05-28 19:18:10] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:18:10] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 1 ms to minimize.
[2024-05-28 19:18:10] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:18:10] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:18:11] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:18:11] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:18:11] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:18:11] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:18:11] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 1 ms to minimize.
[2024-05-28 19:18:11] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:18:11] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:18:12] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:18:12] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:18:12] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:18:12] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:18:12] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:18:12] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 1 ms to minimize.
[2024-05-28 19:18:12] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:18:12] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:18:13] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-05-28 19:18:16] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:18:16] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:18:16] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:18:16] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:18:16] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:18:16] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:18:17] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:18:17] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:18:17] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:18:17] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:18:17] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:18:17] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 2 ms to minimize.
[2024-05-28 19:18:17] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:18:18] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:18:18] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:18:18] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:18:18] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:18:18] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 18/128 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-05-28 19:18:18] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 2 ms to minimize.
[2024-05-28 19:18:19] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 1 ms to minimize.
[2024-05-28 19:18:19] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:18:19] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:18:19] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:18:19] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:18:19] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:18:19] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:18:20] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:18:20] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:18:20] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:18:20] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 1 ms to minimize.
[2024-05-28 19:18:20] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:18:20] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 1 ms to minimize.
[2024-05-28 19:18:21] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 16 ms to minimize.
[2024-05-28 19:18:21] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 16/144 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-05-28 19:18:24] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-05-28 19:18:24] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:18:24] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:18:24] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:18:24] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:18:25] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 2 ms to minimize.
[2024-05-28 19:18:25] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:18:25] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:18:25] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:18:25] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-28 19:18:25] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 1 ms to minimize.
[2024-05-28 19:18:25] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:18:26] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 11 ms to minimize.
[2024-05-28 19:18:26] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-05-28 19:18:26] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:18:27] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:18:27] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2024-05-28 19:18:27] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:18:27] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:18:28] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-05-28 19:18:31] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-05-28 19:18:31] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
SMT process timed out in 30702ms, After SMT, problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 30709ms
Starting structural reductions in SI_CTL mode, iteration 1 : 410/489 places, 593/667 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53210 ms. Remains : 410/489 places, 593/667 transitions.
[2024-05-28 19:18:31] [INFO ] Flatten gal took : 31 ms
[2024-05-28 19:18:31] [INFO ] Flatten gal took : 20 ms
[2024-05-28 19:18:31] [INFO ] Input system was already deterministic with 593 transitions.
[2024-05-28 19:18:31] [INFO ] Flatten gal took : 35 ms
[2024-05-28 19:18:31] [INFO ] Flatten gal took : 29 ms
[2024-05-28 19:18:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15178830721222442728.gal : 4 ms
[2024-05-28 19:18:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality5475669083809853686.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/CTLCardinality15178830721222442728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5475669083809853686.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 19:19:02] [INFO ] Flatten gal took : 45 ms
[2024-05-28 19:19:02] [INFO ] Applying decomposition
[2024-05-28 19:19:02] [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/graph12910118038155530840.txt' '-o' '/tmp/graph12910118038155530840.bin' '-w' '/tmp/graph12910118038155530840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12910118038155530840.bin' '-l' '-1' '-v' '-w' '/tmp/graph12910118038155530840.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:19:02] [INFO ] Decomposing Gal with order
[2024-05-28 19:19:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:19:02] [INFO ] Removed a total of 458 redundant transitions.
[2024-05-28 19:19:02] [INFO ] Flatten gal took : 150 ms
[2024-05-28 19:19:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-28 19:19:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality800283285047062073.gal : 17 ms
[2024-05-28 19:19:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality17194869993719767249.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/CTLCardinality800283285047062073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17194869993719767249.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 632
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 632
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 70 place count 449 transition count 599
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 136 place count 416 transition count 599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 415 transition count 598
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 415 transition count 598
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 142 place count 413 transition count 596
Applied a total of 142 rules in 75 ms. Remains 413 /489 variables (removed 76) and now considering 596/667 (removed 71) transitions.
Running 590 sub problems to find dead transitions.
[2024-05-28 19:19:32] [INFO ] Flow matrix only has 592 transitions (discarded 4 similar events)
// Phase 1: matrix 592 rows 413 cols
[2024-05-28 19:19:32] [INFO ] Computed 77 invariants in 10 ms
[2024-05-28 19:19:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 3 (OVERLAPS) 4/411 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Problem TDEAD385 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/413 variables, 2/77 constraints. Problems are: Problem set: 17 solved, 573 unsolved
[2024-05-28 19:19:45] [INFO ] Deduced a trap composed of 115 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 1/78 constraints. Problems are: Problem set: 17 solved, 573 unsolved
[2024-05-28 19:19:50] [INFO ] Deduced a trap composed of 152 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:19:50] [INFO ] Deduced a trap composed of 174 places in 121 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 2/80 constraints. Problems are: Problem set: 17 solved, 573 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s1 0.0)
(s2 0.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 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.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 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.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.0)
(s65 0.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 (/ 1.0 3.0))
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 (/ 1.0 3.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 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.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 (/ 1.0 3.0))
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/1005 variables, and 80 constraints, problems are : Problem set: 17 solved, 573 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 17 solved, 573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/71 constraints. Problems are: Problem set: 17 solved, 573 unsolved
At refinement iteration 3 (OVERLAPS) 4/411 variables, 4/75 constraints. Problems are: Problem set: 17 solved, 573 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/75 constraints. Problems are: Problem set: 17 solved, 573 unsolved
At refinement iteration 5 (OVERLAPS) 2/413 variables, 2/77 constraints. Problems are: Problem set: 17 solved, 573 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 3/80 constraints. Problems are: Problem set: 17 solved, 573 unsolved
[2024-05-28 19:20:02] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:20:02] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:20:04] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:20:04] [INFO ] Deduced a trap composed of 162 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:20:04] [INFO ] Deduced a trap composed of 156 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:20:04] [INFO ] Deduced a trap composed of 183 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:20:04] [INFO ] Deduced a trap composed of 177 places in 131 ms of which 2 ms to minimize.
[2024-05-28 19:20:04] [INFO ] Deduced a trap composed of 183 places in 136 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 8/88 constraints. Problems are: Problem set: 17 solved, 573 unsolved
[2024-05-28 19:20:05] [INFO ] Deduced a trap composed of 121 places in 118 ms of which 2 ms to minimize.
[2024-05-28 19:20:05] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 1 ms to minimize.
[2024-05-28 19:20:05] [INFO ] Deduced a trap composed of 148 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:20:08] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:20:08] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:20:08] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-05-28 19:20:09] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:20:09] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:20:09] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:20:09] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:20:10] [INFO ] Deduced a trap composed of 152 places in 123 ms of which 2 ms to minimize.
[2024-05-28 19:20:10] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:20:10] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 13/101 constraints. Problems are: Problem set: 17 solved, 573 unsolved
[2024-05-28 19:20:11] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/1005 variables, and 102 constraints, problems are : Problem set: 17 solved, 573 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 25/25 constraints]
After SMT, in 40947ms problems are : Problem set: 17 solved, 573 unsolved
Search for dead transitions found 17 dead transitions in 40957ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2024-05-28 19:20:13] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 413 cols
[2024-05-28 19:20:13] [INFO ] Computed 77 invariants in 7 ms
[2024-05-28 19:20:13] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-28 19:20:13] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-28 19:20:13] [INFO ] Invariant cache hit.
[2024-05-28 19:20:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:20:15] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
[2024-05-28 19:20:15] [INFO ] Redundant transitions in 5 ms returned []
Starting structural reductions in SI_CTL mode, iteration 1 : 413/489 places, 579/667 transitions.
Applied a total of 0 rules in 15 ms. Remains 413 /413 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42755 ms. Remains : 413/489 places, 579/667 transitions.
[2024-05-28 19:20:15] [INFO ] Flatten gal took : 28 ms
[2024-05-28 19:20:15] [INFO ] Flatten gal took : 18 ms
[2024-05-28 19:20:15] [INFO ] Input system was already deterministic with 579 transitions.
[2024-05-28 19:20:15] [INFO ] Flatten gal took : 18 ms
[2024-05-28 19:20:15] [INFO ] Flatten gal took : 18 ms
[2024-05-28 19:20:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality10165637970110879763.gal : 3 ms
[2024-05-28 19:20:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality5527011616768872915.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/CTLCardinality10165637970110879763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5527011616768872915.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 19:20:45] [INFO ] Flatten gal took : 20 ms
[2024-05-28 19:20:45] [INFO ] Applying decomposition
[2024-05-28 19:20:45] [INFO ] Flatten gal took : 17 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/graph11099446323191464897.txt' '-o' '/tmp/graph11099446323191464897.bin' '-w' '/tmp/graph11099446323191464897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11099446323191464897.bin' '-l' '-1' '-v' '-w' '/tmp/graph11099446323191464897.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:20:45] [INFO ] Decomposing Gal with order
[2024-05-28 19:20:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:20:45] [INFO ] Removed a total of 787 redundant transitions.
[2024-05-28 19:20:45] [INFO ] Flatten gal took : 37 ms
[2024-05-28 19:20:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 17 ms.
[2024-05-28 19:20:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality14413836523576648961.gal : 4 ms
[2024-05-28 19:20:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality8680640200543625720.ctl : 4 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/CTLCardinality14413836523576648961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8680640200543625720.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.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 21 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-05-28 19:21:15] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 483 cols
[2024-05-28 19:21:15] [INFO ] Computed 77 invariants in 12 ms
[2024-05-28 19:21:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:21:31] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-05-28 19:21:31] [INFO ] Deduced a trap composed of 203 places in 134 ms of which 3 ms to minimize.
[2024-05-28 19:21:31] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:21:31] [INFO ] Deduced a trap composed of 209 places in 138 ms of which 2 ms to minimize.
[2024-05-28 19:21:31] [INFO ] Deduced a trap composed of 209 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:21:32] [INFO ] Deduced a trap composed of 203 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:21:32] [INFO ] Deduced a trap composed of 203 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:21:32] [INFO ] Deduced a trap composed of 200 places in 152 ms of which 3 ms to minimize.
[2024-05-28 19:21:32] [INFO ] Deduced a trap composed of 212 places in 154 ms of which 15 ms to minimize.
[2024-05-28 19:21:32] [INFO ] Deduced a trap composed of 212 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:21:32] [INFO ] Deduced a trap composed of 206 places in 136 ms of which 3 ms to minimize.
[2024-05-28 19:21:34] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:21:34] [INFO ] Deduced a trap composed of 203 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:21:34] [INFO ] Deduced a trap composed of 264 places in 159 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 14/91 constraints. Problems are: Problem set: 17 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 91 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:21:38] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 1/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 5/482 variables, 5/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 12/89 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:21:46] [INFO ] Deduced a trap composed of 209 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:21:48] [INFO ] Deduced a trap composed of 222 places in 138 ms of which 3 ms to minimize.
[2024-05-28 19:21:48] [INFO ] Deduced a trap composed of 230 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:21:48] [INFO ] Deduced a trap composed of 224 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:21:48] [INFO ] Deduced a trap composed of 226 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:21:50] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 6/95 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:21:52] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-05-28 19:21:54] [INFO ] Deduced a trap composed of 194 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:21:54] [INFO ] Deduced a trap composed of 194 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:21:54] [INFO ] Deduced a trap composed of 229 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:21:54] [INFO ] Deduced a trap composed of 224 places in 138 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1145 variables, and 100 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 24/26 constraints]
After SMT, in 40986ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 40998ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2024-05-28 19:21:56] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-28 19:21:56] [INFO ] Computed 77 invariants in 14 ms
[2024-05-28 19:21:57] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-28 19:21:57] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-28 19:21:57] [INFO ] Invariant cache hit.
[2024-05-28 19:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:21:58] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 1854 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 6 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42882 ms. Remains : 483/489 places, 649/667 transitions.
[2024-05-28 19:21:58] [INFO ] Flatten gal took : 23 ms
[2024-05-28 19:21:58] [INFO ] Flatten gal took : 25 ms
[2024-05-28 19:21:58] [INFO ] Input system was already deterministic with 649 transitions.
[2024-05-28 19:21:58] [INFO ] Flatten gal took : 18 ms
[2024-05-28 19:21:58] [INFO ] Flatten gal took : 18 ms
[2024-05-28 19:21:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality11951865747686776632.gal : 3 ms
[2024-05-28 19:21:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality9274360375574896158.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/CTLCardinality11951865747686776632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9274360375574896158.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 19:22:28] [INFO ] Flatten gal took : 39 ms
[2024-05-28 19:22:28] [INFO ] Applying decomposition
[2024-05-28 19:22:29] [INFO ] Flatten gal took : 33 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/graph3682586156747014609.txt' '-o' '/tmp/graph3682586156747014609.bin' '-w' '/tmp/graph3682586156747014609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3682586156747014609.bin' '-l' '-1' '-v' '-w' '/tmp/graph3682586156747014609.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:22:29] [INFO ] Decomposing Gal with order
[2024-05-28 19:22:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:22:29] [INFO ] Removed a total of 661 redundant transitions.
[2024-05-28 19:22:29] [INFO ] Flatten gal took : 62 ms
[2024-05-28 19:22:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 5 ms.
[2024-05-28 19:22:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15394641374952244786.gal : 23 ms
[2024-05-28 19:22:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6413408546173039202.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/CTLCardinality15394641374952244786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6413408546173039202.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 : 489/489 places, 667/667 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 666
Applied a total of 7 rules in 10 ms. Remains 483 /489 variables (removed 6) and now considering 666/667 (removed 1) transitions.
Running 660 sub problems to find dead transitions.
[2024-05-28 19:22:59] [INFO ] Flow matrix only has 662 transitions (discarded 4 similar events)
// Phase 1: matrix 662 rows 483 cols
[2024-05-28 19:22:59] [INFO ] Computed 77 invariants in 5 ms
[2024-05-28 19:22:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 5/482 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/483 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:23:15] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 2 ms to minimize.
[2024-05-28 19:23:15] [INFO ] Deduced a trap composed of 203 places in 138 ms of which 3 ms to minimize.
[2024-05-28 19:23:15] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:23:15] [INFO ] Deduced a trap composed of 209 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:23:16] [INFO ] Deduced a trap composed of 209 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:23:16] [INFO ] Deduced a trap composed of 203 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:23:16] [INFO ] Deduced a trap composed of 203 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:23:16] [INFO ] Deduced a trap composed of 200 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:23:16] [INFO ] Deduced a trap composed of 212 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:23:16] [INFO ] Deduced a trap composed of 212 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:23:17] [INFO ] Deduced a trap composed of 206 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:23:18] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:23:18] [INFO ] Deduced a trap composed of 203 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:23:18] [INFO ] Deduced a trap composed of 264 places in 167 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1145 variables, and 91 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 17 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 66/66 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 5/71 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:23:22] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 1/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/72 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 5/482 variables, 5/77 constraints. Problems are: Problem set: 17 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 12/89 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:23:29] [INFO ] Deduced a trap composed of 209 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:23:31] [INFO ] Deduced a trap composed of 222 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:23:31] [INFO ] Deduced a trap composed of 230 places in 145 ms of which 2 ms to minimize.
[2024-05-28 19:23:31] [INFO ] Deduced a trap composed of 224 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:23:31] [INFO ] Deduced a trap composed of 226 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:23:33] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 6/95 constraints. Problems are: Problem set: 17 solved, 643 unsolved
[2024-05-28 19:23:35] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-05-28 19:23:37] [INFO ] Deduced a trap composed of 194 places in 199 ms of which 3 ms to minimize.
[2024-05-28 19:23:37] [INFO ] Deduced a trap composed of 194 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:23:37] [INFO ] Deduced a trap composed of 229 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:23:37] [INFO ] Deduced a trap composed of 224 places in 155 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/1145 variables, and 100 constraints, problems are : Problem set: 17 solved, 643 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 24/26 constraints]
After SMT, in 41000ms problems are : Problem set: 17 solved, 643 unsolved
Search for dead transitions found 17 dead transitions in 41006ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2024-05-28 19:23:40] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-28 19:23:40] [INFO ] Computed 77 invariants in 6 ms
[2024-05-28 19:23:40] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-28 19:23:40] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-28 19:23:40] [INFO ] Invariant cache hit.
[2024-05-28 19:23:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:23:42] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1859 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/667 transitions.
Applied a total of 0 rules in 11 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42889 ms. Remains : 483/489 places, 649/667 transitions.
[2024-05-28 19:23:42] [INFO ] Flatten gal took : 36 ms
[2024-05-28 19:23:42] [INFO ] Flatten gal took : 32 ms
[2024-05-28 19:23:42] [INFO ] Input system was already deterministic with 649 transitions.
[2024-05-28 19:23:42] [INFO ] Flatten gal took : 25 ms
[2024-05-28 19:23:42] [INFO ] Flatten gal took : 25 ms
[2024-05-28 19:23:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality13987901379384402966.gal : 4 ms
[2024-05-28 19:23:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality16970368901722196318.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/CTLCardinality13987901379384402966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16970368901722196318.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 19:24:12] [INFO ] Flatten gal took : 18 ms
[2024-05-28 19:24:12] [INFO ] Applying decomposition
[2024-05-28 19:24:12] [INFO ] Flatten gal took : 18 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/graph10813208883158004601.txt' '-o' '/tmp/graph10813208883158004601.bin' '-w' '/tmp/graph10813208883158004601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10813208883158004601.bin' '-l' '-1' '-v' '-w' '/tmp/graph10813208883158004601.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:24:12] [INFO ] Decomposing Gal with order
[2024-05-28 19:24:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:24:12] [INFO ] Removed a total of 661 redundant transitions.
[2024-05-28 19:24:12] [INFO ] Flatten gal took : 61 ms
[2024-05-28 19:24:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 7 ms.
[2024-05-28 19:24:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality3435182013333238174.gal : 24 ms
[2024-05-28 19:24:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9366256285359774522.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/CTLCardinality3435182013333238174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9366256285359774522.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.
[2024-05-28 19:24:42] [INFO ] Flatten gal took : 50 ms
[2024-05-28 19:24:42] [INFO ] Flatten gal took : 33 ms
[2024-05-28 19:24:42] [INFO ] Applying decomposition
[2024-05-28 19:24:42] [INFO ] Flatten gal took : 28 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/graph9064199936667920268.txt' '-o' '/tmp/graph9064199936667920268.bin' '-w' '/tmp/graph9064199936667920268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9064199936667920268.bin' '-l' '-1' '-v' '-w' '/tmp/graph9064199936667920268.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:24:42] [INFO ] Decomposing Gal with order
[2024-05-28 19:24:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:24:43] [INFO ] Removed a total of 951 redundant transitions.
[2024-05-28 19:24:43] [INFO ] Flatten gal took : 120 ms
[2024-05-28 19:24:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 5 ms.
[2024-05-28 19:24:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality14169072167123275189.gal : 5 ms
[2024-05-28 19:24:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality17909782126218409945.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/CTLCardinality14169072167123275189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17909782126218409945.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 8 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 19:34:08] [INFO ] Applying decomposition
[2024-05-28 19:34:08] [INFO ] Flatten gal took : 25 ms
[2024-05-28 19:34:08] [INFO ] Decomposing Gal with order
[2024-05-28 19:34:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:34:08] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[Schedule_Task_E_0],[Schedule_Task_E_1],[Schedule_Task_E_2],[Schedule_Task_E_3],[Schedule_Task_E_4],[Schedule_Task_E_5],[Schedule_Task_E_6],[Schedule_Task_E_7],[Schedule_Task_E_8],[Schedule_Task_E_9],[Schedule_Task_E_10],[Schedule_Task_E_11],[Schedule_Task_E_12],[Schedule_Task_E_13],[Schedule_Task_E_14],[Schedule_Task_E_15],[Schedule_Task_E_16],[Schedule_Task_E_17],[Schedule_Task_E_18],[Schedule_Task_E_19],[Schedule_Task_E_20],[Schedule_Task_E_21],[Schedule_Task_E_22],[Schedule_Task_E_23],[Schedule_Task_E_24],[Schedule_Task_E_25],[Schedule_Task_E_26],[Schedule_Task_E_27],[Schedule_Task_E_28],[Schedule_Task_E_29],[Schedule_Task_E_30],[Schedule_Task_E_31],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0, Perform_Work_B_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1, Perform_Work_B_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2, Perform_Work_B_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3, Perform_Work_B_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4, Perform_Work_B_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5, Perform_Work_B_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6, Perform_Work_B_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7, Perform_Work_B_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8, Perform_Work_B_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9, Perform_Work_B_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10, Perform_Work_B_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11, Perform_Work_B_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12, Perform_Work_B_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13, Perform_Work_B_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14, Perform_Work_B_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15, Perform_Work_B_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16, Perform_Work_B_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17, Perform_Work_B_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18, Perform_Work_B_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19, Perform_Work_B_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20, Perform_Work_B_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21, Perform_Work_B_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22, Perform_Work_B_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23, Perform_Work_B_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24, Perform_Work_B_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25, Perform_Work_B_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26, Perform_Work_B_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27, Perform_Work_B_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28, Perform_Work_B_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29, Perform_Work_B_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30, Perform_Work_B_30],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[ModifiedSrc_0, DataOnSrc_0, TheSour_0],[ModifiedSrc_1, DataOnSrc_1, TheSour_1],[ModifiedSrc_2, DataOnSrc_2, TheSour_2],[ModifiedSrc_3, DataOnSrc_3, TheSour_3],[ModifiedSrc_4, DataOnSrc_4, TheSour_4],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 19:34:08] [INFO ] Flatten gal took : 25 ms
[2024-05-28 19:34:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6898613505306745624.gal : 4 ms
[2024-05-28 19:34:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality7665922769368995097.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/CTLCardinality6898613505306745624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7665922769368995097.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 19:45:40] [INFO ] Flatten gal took : 42 ms
[2024-05-28 19:45:40] [INFO ] Input system was already deterministic with 667 transitions.
[2024-05-28 19:45:40] [INFO ] Transformed 489 places.
[2024-05-28 19:45:40] [INFO ] Transformed 667 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 19:46:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality86266300200441044.gal : 8 ms
[2024-05-28 19:46:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality14612456154509120819.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/CTLCardinality86266300200441044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14612456154509120819.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 -...327
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3145728 ms.

BK_STOP 1716926288961

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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