MCC'2024- Execution of r290-tajo-171654446300089

About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16206.071	3024874.00	3278317.00	2461.10	F???TF?TTT??????	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446300089.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 PolyORBLF-COL-S02J04T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446300089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T10-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716903489186

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-28 13:38:10] [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 13:38:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:38:11] [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 13:38:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:38:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1010 ms
[2024-05-28 13:38:12] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 53 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
[2024-05-28 13:38:12] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 13:38:12] [INFO ] Skeletonized 16 HLPN properties in 4 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 (15 resets) in 2497 ms. (16 steps per ms) remains 74/95 properties
BEST_FIRST walk for 4000 steps (8 resets) in 87 ms. (45 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 146 ms. (27 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 79 ms. (50 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (9 resets) in 37 ms. (105 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (9 resets) in 54 ms. (72 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 55 ms. (71 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (9 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (9 resets) in 32 ms. (121 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 73/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (9 resets) in 31 ms. (125 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 67 ms. (58 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 82 ms. (48 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 62 ms. (63 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (9 resets) in 43 ms. (90 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 59 ms. (66 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (9 resets) in 39 ms. (100 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 73/73 properties
[2024-05-28 13:38:14] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 13:38:15] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 13:38:15] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp70 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 63 unsolved
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 2/6 constraints. Problems are: Problem set: 11 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 11 solved, 62 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/75 variables, 7/13 constraints. Problems are: Problem set: 49 solved, 24 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/15 constraints. Problems are: Problem set: 50 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 50 solved, 23 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 6 (OVERLAPS) 6/81 variables, 11/26 constraints. Problems are: Problem set: 70 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 70 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 70 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 70 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 70 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 70 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 70 solved, 3 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 70 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 70 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 38/51 variables, 7/7 constraints. Problems are: Problem set: 70 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 70 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 3/10 constraints. Problems are: Problem set: 70 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 70 solved, 3 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 5 (OVERLAPS) 24/78 variables, 13/23 constraints. Problems are: Problem set: 71 solved, 2 unsolved
[2024-05-28 13:38:16] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 37 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/24 constraints. Problems are: Problem set: 71 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 71 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 71 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 71 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/81 variables, 2/27 constraints. Problems are: Problem set: 71 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 71 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 64/145 variables, 81/108 constraints. Problems are: Problem set: 71 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 8/116 constraints. Problems are: Problem set: 71 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 2/118 constraints. Problems are: Problem set: 71 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 71 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 71 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 118 constraints, problems are : Problem set: 71 solved, 2 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/73 constraints, Known Traps: 1/1 constraints]
After SMT, in 1754ms problems are : Problem set: 71 solved, 2 unsolved
Parikh walk visited 0 properties in 1392 ms.
Support contains 9 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 60
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 75 transition count 60
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 75 transition count 57
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 27 place count 67 transition count 52
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 67 transition count 49
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 64 transition count 49
Applied a total of 33 rules in 53 ms. Remains 64 /81 variables (removed 17) and now considering 49/65 (removed 16) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-28 13:38:18] [INFO ] Flow matrix only has 48 transitions (discarded 1 similar events)
// Phase 1: matrix 48 rows 64 cols
[2024-05-28 13:38:18] [INFO ] Computed 25 invariants in 4 ms
[2024-05-28 13:38:18] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/64 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 46 unsolved
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 2/34 constraints. Problems are: Problem set: 2 solved, 46 unsolved
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 2/36 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 48/112 variables, 64/100 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/112 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 108 constraints, problems are : Problem set: 2 solved, 46 unsolved in 1924 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 64/64 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 2 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/32 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 3/36 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 48/112 variables, 64/100 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 46/154 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 154 constraints, problems are : Problem set: 2 solved, 46 unsolved in 1435 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 64/64 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 46/48 constraints, Known Traps: 11/11 constraints]
After SMT, in 3402ms problems are : Problem set: 2 solved, 46 unsolved
Search for dead transitions found 2 dead transitions in 3404ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/81 places, 47/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 61 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 9 ms. Remains 61 /64 variables (removed 3) and now considering 43/47 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3490 ms. Remains : 61/81 places, 43/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (33 resets) in 745 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 469 ms. (85 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5685 steps, run visited all 1 properties in 35 ms. (steps per millisecond=162 )
Probabilistic random walk after 5685 steps, saw 2954 distinct states, run finished after 53 ms. (steps per millisecond=107 ) properties seen :1
Successfully simplified 72 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:38:22] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 13:38:22] [INFO ] Flatten gal took : 53 ms
[2024-05-28 13:38:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:38:22] [INFO ] Flatten gal took : 17 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 13:38:22] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 65 ms.
[2024-05-28 13:38:22] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 595 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 21 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-28 13:38:22] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-28 13:38:22] [INFO ] Computed 54 invariants in 58 ms
[2024-05-28 13:38:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 3 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 6 ms to minimize.
[2024-05-28 13:38:38] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 3 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 7 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:38:39] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 373 places in 415 ms of which 6 ms to minimize.
[2024-05-28 13:38:40] [INFO ] Deduced a trap composed of 381 places in 341 ms of which 5 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 237 places in 284 ms of which 5 ms to minimize.
[2024-05-28 13:38:41] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 407 places in 276 ms of which 4 ms to minimize.
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 441 places in 301 ms of which 4 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 432 places in 274 ms of which 4 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 413 places in 286 ms of which 4 ms to minimize.
[2024-05-28 13:38:43] [INFO ] Deduced a trap composed of 410 places in 262 ms of which 3 ms to minimize.
[2024-05-28 13:38:44] [INFO ] Deduced a trap composed of 381 places in 306 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 69 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:38:46] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:38:47] [INFO ] Deduced a trap composed of 459 places in 369 ms of which 5 ms to minimize.
[2024-05-28 13:39:02] [INFO ] Deduced a trap composed of 85 places in 190 ms of which 4 ms to minimize.
[2024-05-28 13:39:02] [INFO ] Deduced a trap composed of 84 places in 177 ms of which 8 ms to minimize.
[2024-05-28 13:39:02] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 3 ms to minimize.
[2024-05-28 13:39:02] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 3 ms to minimize.
[2024-05-28 13:39:02] [INFO ] Deduced a trap composed of 84 places in 164 ms of which 4 ms to minimize.
[2024-05-28 13:39:03] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 77 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 27/27 constraints]
After SMT, in 42477ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42500ms
[2024-05-28 13:39:04] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:39:04] [INFO ] Invariant cache hit.
[2024-05-28 13:39:05] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-28 13:39:05] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:39:05] [INFO ] Invariant cache hit.
[2024-05-28 13:39:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:39:09] [INFO ] Implicit Places using invariants and state equation in 4585 ms returned []
Implicit Place search using SMT with State Equation took 4866 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2024-05-28 13:39:09] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:39:09] [INFO ] Invariant cache hit.
[2024-05-28 13:39:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:39:28] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:39:33] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:39:34] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:39:34] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 2 ms to minimize.
[2024-05-28 13:39:34] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 3 ms to minimize.
[2024-05-28 13:39:34] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 4 ms to minimize.
[2024-05-28 13:39:34] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:39:34] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:39:34] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:39:35] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
[2024-05-28 13:39:35] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:39:37] [INFO ] Deduced a trap composed of 432 places in 413 ms of which 6 ms to minimize.
[2024-05-28 13:39:38] [INFO ] Deduced a trap composed of 397 places in 381 ms of which 5 ms to minimize.
[2024-05-28 13:39:38] [INFO ] Deduced a trap composed of 369 places in 398 ms of which 5 ms to minimize.
[2024-05-28 13:39:39] [INFO ] Deduced a trap composed of 384 places in 361 ms of which 6 ms to minimize.
[2024-05-28 13:39:39] [INFO ] Deduced a trap composed of 424 places in 357 ms of which 5 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 748/2144 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:39:44] [INFO ] Deduced a trap composed of 205 places in 318 ms of which 4 ms to minimize.
[2024-05-28 13:39:44] [INFO ] Deduced a trap composed of 246 places in 341 ms of which 6 ms to minimize.
[2024-05-28 13:39:45] [INFO ] Deduced a trap composed of 381 places in 361 ms of which 6 ms to minimize.
[2024-05-28 13:39:45] [INFO ] Deduced a trap composed of 451 places in 330 ms of which 6 ms to minimize.
[2024-05-28 13:39:46] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 3 ms to minimize.
[2024-05-28 13:39:54] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 4 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 415 places in 415 ms of which 6 ms to minimize.
[2024-05-28 13:40:04] [INFO ] Deduced a trap composed of 402 places in 381 ms of which 11 ms to minimize.
[2024-05-28 13:40:06] [INFO ] Deduced a trap composed of 377 places in 387 ms of which 6 ms to minimize.
[2024-05-28 13:40:06] [INFO ] Deduced a trap composed of 402 places in 363 ms of which 5 ms to minimize.
[2024-05-28 13:40:07] [INFO ] Deduced a trap composed of 369 places in 350 ms of which 5 ms to minimize.
[2024-05-28 13:40:10] [INFO ] Deduced a trap composed of 524 places in 354 ms of which 6 ms to minimize.
[2024-05-28 13:40:10] [INFO ] Deduced a trap composed of 462 places in 320 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 79 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 29/29 constraints]
After SMT, in 62471ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62511ms
Finished structural reductions in LTL mode , in 1 iterations and 109919 ms. Remains : 752/752 places, 1412/1412 transitions.
Support contains 595 out of 752 places after structural reductions.
[2024-05-28 13:40:12] [INFO ] Flatten gal took : 135 ms
[2024-05-28 13:40:12] [INFO ] Flatten gal took : 110 ms
[2024-05-28 13:40:12] [INFO ] Input system was already deterministic with 1412 transitions.
RANDOM walk for 40000 steps (11 resets) in 1525 ms. (26 steps per ms) remains 54/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 151 ms. (26 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
[2024-05-28 13:40:14] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:40:14] [INFO ] Invariant cache hit.
[2024-05-28 13:40:14] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp44 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 19/21 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 51 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 3 (OVERLAPS) 174/647 variables, 13/34 constraints. Problems are: Problem set: 19 solved, 35 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 5/39 constraints. Problems are: Problem set: 24 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/647 variables, 0/39 constraints. Problems are: Problem set: 24 solved, 30 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 6 (OVERLAPS) 105/752 variables, 15/54 constraints. Problems are: Problem set: 50 solved, 4 unsolved
[2024-05-28 13:40:15] [INFO ] Deduced a trap composed of 216 places in 401 ms of which 6 ms to minimize.
[2024-05-28 13:40:16] [INFO ] Deduced a trap composed of 286 places in 370 ms of which 6 ms to minimize.
[2024-05-28 13:40:16] [INFO ] Deduced a trap composed of 67 places in 267 ms of which 5 ms to minimize.
[2024-05-28 13:40:16] [INFO ] Deduced a trap composed of 66 places in 228 ms of which 4 ms to minimize.
[2024-05-28 13:40:16] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 4 ms to minimize.
[2024-05-28 13:40:17] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 3 ms to minimize.
[2024-05-28 13:40:17] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 7/61 constraints. Problems are: Problem set: 50 solved, 4 unsolved
[2024-05-28 13:40:17] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 3 ms to minimize.
[2024-05-28 13:40:17] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-05-28 13:40:17] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2024-05-28 13:40:17] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-28 13:40:17] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 5/66 constraints. Problems are: Problem set: 50 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/66 constraints. Problems are: Problem set: 50 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1392/2144 variables, 752/818 constraints. Problems are: Problem set: 50 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 938 constraints, problems are : Problem set: 50 solved, 4 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 50 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 50 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 265/371 variables, 7/7 constraints. Problems are: Problem set: 50 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/7 constraints. Problems are: Problem set: 50 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 33/404 variables, 6/13 constraints. Problems are: Problem set: 50 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/13 constraints. Problems are: Problem set: 50 solved, 4 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 5 (OVERLAPS) 344/748 variables, 37/50 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/748 variables, 12/62 constraints. Problems are: Problem set: 51 solved, 3 unsolved
[2024-05-28 13:40:20] [INFO ] Deduced a trap composed of 460 places in 409 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/748 variables, 1/63 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/63 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/750 variables, 2/65 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/65 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/752 variables, 2/67 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/752 variables, 0/67 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1392/2144 variables, 752/819 constraints. Problems are: Problem set: 51 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2144/2144 variables, and 939 constraints, problems are : Problem set: 51 solved, 3 unsolved in 4213 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/54 constraints, Known Traps: 13/13 constraints]
After SMT, in 9371ms problems are : Problem set: 51 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 436 ms.
Support contains 74 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 750 transition count 1362
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 700 transition count 1362
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 102 place count 700 transition count 1282
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 262 place count 620 transition count 1282
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 382 place count 560 transition count 1222
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 2 with 30 rules applied. Total rules applied 412 place count 560 transition count 1192
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 442 place count 530 transition count 1192
Applied a total of 442 rules in 186 ms. Remains 530 /752 variables (removed 222) and now considering 1192/1412 (removed 220) transitions.
Running 1190 sub problems to find dead transitions.
[2024-05-28 13:40:24] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
// Phase 1: matrix 1172 rows 530 cols
[2024-05-28 13:40:24] [INFO ] Computed 52 invariants in 22 ms
[2024-05-28 13:40:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:40:36] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-28 13:40:36] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 2 ms to minimize.
[2024-05-28 13:40:36] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-28 13:40:37] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
[2024-05-28 13:40:37] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-05-28 13:40:37] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:40:37] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:40:37] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:40:37] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:40:39] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:40:41] [INFO ] Deduced a trap composed of 46 places in 303 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 528/1702 variables, and 61 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 221 places in 287 ms of which 3 ms to minimize.
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 209 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:40:49] [INFO ] Deduced a trap composed of 221 places in 227 ms of which 2 ms to minimize.
[2024-05-28 13:40:49] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:40:49] [INFO ] Deduced a trap composed of 222 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:40:49] [INFO ] Deduced a trap composed of 183 places in 211 ms of which 3 ms to minimize.
[2024-05-28 13:40:51] [INFO ] Deduced a trap composed of 224 places in 279 ms of which 4 ms to minimize.
[2024-05-28 13:40:51] [INFO ] Deduced a trap composed of 212 places in 195 ms of which 3 ms to minimize.
[2024-05-28 13:40:51] [INFO ] Deduced a trap composed of 212 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:40:54] [INFO ] Deduced a trap composed of 336 places in 303 ms of which 4 ms to minimize.
[2024-05-28 13:41:04] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 4 ms to minimize.
[2024-05-28 13:41:05] [INFO ] Deduced a trap composed of 182 places in 298 ms of which 4 ms to minimize.
[2024-05-28 13:41:06] [INFO ] Deduced a trap composed of 200 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:41:06] [INFO ] Deduced a trap composed of 200 places in 208 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1702 variables, and 76 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 26/26 constraints]
After SMT, in 42512ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 42523ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42712 ms. Remains : 530/752 places, 1192/1412 transitions.
RANDOM walk for 40000 steps (12 resets) in 570 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/3 properties
[2024-05-28 13:41:07] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:41:07] [INFO ] Invariant cache hit.
[2024-05-28 13:41:07] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/287 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/310 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 212/522 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 13:41:07] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 4 ms to minimize.
[2024-05-28 13:41:07] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 4 ms to minimize.
[2024-05-28 13:41:08] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 4 ms to minimize.
[2024-05-28 13:41:08] [INFO ] Deduced a trap composed of 88 places in 275 ms of which 4 ms to minimize.
[2024-05-28 13:41:08] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:41:08] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 91 places in 303 ms of which 4 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 43 places in 313 ms of which 4 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 4 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 89 places in 273 ms of which 3 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 291 places in 236 ms of which 3 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/525 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/528 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1172/1700 variables, 528/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 120/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1702 variables, 2/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1702 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1702 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1702 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1702/1702 variables, and 716 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4628 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 530/530 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/287 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/310 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 212/522 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/525 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 13:41:12] [INFO ] Deduced a trap composed of 268 places in 275 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/528 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 13:41:12] [INFO ] Deduced a trap composed of 88 places in 267 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 13:41:13] [INFO ] Deduced a trap composed of 200 places in 292 ms of which 4 ms to minimize.
[2024-05-28 13:41:13] [INFO ] Deduced a trap composed of 246 places in 280 ms of which 4 ms to minimize.
[2024-05-28 13:41:13] [INFO ] Deduced a trap composed of 182 places in 302 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1172/1700 variables, 528/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1700 variables, 120/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1702 variables, and 720 constraints, problems are : Problem set: 0 solved, 2 unsolved in 21600 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 528/530 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 26268ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4462 ms.
Support contains 73 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1192/1192 transitions.
Applied a total of 0 rules in 40 ms. Remains 530 /530 variables (removed 0) and now considering 1192/1192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 530/530 places, 1192/1192 transitions.
RANDOM walk for 40001 steps (15 resets) in 397 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 187978 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 187978 steps, saw 105177 distinct states, run finished after 3005 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-28 13:41:41] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:41:41] [INFO ] Invariant cache hit.
[2024-05-28 13:41:41] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/287 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/310 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 212/522 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 13:41:41] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 4 ms to minimize.
[2024-05-28 13:41:41] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 4 ms to minimize.
[2024-05-28 13:41:42] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 3 ms to minimize.
[2024-05-28 13:41:42] [INFO ] Deduced a trap composed of 88 places in 220 ms of which 3 ms to minimize.
[2024-05-28 13:41:42] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2024-05-28 13:41:42] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 1 ms to minimize.
[2024-05-28 13:41:42] [INFO ] Deduced a trap composed of 91 places in 219 ms of which 3 ms to minimize.
[2024-05-28 13:41:43] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 4 ms to minimize.
[2024-05-28 13:41:43] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 4 ms to minimize.
[2024-05-28 13:41:43] [INFO ] Deduced a trap composed of 89 places in 254 ms of which 4 ms to minimize.
[2024-05-28 13:41:43] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:41:44] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 3 ms to minimize.
[2024-05-28 13:41:44] [INFO ] Deduced a trap composed of 291 places in 220 ms of which 3 ms to minimize.
[2024-05-28 13:41:44] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/525 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/528 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1172/1700 variables, 528/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 120/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1702 variables, 2/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1702 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1702 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1702 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1702/1702 variables, and 716 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3985 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 530/530 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/287 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/310 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 212/522 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/525 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 13:41:45] [INFO ] Deduced a trap composed of 268 places in 283 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/528 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 13:41:46] [INFO ] Deduced a trap composed of 88 places in 230 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 13:41:46] [INFO ] Deduced a trap composed of 200 places in 279 ms of which 3 ms to minimize.
[2024-05-28 13:41:46] [INFO ] Deduced a trap composed of 246 places in 261 ms of which 3 ms to minimize.
[2024-05-28 13:41:46] [INFO ] Deduced a trap composed of 182 places in 253 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1172/1700 variables, 528/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1700 variables, 120/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1700 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1702 variables, and 720 constraints, problems are : Problem set: 0 solved, 2 unsolved in 44733 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 528/530 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 48741ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1573 ms.
Support contains 73 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1192/1192 transitions.
Applied a total of 0 rules in 22 ms. Remains 530 /530 variables (removed 0) and now considering 1192/1192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 530/530 places, 1192/1192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1192/1192 transitions.
Applied a total of 0 rules in 18 ms. Remains 530 /530 variables (removed 0) and now considering 1192/1192 (removed 0) transitions.
[2024-05-28 13:42:31] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:42:31] [INFO ] Invariant cache hit.
[2024-05-28 13:42:31] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-28 13:42:31] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:42:31] [INFO ] Invariant cache hit.
[2024-05-28 13:42:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:42:37] [INFO ] Implicit Places using invariants and state equation in 5723 ms returned []
Implicit Place search using SMT with State Equation took 6136 ms to find 0 implicit places.
[2024-05-28 13:42:37] [INFO ] Redundant transitions in 99 ms returned []
Running 1190 sub problems to find dead transitions.
[2024-05-28 13:42:37] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2024-05-28 13:42:37] [INFO ] Invariant cache hit.
[2024-05-28 13:42:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:42:48] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-05-28 13:42:49] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-28 13:42:49] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:42:49] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:42:49] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:42:49] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:42:49] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:42:49] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:42:49] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:42:49] [INFO ] Deduced a trap composed of 193 places in 300 ms of which 3 ms to minimize.
[2024-05-28 13:42:50] [INFO ] Deduced a trap composed of 201 places in 274 ms of which 3 ms to minimize.
[2024-05-28 13:42:52] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:42:55] [INFO ] Deduced a trap composed of 46 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1702 variables, and 63 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:43:17] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:43:23] [INFO ] Deduced a trap composed of 204 places in 291 ms of which 4 ms to minimize.
[2024-05-28 13:43:23] [INFO ] Deduced a trap composed of 191 places in 271 ms of which 3 ms to minimize.
[2024-05-28 13:43:23] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:43:24] [INFO ] Deduced a trap composed of 179 places in 181 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
[2024-05-28 13:43:31] [INFO ] Deduced a trap composed of 320 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:43:40] [INFO ] Deduced a trap composed of 198 places in 307 ms of which 4 ms to minimize.
SMT process timed out in 62579ms, After SMT, problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 62597ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68867 ms. Remains : 530/530 places, 1192/1192 transitions.
Successfully simplified 51 atomic propositions for a total of 11 simplifications.
[2024-05-28 13:43:40] [INFO ] Flatten gal took : 76 ms
[2024-05-28 13:43:40] [INFO ] Flatten gal took : 73 ms
[2024-05-28 13:43:40] [INFO ] Input system was already deterministic with 1412 transitions.
Support contains 206 out of 752 places (down from 297) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 67 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:43:40] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 13:43:40] [INFO ] Computed 52 invariants in 32 ms
[2024-05-28 13:43:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:43:55] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:43:55] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:43:55] [INFO ] Deduced a trap composed of 404 places in 382 ms of which 5 ms to minimize.
[2024-05-28 13:43:56] [INFO ] Deduced a trap composed of 209 places in 352 ms of which 5 ms to minimize.
[2024-05-28 13:43:57] [INFO ] Deduced a trap composed of 75 places in 174 ms of which 2 ms to minimize.
[2024-05-28 13:43:58] [INFO ] Deduced a trap composed of 440 places in 377 ms of which 5 ms to minimize.
[2024-05-28 13:43:58] [INFO ] Deduced a trap composed of 432 places in 359 ms of which 5 ms to minimize.
[2024-05-28 13:43:58] [INFO ] Deduced a trap composed of 393 places in 379 ms of which 6 ms to minimize.
[2024-05-28 13:43:59] [INFO ] Deduced a trap composed of 411 places in 354 ms of which 6 ms to minimize.
[2024-05-28 13:43:59] [INFO ] Deduced a trap composed of 392 places in 294 ms of which 4 ms to minimize.
[2024-05-28 13:43:59] [INFO ] Deduced a trap composed of 370 places in 340 ms of which 5 ms to minimize.
[2024-05-28 13:44:00] [INFO ] Deduced a trap composed of 404 places in 366 ms of which 5 ms to minimize.
[2024-05-28 13:44:01] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:44:05] [INFO ] Deduced a trap composed of 360 places in 370 ms of which 6 ms to minimize.
[2024-05-28 13:44:15] [INFO ] Deduced a trap composed of 491 places in 354 ms of which 6 ms to minimize.
[2024-05-28 13:44:15] [INFO ] Deduced a trap composed of 493 places in 326 ms of which 5 ms to minimize.
[2024-05-28 13:44:15] [INFO ] Deduced a trap composed of 389 places in 342 ms of which 6 ms to minimize.
[2024-05-28 13:44:16] [INFO ] Deduced a trap composed of 381 places in 350 ms of which 4 ms to minimize.
[2024-05-28 13:44:16] [INFO ] Deduced a trap composed of 379 places in 383 ms of which 5 ms to minimize.
[2024-05-28 13:44:17] [INFO ] Deduced a trap composed of 448 places in 375 ms of which 6 ms to minimize.
[2024-05-28 13:44:17] [INFO ] Deduced a trap composed of 357 places in 315 ms of which 4 ms to minimize.
[2024-05-28 13:44:19] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 3 ms to minimize.
[2024-05-28 13:44:19] [INFO ] Deduced a trap composed of 23 places in 160 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 Int declared 728/2102 variables, and 80 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 30/30 constraints]
After SMT, in 41765ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41780ms
[2024-05-28 13:44:22] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:44:22] [INFO ] Invariant cache hit.
[2024-05-28 13:44:23] [INFO ] Implicit Places using invariants in 419 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 425 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 14 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42292 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 13:44:23] [INFO ] Flatten gal took : 40 ms
[2024-05-28 13:44:23] [INFO ] Flatten gal took : 42 ms
[2024-05-28 13:44:23] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 13:44:23] [INFO ] Flatten gal took : 42 ms
[2024-05-28 13:44:23] [INFO ] Flatten gal took : 41 ms
[2024-05-28 13:44:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality3414471844097126438.gal : 25 ms
[2024-05-28 13:44:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality6358535060681267482.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/CTLCardinality3414471844097126438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6358535060681267482.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 13:44:53] [INFO ] Flatten gal took : 80 ms
[2024-05-28 13:44:53] [INFO ] Applying decomposition
[2024-05-28 13:44:53] [INFO ] Flatten gal took : 62 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/graph6700765414426720976.txt' '-o' '/tmp/graph6700765414426720976.bin' '-w' '/tmp/graph6700765414426720976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6700765414426720976.bin' '-l' '-1' '-v' '-w' '/tmp/graph6700765414426720976.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:44:54] [INFO ] Decomposing Gal with order
[2024-05-28 13:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:44:54] [INFO ] Removed a total of 1478 redundant transitions.
[2024-05-28 13:44:54] [INFO ] Flatten gal took : 387 ms
[2024-05-28 13:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 82 ms.
[2024-05-28 13:44:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality11843047872579255619.gal : 40 ms
[2024-05-28 13:44:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality13967662779118812485.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/CTLCardinality11843047872579255619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13967662779118812485.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 99 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:45:24] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:45:25] [INFO ] Invariant cache hit.
[2024-05-28 13:45:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:45:41] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-28 13:45:42] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-05-28 13:45:42] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:45:42] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:45:43] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:45:49] [INFO ] Deduced a trap composed of 203 places in 352 ms of which 5 ms to minimize.
[2024-05-28 13:45:49] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-28 13:45:50] [INFO ] Deduced a trap composed of 367 places in 341 ms of which 5 ms to minimize.
[2024-05-28 13:45:59] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2024-05-28 13:45:59] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 2 ms to minimize.
[2024-05-28 13:46:00] [INFO ] Deduced a trap composed of 491 places in 382 ms of which 5 ms to minimize.
[2024-05-28 13:46:01] [INFO ] Deduced a trap composed of 491 places in 371 ms of which 5 ms to minimize.
[2024-05-28 13:46:01] [INFO ] Deduced a trap composed of 491 places in 362 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 9)
(s203 1)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 67 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints]
After SMT, in 41987ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42008ms
[2024-05-28 13:46:06] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:46:06] [INFO ] Invariant cache hit.
[2024-05-28 13:46:07] [INFO ] Implicit Places using invariants in 397 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 400 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 12 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42524 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 13:46:07] [INFO ] Flatten gal took : 36 ms
[2024-05-28 13:46:07] [INFO ] Flatten gal took : 38 ms
[2024-05-28 13:46:07] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 13:46:07] [INFO ] Flatten gal took : 78 ms
[2024-05-28 13:46:07] [INFO ] Flatten gal took : 80 ms
[2024-05-28 13:46:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality2407570523352149624.gal : 19 ms
[2024-05-28 13:46:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality62114813920303654.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/CTLCardinality2407570523352149624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality62114813920303654.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:46:37] [INFO ] Flatten gal took : 80 ms
[2024-05-28 13:46:37] [INFO ] Applying decomposition
[2024-05-28 13:46:38] [INFO ] Flatten gal took : 59 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/graph9766995025052450622.txt' '-o' '/tmp/graph9766995025052450622.bin' '-w' '/tmp/graph9766995025052450622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9766995025052450622.bin' '-l' '-1' '-v' '-w' '/tmp/graph9766995025052450622.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:46:38] [INFO ] Decomposing Gal with order
[2024-05-28 13:46:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:46:38] [INFO ] Removed a total of 1406 redundant transitions.
[2024-05-28 13:46:38] [INFO ] Flatten gal took : 198 ms
[2024-05-28 13:46:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 361 labels/synchronizations in 32 ms.
[2024-05-28 13:46:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality16547715284164859284.gal : 99 ms
[2024-05-28 13:46:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality9199455416535741096.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/CTLCardinality16547715284164859284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9199455416535741096.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 58 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:47:09] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:47:09] [INFO ] Invariant cache hit.
[2024-05-28 13:47:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:47:26] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:47:28] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:47:28] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:47:28] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:47:28] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:47:28] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-28 13:47:28] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:47:28] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:47:28] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:47:33] [INFO ] Deduced a trap composed of 203 places in 333 ms of which 4 ms to minimize.
[2024-05-28 13:47:33] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 0 ms to minimize.
[2024-05-28 13:47:34] [INFO ] Deduced a trap composed of 367 places in 358 ms of which 18 ms to minimize.
[2024-05-28 13:47:44] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 3 ms to minimize.
[2024-05-28 13:47:44] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:47:45] [INFO ] Deduced a trap composed of 491 places in 340 ms of which 5 ms to minimize.
[2024-05-28 13:47:45] [INFO ] Deduced a trap composed of 491 places in 311 ms of which 5 ms to minimize.
[2024-05-28 13:47:46] [INFO ] Deduced a trap composed of 491 places in 356 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 67 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints]
After SMT, in 41900ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41922ms
[2024-05-28 13:47:51] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:47:51] [INFO ] Invariant cache hit.
[2024-05-28 13:47:51] [INFO ] Implicit Places using invariants in 440 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 443 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 26 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42456 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 13:47:51] [INFO ] Flatten gal took : 91 ms
[2024-05-28 13:47:51] [INFO ] Flatten gal took : 81 ms
[2024-05-28 13:47:51] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 13:47:51] [INFO ] Flatten gal took : 58 ms
[2024-05-28 13:47:52] [INFO ] Flatten gal took : 70 ms
[2024-05-28 13:47:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4426499934132357065.gal : 7 ms
[2024-05-28 13:47:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality18126250483355594603.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/CTLCardinality4426499934132357065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18126250483355594603.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 13:48:22] [INFO ] Flatten gal took : 68 ms
[2024-05-28 13:48:22] [INFO ] Applying decomposition
[2024-05-28 13:48:22] [INFO ] Flatten gal took : 36 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/graph391875349396150542.txt' '-o' '/tmp/graph391875349396150542.bin' '-w' '/tmp/graph391875349396150542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph391875349396150542.bin' '-l' '-1' '-v' '-w' '/tmp/graph391875349396150542.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:48:22] [INFO ] Decomposing Gal with order
[2024-05-28 13:48:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:48:22] [INFO ] Removed a total of 1196 redundant transitions.
[2024-05-28 13:48:22] [INFO ] Flatten gal took : 100 ms
[2024-05-28 13:48:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 363 labels/synchronizations in 17 ms.
[2024-05-28 13:48:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality11973441452598932063.gal : 9 ms
[2024-05-28 13:48:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality17545826700544052010.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/CTLCardinality11973441452598932063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17545826700544052010.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 750 transition count 1332
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 670 transition count 1332
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 160 place count 670 transition count 1302
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 220 place count 640 transition count 1302
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 380 place count 560 transition count 1222
Applied a total of 380 rules in 122 ms. Remains 560 /752 variables (removed 192) and now considering 1222/1412 (removed 190) transitions.
Running 1220 sub problems to find dead transitions.
[2024-05-28 13:48:52] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 560 cols
[2024-05-28 13:48:52] [INFO ] Computed 52 invariants in 13 ms
[2024-05-28 13:48:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 4 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 1 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 259 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 272 places in 217 ms of which 2 ms to minimize.
[2024-05-28 13:49:05] [INFO ] Deduced a trap composed of 248 places in 288 ms of which 4 ms to minimize.
[2024-05-28 13:49:06] [INFO ] Deduced a trap composed of 276 places in 279 ms of which 4 ms to minimize.
[2024-05-28 13:49:06] [INFO ] Deduced a trap composed of 281 places in 260 ms of which 3 ms to minimize.
[2024-05-28 13:49:06] [INFO ] Deduced a trap composed of 296 places in 242 ms of which 3 ms to minimize.
[2024-05-28 13:49:06] [INFO ] Deduced a trap composed of 222 places in 227 ms of which 3 ms to minimize.
[2024-05-28 13:49:07] [INFO ] Deduced a trap composed of 265 places in 229 ms of which 3 ms to minimize.
[2024-05-28 13:49:07] [INFO ] Deduced a trap composed of 259 places in 231 ms of which 4 ms to minimize.
[2024-05-28 13:49:07] [INFO ] Deduced a trap composed of 251 places in 212 ms of which 3 ms to minimize.
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
[2024-05-28 13:49:08] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/1762 variables, and 71 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/560 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
[2024-05-28 13:49:23] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:49:24] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-28 13:49:34] [INFO ] Deduced a trap composed of 244 places in 353 ms of which 4 ms to minimize.
[2024-05-28 13:49:34] [INFO ] Deduced a trap composed of 245 places in 250 ms of which 3 ms to minimize.
[2024-05-28 13:49:34] [INFO ] Deduced a trap composed of 226 places in 236 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/1762 variables, and 76 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/560 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1220 constraints, Known Traps: 26/26 constraints]
After SMT, in 41886ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 41906ms
[2024-05-28 13:49:34] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2024-05-28 13:49:34] [INFO ] Invariant cache hit.
[2024-05-28 13:49:35] [INFO ] Implicit Places using invariants in 359 ms returned [454, 455, 456, 457, 458, 459, 460, 461, 462, 463]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 374 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 550/752 places, 1222/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 540 transition count 1212
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 540 transition count 1212
Applied a total of 20 rules in 43 ms. Remains 540 /550 variables (removed 10) and now considering 1212/1222 (removed 10) transitions.
[2024-05-28 13:49:35] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
// Phase 1: matrix 1192 rows 540 cols
[2024-05-28 13:49:35] [INFO ] Computed 42 invariants in 28 ms
[2024-05-28 13:49:35] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-28 13:49:35] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
[2024-05-28 13:49:35] [INFO ] Invariant cache hit.
[2024-05-28 13:49:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:49:42] [INFO ] Implicit Places using invariants and state equation in 7263 ms returned []
Implicit Place search using SMT with State Equation took 7735 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 540/752 places, 1212/1412 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 50187 ms. Remains : 540/752 places, 1212/1412 transitions.
[2024-05-28 13:49:42] [INFO ] Flatten gal took : 62 ms
[2024-05-28 13:49:42] [INFO ] Flatten gal took : 51 ms
[2024-05-28 13:49:43] [INFO ] Input system was already deterministic with 1212 transitions.
RANDOM walk for 119 steps (0 resets) in 4 ms. (23 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 13:49:43] [INFO ] Flatten gal took : 87 ms
[2024-05-28 13:49:43] [INFO ] Flatten gal took : 68 ms
[2024-05-28 13:49:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18324508545379798611.gal : 9 ms
[2024-05-28 13:49:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16109791509231882562.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18324508545379798611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16109791509231882562.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 37 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:49:43] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 13:49:43] [INFO ] Computed 52 invariants in 24 ms
[2024-05-28 13:49:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 5 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:49:58] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:49:59] [INFO ] Deduced a trap composed of 404 places in 345 ms of which 5 ms to minimize.
[2024-05-28 13:50:00] [INFO ] Deduced a trap composed of 209 places in 320 ms of which 5 ms to minimize.
[2024-05-28 13:50:01] [INFO ] Deduced a trap composed of 75 places in 205 ms of which 2 ms to minimize.
[2024-05-28 13:50:02] [INFO ] Deduced a trap composed of 440 places in 380 ms of which 5 ms to minimize.
[2024-05-28 13:50:02] [INFO ] Deduced a trap composed of 432 places in 394 ms of which 15 ms to minimize.
[2024-05-28 13:50:02] [INFO ] Deduced a trap composed of 393 places in 385 ms of which 5 ms to minimize.
[2024-05-28 13:50:03] [INFO ] Deduced a trap composed of 411 places in 356 ms of which 5 ms to minimize.
[2024-05-28 13:50:03] [INFO ] Deduced a trap composed of 392 places in 290 ms of which 4 ms to minimize.
[2024-05-28 13:50:03] [INFO ] Deduced a trap composed of 370 places in 280 ms of which 4 ms to minimize.
[2024-05-28 13:50:04] [INFO ] Deduced a trap composed of 404 places in 333 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 69 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:50:07] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:50:08] [INFO ] Deduced a trap composed of 324 places in 410 ms of which 6 ms to minimize.
[2024-05-28 13:50:09] [INFO ] Deduced a trap composed of 49 places in 261 ms of which 4 ms to minimize.
[2024-05-28 13:50:09] [INFO ] Deduced a trap composed of 383 places in 262 ms of which 4 ms to minimize.
[2024-05-28 13:50:10] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 2 ms to minimize.
[2024-05-28 13:50:17] [INFO ] Deduced a trap composed of 507 places in 386 ms of which 5 ms to minimize.
[2024-05-28 13:50:17] [INFO ] Deduced a trap composed of 491 places in 353 ms of which 5 ms to minimize.
[2024-05-28 13:50:17] [INFO ] Deduced a trap composed of 491 places in 330 ms of which 6 ms to minimize.
[2024-05-28 13:50:18] [INFO ] Deduced a trap composed of 514 places in 387 ms of which 5 ms to minimize.
[2024-05-28 13:50:18] [INFO ] Deduced a trap composed of 491 places in 315 ms of which 4 ms to minimize.
[2024-05-28 13:50:18] [INFO ] Deduced a trap composed of 502 places in 327 ms of which 4 ms to minimize.
[2024-05-28 13:50:21] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:50:25] [INFO ] Deduced a trap composed of 383 places in 334 ms of which 4 ms to minimize.
SMT process timed out in 42089ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42106ms
[2024-05-28 13:50:25] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:50:25] [INFO ] Invariant cache hit.
[2024-05-28 13:50:25] [INFO ] Implicit Places using invariants in 396 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 400 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 7 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42554 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 13:50:25] [INFO ] Flatten gal took : 34 ms
[2024-05-28 13:50:25] [INFO ] Flatten gal took : 37 ms
[2024-05-28 13:50:26] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 13:50:26] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:50:26] [INFO ] Flatten gal took : 37 ms
[2024-05-28 13:50:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality16344671649759172217.gal : 5 ms
[2024-05-28 13:50:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality6259374392812299972.ctl : 7 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/CTLCardinality16344671649759172217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6259374392812299972.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 13:50:56] [INFO ] Flatten gal took : 78 ms
[2024-05-28 13:50:56] [INFO ] Applying decomposition
[2024-05-28 13:50:56] [INFO ] Flatten gal took : 56 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/graph14166378756210149166.txt' '-o' '/tmp/graph14166378756210149166.bin' '-w' '/tmp/graph14166378756210149166.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14166378756210149166.bin' '-l' '-1' '-v' '-w' '/tmp/graph14166378756210149166.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:50:56] [INFO ] Decomposing Gal with order
[2024-05-28 13:50:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:50:56] [INFO ] Removed a total of 1541 redundant transitions.
[2024-05-28 13:50:56] [INFO ] Flatten gal took : 156 ms
[2024-05-28 13:50:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 27 ms.
[2024-05-28 13:50:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality1738210778076597089.gal : 12 ms
[2024-05-28 13:50:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality4782375828346988251.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/CTLCardinality1738210778076597089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4782375828346988251.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 24 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:51:27] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:51:27] [INFO ] Invariant cache hit.
[2024-05-28 13:51:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:51:43] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:51:44] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:51:44] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:51:44] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:51:44] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:51:45] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:51:45] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:51:45] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:51:45] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:51:48] [INFO ] Deduced a trap composed of 63 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 175 places in 355 ms of which 5 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 200 places in 245 ms of which 3 ms to minimize.
[2024-05-28 13:51:51] [INFO ] Deduced a trap composed of 358 places in 375 ms of which 5 ms to minimize.
[2024-05-28 13:51:52] [INFO ] Deduced a trap composed of 421 places in 353 ms of which 4 ms to minimize.
[2024-05-28 13:52:00] [INFO ] Deduced a trap composed of 493 places in 367 ms of which 5 ms to minimize.
[2024-05-28 13:52:00] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 66 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 16/16 constraints]
After SMT, in 41964ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41975ms
[2024-05-28 13:52:09] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:52:09] [INFO ] Invariant cache hit.
[2024-05-28 13:52:09] [INFO ] Implicit Places using invariants in 382 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 386 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 8 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42396 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 13:52:09] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:52:09] [INFO ] Flatten gal took : 36 ms
[2024-05-28 13:52:09] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 13:52:09] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:52:09] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:52:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality9371708499449741299.gal : 5 ms
[2024-05-28 13:52:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality7160750134712405536.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/CTLCardinality9371708499449741299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7160750134712405536.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 13:52:39] [INFO ] Flatten gal took : 73 ms
[2024-05-28 13:52:39] [INFO ] Applying decomposition
[2024-05-28 13:52:39] [INFO ] Flatten gal took : 58 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/graph1100089595805676059.txt' '-o' '/tmp/graph1100089595805676059.bin' '-w' '/tmp/graph1100089595805676059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1100089595805676059.bin' '-l' '-1' '-v' '-w' '/tmp/graph1100089595805676059.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:52:40] [INFO ] Decomposing Gal with order
[2024-05-28 13:52:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:52:40] [INFO ] Removed a total of 1156 redundant transitions.
[2024-05-28 13:52:40] [INFO ] Flatten gal took : 109 ms
[2024-05-28 13:52:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 354 labels/synchronizations in 39 ms.
[2024-05-28 13:52:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality3560376269000363246.gal : 19 ms
[2024-05-28 13:52:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality11825896626377972513.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/CTLCardinality3560376269000363246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11825896626377972513.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 25 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:53:10] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:53:10] [INFO ] Invariant cache hit.
[2024-05-28 13:53:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:53:26] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 2 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:53:29] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:53:29] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
[2024-05-28 13:53:29] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-28 13:53:29] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:53:29] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 timeout
0.0)
(s8 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:53:34] [INFO ] Deduced a trap composed of 203 places in 351 ms of which 5 ms to minimize.
[2024-05-28 13:53:34] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:53:35] [INFO ] Deduced a trap composed of 367 places in 368 ms of which 5 ms to minimize.
[2024-05-28 13:53:43] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:53:43] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 4 ms to minimize.
[2024-05-28 13:53:44] [INFO ] Deduced a trap composed of 491 places in 229 ms of which 4 ms to minimize.
[2024-05-28 13:53:44] [INFO ] Deduced a trap composed of 491 places in 348 ms of which 5 ms to minimize.
[2024-05-28 13:53:44] [INFO ] Deduced a trap composed of 491 places in 331 ms of which 5 ms to minimize.
[2024-05-28 13:53:51] [INFO ] Deduced a trap composed of 384 places in 363 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 18/18 constraints]
After SMT, in 41733ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41745ms
[2024-05-28 13:53:52] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:53:52] [INFO ] Invariant cache hit.
[2024-05-28 13:53:52] [INFO ] Implicit Places using invariants in 586 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 589 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 12 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42374 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 13:53:52] [INFO ] Flatten gal took : 46 ms
[2024-05-28 13:53:52] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:53:52] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 13:53:52] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:53:53] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:53:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality6357783837266375339.gal : 7 ms
[2024-05-28 13:53:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality4718248058126036929.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/CTLCardinality6357783837266375339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4718248058126036929.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 13:54:23] [INFO ] Flatten gal took : 79 ms
[2024-05-28 13:54:23] [INFO ] Applying decomposition
[2024-05-28 13:54:23] [INFO ] Flatten gal took : 58 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/graph15626685428917702632.txt' '-o' '/tmp/graph15626685428917702632.bin' '-w' '/tmp/graph15626685428917702632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15626685428917702632.bin' '-l' '-1' '-v' '-w' '/tmp/graph15626685428917702632.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:54:23] [INFO ] Decomposing Gal with order
[2024-05-28 13:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:54:23] [INFO ] Removed a total of 1153 redundant transitions.
[2024-05-28 13:54:23] [INFO ] Flatten gal took : 97 ms
[2024-05-28 13:54:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 12 ms.
[2024-05-28 13:54:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality6180172123938472428.gal : 12 ms
[2024-05-28 13:54:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality9403241947647830374.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/CTLCardinality6180172123938472428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9403241947647830374.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 47 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 13:54:53] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:54:53] [INFO ] Invariant cache hit.
[2024-05-28 13:54:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:55:11] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:55:13] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:55:13] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:55:13] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:55:13] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:55:13] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 2 ms to minimize.
[2024-05-28 13:55:13] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:55:13] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:55:14] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 13:55:17] [INFO ] Deduced a trap composed of 203 places in 350 ms of which 5 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:55:18] [INFO ] Deduced a trap composed of 367 places in 369 ms of which 5 ms to minimize.
[2024-05-28 13:55:25] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 3 ms to minimize.
[2024-05-28 13:55:25] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 3 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 491 places in 235 ms of which 4 ms to minimize.
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 491 places in 398 ms of which 6 ms to minimize.
[2024-05-28 13:55:27] [INFO ] Deduced a trap composed of 491 places in 385 ms of which 17 ms to minimize.
[2024-05-28 13:55:34] [INFO ] Deduced a trap composed of 384 places in 381 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 18/18 constraints]
After SMT, in 41999ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42018ms
[2024-05-28 13:55:35] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 13:55:35] [INFO ] Invariant cache hit.
[2024-05-28 13:55:36] [INFO ] Implicit Places using invariants in 621 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 623 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 9 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42702 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 13:55:36] [INFO ] Flatten gal took : 48 ms
[2024-05-28 13:55:36] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:55:36] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 13:55:36] [INFO ] Flatten gal took : 44 ms
[2024-05-28 13:55:36] [INFO ] Flatten gal took : 39 ms
[2024-05-28 13:55:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality9997381927145105246.gal : 6 ms
[2024-05-28 13:55:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality2687159214242256894.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/CTLCardinality9997381927145105246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2687159214242256894.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 13:56:06] [INFO ] Flatten gal took : 71 ms
[2024-05-28 13:56:06] [INFO ] Applying decomposition
[2024-05-28 13:56:06] [INFO ] Flatten gal took : 54 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/graph8335500010571606899.txt' '-o' '/tmp/graph8335500010571606899.bin' '-w' '/tmp/graph8335500010571606899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8335500010571606899.bin' '-l' '-1' '-v' '-w' '/tmp/graph8335500010571606899.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:56:07] [INFO ] Decomposing Gal with order
[2024-05-28 13:56:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:56:07] [INFO ] Removed a total of 916 redundant transitions.
[2024-05-28 13:56:07] [INFO ] Flatten gal took : 110 ms
[2024-05-28 13:56:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 303 labels/synchronizations in 19 ms.
[2024-05-28 13:56:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality1811708909664379463.gal : 12 ms
[2024-05-28 13:56:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality203116524676174778.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/CTLCardinality1811708909664379463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality203116524676174778.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 750 transition count 1332
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 160 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 320 place count 590 transition count 1252
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 460 place count 520 transition count 1182
Applied a total of 460 rules in 65 ms. Remains 520 /752 variables (removed 232) and now considering 1182/1412 (removed 230) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-28 13:56:37] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 520 cols
[2024-05-28 13:56:37] [INFO ] Computed 52 invariants in 17 ms
[2024-05-28 13:56:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 3 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 3 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:56:47] [INFO ] Deduced a trap composed of 214 places in 191 ms of which 3 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 235 places in 265 ms of which 4 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 2 ms to minimize.
[2024-05-28 13:56:48] [INFO ] Deduced a trap composed of 216 places in 283 ms of which 4 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 213 places in 281 ms of which 4 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 181 places in 246 ms of which 3 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 210 places in 274 ms of which 4 ms to minimize.
[2024-05-28 13:56:49] [INFO ] Deduced a trap composed of 219 places in 259 ms of which 3 ms to minimize.
[2024-05-28 13:56:50] [INFO ] Deduced a trap composed of 208 places in 254 ms of which 3 ms to minimize.
[2024-05-28 13:56:50] [INFO ] Deduced a trap composed of 214 places in 242 ms of which 2 ms to minimize.
[2024-05-28 13:56:50] [INFO ] Deduced a trap composed of 208 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:56:51] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:56:52] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1682 variables, and 72 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:57:04] [INFO ] Deduced a trap composed of 315 places in 269 ms of which 4 ms to minimize.
[2024-05-28 13:57:05] [INFO ] Deduced a trap composed of 326 places in 241 ms of which 3 ms to minimize.
[2024-05-28 13:57:09] [INFO ] Deduced a trap composed of 229 places in 282 ms of which 4 ms to minimize.
[2024-05-28 13:57:09] [INFO ] Deduced a trap composed of 237 places in 244 ms of which 3 ms to minimize.
[2024-05-28 13:57:09] [INFO ] Deduced a trap composed of 222 places in 264 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-28 13:57:17] [INFO ] Deduced a trap composed of 186 places in 253 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1682 variables, and 78 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 28/28 constraints]
After SMT, in 41611ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 41626ms
[2024-05-28 13:57:19] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
[2024-05-28 13:57:19] [INFO ] Invariant cache hit.
[2024-05-28 13:57:19] [INFO ] Implicit Places using invariants in 432 ms returned [454, 455, 456, 457, 458, 459, 460, 461, 462, 463]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 434 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 510/752 places, 1182/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 500 transition count 1172
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 500 transition count 1172
Applied a total of 20 rules in 26 ms. Remains 500 /510 variables (removed 10) and now considering 1172/1182 (removed 10) transitions.
[2024-05-28 13:57:19] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
// Phase 1: matrix 1152 rows 500 cols
[2024-05-28 13:57:19] [INFO ] Computed 42 invariants in 23 ms
[2024-05-28 13:57:19] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-28 13:57:19] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-05-28 13:57:19] [INFO ] Invariant cache hit.
[2024-05-28 13:57:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:57:25] [INFO ] Implicit Places using invariants and state equation in 5667 ms returned []
Implicit Place search using SMT with State Equation took 6084 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 500/752 places, 1172/1412 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 48238 ms. Remains : 500/752 places, 1172/1412 transitions.
[2024-05-28 13:57:25] [INFO ] Flatten gal took : 67 ms
[2024-05-28 13:57:25] [INFO ] Flatten gal took : 56 ms
[2024-05-28 13:57:25] [INFO ] Input system was already deterministic with 1172 transitions.
[2024-05-28 13:57:25] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:57:25] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:57:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality2126018491071453415.gal : 9 ms
[2024-05-28 13:57:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality11701003039428892916.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/CTLCardinality2126018491071453415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11701003039428892916.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 13:57:56] [INFO ] Flatten gal took : 80 ms
[2024-05-28 13:57:56] [INFO ] Applying decomposition
[2024-05-28 13:57:56] [INFO ] Flatten gal took : 58 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/graph17991450609206855540.txt' '-o' '/tmp/graph17991450609206855540.bin' '-w' '/tmp/graph17991450609206855540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17991450609206855540.bin' '-l' '-1' '-v' '-w' '/tmp/graph17991450609206855540.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:57:56] [INFO ] Decomposing Gal with order
[2024-05-28 13:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:57:56] [INFO ] Removed a total of 1026 redundant transitions.
[2024-05-28 13:57:56] [INFO ] Flatten gal took : 125 ms
[2024-05-28 13:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1030 labels/synchronizations in 34 ms.
[2024-05-28 13:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality1377929427816211996.gal : 8 ms
[2024-05-28 13:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality15262944078485808465.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/CTLCardinality1377929427816211996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15262944078485808465.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Applied a total of 2 rules in 8 ms. Remains 750 /752 variables (removed 2) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-28 13:58:26] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 750 cols
[2024-05-28 13:58:26] [INFO ] Computed 52 invariants in 34 ms
[2024-05-28 13:58:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:58:41] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:58:41] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-28 13:58:41] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2024-05-28 13:58:42] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:58:42] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:58:42] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:58:42] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:58:42] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 0 ms to minimize.
[2024-05-28 13:58:42] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:58:43] [INFO ] Deduced a trap composed of 414 places in 337 ms of which 5 ms to minimize.
[2024-05-28 13:58:43] [INFO ] Deduced a trap composed of 389 places in 353 ms of which 5 ms to minimize.
[2024-05-28 13:58:43] [INFO ] Deduced a trap composed of 406 places in 332 ms of which 4 ms to minimize.
[2024-05-28 13:58:44] [INFO ] Deduced a trap composed of 243 places in 295 ms of which 3 ms to minimize.
[2024-05-28 13:58:44] [INFO ] Deduced a trap composed of 376 places in 245 ms of which 3 ms to minimize.
[2024-05-28 13:58:44] [INFO ] Deduced a trap composed of 247 places in 222 ms of which 4 ms to minimize.
[2024-05-28 13:58:45] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-05-28 13:58:46] [INFO ] Deduced a trap composed of 413 places in 384 ms of which 5 ms to minimize.
[2024-05-28 13:58:46] [INFO ] Deduced a trap composed of 400 places in 387 ms of which 5 ms to minimize.
[2024-05-28 13:58:47] [INFO ] Deduced a trap composed of 393 places in 354 ms of which 6 ms to minimize.
[2024-05-28 13:58:47] [INFO ] Deduced a trap composed of 475 places in 364 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:58:49] [INFO ] Deduced a trap composed of 388 places in 285 ms of which 4 ms to minimize.
SMT process timed out in 22446ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 22459ms
[2024-05-28 13:58:49] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:58:49] [INFO ] Invariant cache hit.
[2024-05-28 13:58:49] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-28 13:58:49] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:58:49] [INFO ] Invariant cache hit.
[2024-05-28 13:58:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 13:58:57] [INFO ] Implicit Places using invariants and state equation in 8138 ms returned []
Implicit Place search using SMT with State Equation took 8535 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2024-05-28 13:58:57] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 13:58:57] [INFO ] Invariant cache hit.
[2024-05-28 13:58:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:59:11] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 3 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:59:12] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:59:13] [INFO ] Deduced a trap composed of 400 places in 312 ms of which 5 ms to minimize.
[2024-05-28 13:59:13] [INFO ] Deduced a trap composed of 392 places in 293 ms of which 4 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 238 places in 223 ms of which 4 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 247 places in 236 ms of which 4 ms to minimize.
[2024-05-28 13:59:15] [INFO ] Deduced a trap composed of 400 places in 287 ms of which 4 ms to minimize.
[2024-05-28 13:59:15] [INFO ] Deduced a trap composed of 416 places in 261 ms of which 3 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 420 places in 270 ms of which 4 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 412 places in 269 ms of which 3 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 384 places in 341 ms of which 4 ms to minimize.
[2024-05-28 13:59:17] [INFO ] Deduced a trap composed of 417 places in 327 ms of which 4 ms to minimize.
[2024-05-28 13:59:17] [INFO ] Deduced a trap composed of 410 places in 312 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:59:18] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:59:20] [INFO ] Deduced a trap composed of 394 places in 370 ms of which 5 ms to minimize.
[2024-05-28 13:59:20] [INFO ] Deduced a trap composed of 441 places in 337 ms of which 4 ms to minimize.
[2024-05-28 13:59:21] [INFO ] Deduced a trap composed of 387 places in 269 ms of which 4 ms to minimize.
[2024-05-28 13:59:21] [INFO ] Deduced a trap composed of 393 places in 272 ms of which 4 ms to minimize.
[2024-05-28 13:59:21] [INFO ] Deduced a trap composed of 371 places in 386 ms of which 5 ms to minimize.
[2024-05-28 13:59:22] [INFO ] Deduced a trap composed of 393 places in 357 ms of which 5 ms to minimize.
[2024-05-28 13:59:22] [INFO ] Deduced a trap composed of 393 places in 329 ms of which 4 ms to minimize.
[2024-05-28 13:59:22] [INFO ] Deduced a trap composed of 387 places in 378 ms of which 5 ms to minimize.
[2024-05-28 13:59:23] [INFO ] Deduced a trap composed of 384 places in 314 ms of which 4 ms to minimize.
[2024-05-28 13:59:23] [INFO ] Deduced a trap composed of 380 places in 381 ms of which 4 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 401 places in 377 ms of which 5 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 409 places in 299 ms of which 4 ms to minimize.
[2024-05-28 13:59:24] [INFO ] Deduced a trap composed of 388 places in 274 ms of which 3 ms to minimize.
[2024-05-28 13:59:25] [INFO ] Deduced a trap composed of 490 places in 256 ms of which 4 ms to minimize.
[2024-05-28 13:59:25] [INFO ] Deduced a trap composed of 383 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2142 variables, and 86 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/750 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 36/86 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 13:59:31] [INFO ] Deduced a trap composed of 379 places in 376 ms of which 6 ms to minimize.
[2024-05-28 13:59:34] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 3 ms to minimize.
[2024-05-28 13:59:43] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-28 13:59:48] [INFO ] Deduced a trap composed of 500 places in 398 ms of which 5 ms to minimize.
[2024-05-28 13:59:48] [INFO ] Deduced a trap composed of 82 places in 367 ms of which 5 ms to minimize.
[2024-05-28 13:59:49] [INFO ] Deduced a trap composed of 399 places in 414 ms of which 5 ms to minimize.
[2024-05-28 13:59:49] [INFO ] Deduced a trap composed of 417 places in 360 ms of which 6 ms to minimize.
[2024-05-28 13:59:50] [INFO ] Deduced a trap composed of 421 places in 298 ms of which 5 ms to minimize.
[2024-05-28 13:59:50] [INFO ] Deduced a trap composed of 510 places in 279 ms of which 5 ms to minimize.
[2024-05-28 13:59:50] [INFO ] Deduced a trap composed of 414 places in 279 ms of which 4 ms to minimize.
[2024-05-28 13:59:50] [INFO ] Deduced a trap composed of 399 places in 279 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/748 variables, 11/97 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2142 variables, and 97 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/750 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 47/47 constraints]
After SMT, in 61702ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 61714ms
Starting structural reductions in LTL mode, iteration 1 : 750/752 places, 1412/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92722 ms. Remains : 750/752 places, 1412/1412 transitions.
[2024-05-28 13:59:59] [INFO ] Flatten gal took : 34 ms
[2024-05-28 13:59:59] [INFO ] Flatten gal took : 36 ms
[2024-05-28 13:59:59] [INFO ] Input system was already deterministic with 1412 transitions.
[2024-05-28 13:59:59] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:59:59] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:59:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3988142229887243445.gal : 7 ms
[2024-05-28 13:59:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality9457443511725529927.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/CTLCardinality3988142229887243445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9457443511725529927.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 14:00:29] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:00:29] [INFO ] Applying decomposition
[2024-05-28 14:00:29] [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/graph5142952169033439030.txt' '-o' '/tmp/graph5142952169033439030.bin' '-w' '/tmp/graph5142952169033439030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5142952169033439030.bin' '-l' '-1' '-v' '-w' '/tmp/graph5142952169033439030.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:00:29] [INFO ] Decomposing Gal with order
[2024-05-28 14:00:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:00:29] [INFO ] Removed a total of 1477 redundant transitions.
[2024-05-28 14:00:30] [INFO ] Flatten gal took : 82 ms
[2024-05-28 14:00:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 13 ms.
[2024-05-28 14:00:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality13582902893553167663.gal : 8 ms
[2024-05-28 14:00:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11422951806017303482.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/CTLCardinality13582902893553167663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11422951806017303482.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.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 48 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 14:01:00] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 14:01:00] [INFO ] Computed 52 invariants in 14 ms
[2024-05-28 14:01:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:01:14] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-28 14:01:14] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-28 14:01:14] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:01:14] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:01:14] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:01:14] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:01:14] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:01:14] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:01:14] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:01:15] [INFO ] Deduced a trap composed of 404 places in 283 ms of which 4 ms to minimize.
[2024-05-28 14:01:15] [INFO ] Deduced a trap composed of 209 places in 376 ms of which 5 ms to minimize.
[2024-05-28 14:01:16] [INFO ] Deduced a trap composed of 75 places in 172 ms of which 2 ms to minimize.
[2024-05-28 14:01:17] [INFO ] Deduced a trap composed of 440 places in 287 ms of which 4 ms to minimize.
[2024-05-28 14:01:17] [INFO ] Deduced a trap composed of 432 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:01:17] [INFO ] Deduced a trap composed of 393 places in 290 ms of which 4 ms to minimize.
[2024-05-28 14:01:18] [INFO ] Deduced a trap composed of 411 places in 287 ms of which 4 ms to minimize.
[2024-05-28 14:01:18] [INFO ] Deduced a trap composed of 392 places in 352 ms of which 4 ms to minimize.
[2024-05-28 14:01:18] [INFO ] Deduced a trap composed of 370 places in 347 ms of which 4 ms to minimize.
[2024-05-28 14:01:19] [INFO ] Deduced a trap composed of 404 places in 314 ms of which 4 ms to minimize.
[2024-05-28 14:01:20] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:01:22] [INFO ] Deduced a trap composed of 356 places in 379 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 71 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 14:01:25] [INFO ] Deduced a trap composed of 45 places in 424 ms of which 5 ms to minimize.
[2024-05-28 14:01:25] [INFO ] Deduced a trap composed of 394 places in 375 ms of which 5 ms to minimize.
[2024-05-28 14:01:26] [INFO ] Deduced a trap composed of 420 places in 312 ms of which 4 ms to minimize.
[2024-05-28 14:01:26] [INFO ] Deduced a trap composed of 383 places in 274 ms of which 4 ms to minimize.
[2024-05-28 14:01:35] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:01:35] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:01:36] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2024-05-28 14:01:36] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 4 ms to minimize.
[2024-05-28 14:01:41] [INFO ] Deduced a trap composed of 78 places in 371 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 80 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 30/30 constraints]
After SMT, in 41986ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42006ms
[2024-05-28 14:01:42] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 14:01:42] [INFO ] Invariant cache hit.
[2024-05-28 14:01:42] [INFO ] Implicit Places using invariants in 615 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 618 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 10 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42688 ms. Remains : 720/752 places, 1392/1412 transitions.
[2024-05-28 14:01:42] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:01:43] [INFO ] Flatten gal took : 57 ms
[2024-05-28 14:01:43] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 14:01:43] [INFO ] Flatten gal took : 45 ms
[2024-05-28 14:01:43] [INFO ] Flatten gal took : 44 ms
[2024-05-28 14:01:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality14176655040337286524.gal : 6 ms
[2024-05-28 14:01:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality18421118157579291130.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/CTLCardinality14176655040337286524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18421118157579291130.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 14:02:13] [INFO ] Flatten gal took : 92 ms
[2024-05-28 14:02:13] [INFO ] Applying decomposition
[2024-05-28 14:02:13] [INFO ] Flatten gal took : 66 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/graph18209151360260815116.txt' '-o' '/tmp/graph18209151360260815116.bin' '-w' '/tmp/graph18209151360260815116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18209151360260815116.bin' '-l' '-1' '-v' '-w' '/tmp/graph18209151360260815116.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:02:13] [INFO ] Decomposing Gal with order
[2024-05-28 14:02:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:02:13] [INFO ] Removed a total of 1593 redundant transitions.
[2024-05-28 14:02:13] [INFO ] Flatten gal took : 112 ms
[2024-05-28 14:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 12 ms.
[2024-05-28 14:02:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality14570520715955757614.gal : 8 ms
[2024-05-28 14:02:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality144096656880675709.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/CTLCardinality14570520715955757614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality144096656880675709.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 14:02:44] [INFO ] Flatten gal took : 76 ms
[2024-05-28 14:02:44] [INFO ] Flatten gal took : 55 ms
[2024-05-28 14:02:44] [INFO ] Applying decomposition
[2024-05-28 14:02:44] [INFO ] Flatten gal took : 51 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/graph18067166680178083116.txt' '-o' '/tmp/graph18067166680178083116.bin' '-w' '/tmp/graph18067166680178083116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18067166680178083116.bin' '-l' '-1' '-v' '-w' '/tmp/graph18067166680178083116.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:02:44] [INFO ] Decomposing Gal with order
[2024-05-28 14:02:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:02:44] [INFO ] Removed a total of 1211 redundant transitions.
[2024-05-28 14:02:44] [INFO ] Flatten gal took : 148 ms
[2024-05-28 14:02:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 870 labels/synchronizations in 54 ms.
[2024-05-28 14:02:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4566405975999134263.gal : 17 ms
[2024-05-28 14:02:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality741383278288460945.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/CTLCardinality4566405975999134263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality741383278288460945.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:10:56] [INFO ] Applying decomposition
[2024-05-28 14:10:56] [INFO ] Flatten gal took : 50 ms
[2024-05-28 14:10:56] [INFO ] Decomposing Gal with order
[2024-05-28 14:10:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:10:56] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, Idle_6, NotifyEventJobCompletedE_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, Try_Check_Sources_E_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, Idle_7, NotifyEventJobCompletedE_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, Try_Check_Sources_E_7, P_1617_7, ScheduleTaskE_Idle_7],[AwakeTasks_8, IdleTasks_8, NotifyEventJobQueuedE_8, QueueJobE_8, P_2321_8, TryAllocateOneTaskE_8, TryAllocateOneTaskB_8, P_2318_8, EnablePollingE_8, EnablePollingB_8, FetchJobB_8, ScheduleTaskE_Check_8, ScheduleTaskB_8, Abort_Check_Sources_E_8, Abort_Check_Sources_B_8, NotifyEventSourceAddedB_8, Insert_Source_E_8, NotifyEventSourceAddedE_8, P_1113_8, ProcessingEvt_8, P_1155_8, nyo_8, P_1158_8, P_1159_8, P_1160_8, NotifyEventEndOfCheckSourcesB_8, NotifyEventEndOfCheckSourcesE_8, Check_Sources_B_8, Check_Sources_E_8, Idle_8, NotifyEventJobCompletedE_8, NotifyEventJobCompletedB_8, RunE_8, RunB_8, Perform_Work_E_8, Try_Check_Sources_B_8, Try_Check_Sources_E_8, P_1617_8, ScheduleTaskE_Idle_8],[AwakeTasks_9, IdleTasks_9, NotifyEventJobQueuedE_9, QueueJobE_9, P_2321_9, TryAllocateOneTaskE_9, TryAllocateOneTaskB_9, P_2318_9, EnablePollingE_9, EnablePollingB_9, FetchJobB_9, ScheduleTaskE_Check_9, ScheduleTaskB_9, Abort_Check_Sources_E_9, Abort_Check_Sources_B_9, NotifyEventSourceAddedB_9, Insert_Source_E_9, NotifyEventSourceAddedE_9, P_1113_9, ProcessingEvt_9, P_1155_9, nyo_9, P_1158_9, P_1159_9, P_1160_9, NotifyEventEndOfCheckSourcesB_9, NotifyEventEndOfCheckSourcesE_9, Check_Sources_B_9, Check_Sources_E_9, Idle_9, NotifyEventJobCompletedE_9, NotifyEventJobCompletedB_9, RunE_9, RunB_9, Perform_Work_E_9, Try_Check_Sources_B_9, Try_Check_Sources_E_9, P_1617_9, ScheduleTaskE_Idle_9],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],[DisablePollingE_16, DisablePollingB_16, Insert_Source_B_16, P_1119_16, P_2579_16],[DisablePollingE_17, DisablePollingB_17, Insert_Source_B_17, P_1119_17, P_2579_17],[DisablePollingE_18, DisablePollingB_18, Insert_Source_B_18, P_1119_18, P_2579_18],[DisablePollingE_19, DisablePollingB_19, Insert_Source_B_19, P_1119_19, P_2579_19],

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 14:10:56] [INFO ] Flatten gal took : 46 ms
[2024-05-28 14:10:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality11023480388275079177.gal : 8 ms
[2024-05-28 14:10:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality16362271623854090268.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/CTLCardinality11023480388275079177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16362271623854090268.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 10 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:19:18] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:19:18] [INFO ] Input system was already deterministic with 1412 transitions.
[2024-05-28 14:19:18] [INFO ] Transformed 752 places.
[2024-05-28 14:19:18] [INFO ] Transformed 1412 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 14:19:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality10674338627405893787.gal : 6 ms
[2024-05-28 14:19:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality12902774303630022582.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/CTLCardinality10674338627405893787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12902774303630022582.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3022973 ms.

BK_STOP 1716906514060

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T10"
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 PolyORBLF-COL-S02J04T10, 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-171654446300089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T10.tgz
mv PolyORBLF-COL-S02J04T10 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 ;