MCC'2024- Execution of r290-tajo-171654446400106

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

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16205.207	2967531.00	3280986.00	1529.60	?????????T????T?	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-171654446400106.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-S02J06T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 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.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-S02J06T08-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716906412327

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202405141337
[2024-05-28 14:26:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 14:26:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:26:53] [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 14:26:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:26:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 687 ms
[2024-05-28 14:26:54] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
[2024-05-28 14:26:54] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 14:26:54] [INFO ] Skeletonized 14 HLPN properties in 3 ms. Removed 2 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 58 to 55
RANDOM walk for 40000 steps (18 resets) in 1669 ms. (23 steps per ms) remains 13/55 properties
BEST_FIRST walk for 40004 steps (24 resets) in 454 ms. (87 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (15 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (11 resets) in 212 ms. (187 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (15 resets) in 267 ms. (149 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (12 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 335 ms. (119 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (62 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (13 resets) in 279 ms. (142 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (12 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (16 resets) in 176 ms. (225 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (22 resets) in 234 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (12 resets) in 281 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (19 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
[2024-05-28 14:26:56] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:26:56] [INFO ] Computed 26 invariants in 6 ms
[2024-05-28 14:26:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 2 (OVERLAPS) 24/59 variables, 7/9 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/63 variables, 3/14 constraints. Problems are: Problem set: 4 solved, 9 unsolved
[2024-05-28 14:26:56] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 1/15 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 8 (OVERLAPS) 16/79 variables, 10/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-05-28 14:26:56] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:26:56] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 2/27 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/80 variables, 1/28 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/28 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/81 variables, 1/29 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/81 variables, 0/29 constraints. Problems are: Problem set: 9 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 64/145 variables, 81/110 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 8/118 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 118 constraints, problems are : Problem set: 9 solved, 4 unsolved in 552 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: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 1/27 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/79 variables, 1/28 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 64/143 variables, 79/107 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 8/115 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 4/119 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/143 variables, 0/119 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/145 variables, 2/121 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 1/122 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/145 variables, 0/122 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/145 variables, 0/122 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 122 constraints, problems are : Problem set: 9 solved, 4 unsolved in 312 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: 4/13 constraints, Known Traps: 3/3 constraints]
After SMT, in 909ms problems are : Problem set: 9 solved, 4 unsolved
Parikh walk visited 0 properties in 1949 ms.
Support contains 5 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 51 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-05-28 14:26:59] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-05-28 14:26:59] [INFO ] Computed 25 invariants in 5 ms
[2024-05-28 14:26:59] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 14:26:59] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:26:59] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-28 14:26:59] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 14:26:59] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 14:26:59] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 14:26:59] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:26:59] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 14:26:59] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/93 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/101 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:27:00] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-28 14:27:00] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 2/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 103 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/29 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:27:00] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:27:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:27:01] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:27:01] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:27:01] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 5/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 5/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 150 constraints, problems are : Problem set: 2 solved, 42 unsolved in 2133 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 15/15 constraints]
After SMT, in 3540ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 3542ms
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 : 60/81 places, 43/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 0 places and 2 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3613 ms. Remains : 60/81 places, 39/65 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Successfully simplified 14 atomic propositions for a total of 13 simplifications.
[2024-05-28 14:27:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 14:27:03] [INFO ] Flatten gal took : 34 ms
FORMULA PolyORBLF-COL-S02J06T08-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:27:03] [INFO ] Flatten gal took : 10 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 14:27:03] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 37 ms.
[2024-05-28 14:27:03] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2024-05-28 14:27:03] [INFO ] Reduced 88 identical enabling conditions.
[2024-05-28 14:27:03] [INFO ] Reduced 88 identical enabling conditions.
[2024-05-28 14:27:03] [INFO ] Reduced 32 identical enabling conditions.
[2024-05-28 14:27:03] [INFO ] Reduced 8 identical enabling conditions.
[2024-05-28 14:27:03] [INFO ] Reduced 32 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 636 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 11 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2024-05-28 14:27:03] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-05-28 14:27:03] [INFO ] Computed 54 invariants in 67 ms
[2024-05-28 14:27:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 14:27:17] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 3 ms to minimize.
[2024-05-28 14:27:17] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-28 14:27:17] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:27:17] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:27:17] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:27:17] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 3 ms to minimize.
[2024-05-28 14:27:17] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:27:18] [INFO ] Deduced a trap composed of 370 places in 347 ms of which 5 ms to minimize.
[2024-05-28 14:27:18] [INFO ] Deduced a trap composed of 210 places in 308 ms of which 4 ms to minimize.
[2024-05-28 14:27:19] [INFO ] Deduced a trap composed of 188 places in 268 ms of which 4 ms to minimize.
[2024-05-28 14:27:20] [INFO ] Deduced a trap composed of 353 places in 365 ms of which 5 ms to minimize.
[2024-05-28 14:27:21] [INFO ] Deduced a trap composed of 373 places in 347 ms of which 5 ms to minimize.
[2024-05-28 14:27:21] [INFO ] Deduced a trap composed of 453 places in 309 ms of which 7 ms to minimize.
[2024-05-28 14:27:21] [INFO ] Deduced a trap composed of 361 places in 357 ms of which 5 ms to minimize.
[2024-05-28 14:27:22] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 65 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 14:27:27] [INFO ] Deduced a trap composed of 356 places in 335 ms of which 5 ms to minimize.
[2024-05-28 14:27:36] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 5 ms to minimize.
[2024-05-28 14:27:42] [INFO ] Deduced a trap composed of 346 places in 313 ms of which 4 ms to minimize.
[2024-05-28 14:27:42] [INFO ] Deduced a trap composed of 354 places in 341 ms of which 5 ms to minimize.
[2024-05-28 14:27:43] [INFO ] Deduced a trap composed of 327 places in 308 ms of which 4 ms to minimize.
[2024-05-28 14:27:43] [INFO ] Deduced a trap composed of 49 places in 343 ms of which 4 ms to minimize.
[2024-05-28 14:27:44] [INFO ] Deduced a trap composed of 47 places in 352 ms of which 6 ms to minimize.
[2024-05-28 14:27:45] [INFO ] Deduced a trap composed of 379 places in 333 ms of which 5 ms to minimize.
SMT process timed out in 42191ms, After SMT, problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 42212ms
[2024-05-28 14:27:45] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-28 14:27:45] [INFO ] Invariant cache hit.
[2024-05-28 14:27:45] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-28 14:27:45] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-28 14:27:45] [INFO ] Invariant cache hit.
[2024-05-28 14:27:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:27:47] [INFO ] Implicit Places using invariants and state equation in 2085 ms returned []
Implicit Place search using SMT with State Equation took 2304 ms to find 0 implicit places.
Running 1304 sub problems to find dead transitions.
[2024-05-28 14:27:47] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-28 14:27:47] [INFO ] Invariant cache hit.
[2024-05-28 14:27:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 14:28:01] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 3 ms to minimize.
[2024-05-28 14:28:01] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:28:01] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:28:01] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:28:01] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2024-05-28 14:28:02] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 2 ms to minimize.
[2024-05-28 14:28:02] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:28:02] [INFO ] Deduced a trap composed of 361 places in 363 ms of which 5 ms to minimize.
[2024-05-28 14:28:03] [INFO ] Deduced a trap composed of 340 places in 271 ms of which 4 ms to minimize.
[2024-05-28 14:28:03] [INFO ] Deduced a trap composed of 206 places in 279 ms of which 5 ms to minimize.
[2024-05-28 14:28:04] [INFO ] Deduced a trap composed of 382 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:28:04] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:28:05] [INFO ] Deduced a trap composed of 378 places in 370 ms of which 5 ms to minimize.
[2024-05-28 14:28:05] [INFO ] Deduced a trap composed of 372 places in 340 ms of which 5 ms to minimize.
[2024-05-28 14:28:05] [INFO ] Deduced a trap composed of 387 places in 312 ms of which 7 ms to minimize.
[2024-05-28 14:28:06] [INFO ] Deduced a trap composed of 379 places in 316 ms of which 4 ms to minimize.
[2024-05-28 14:28:06] [INFO ] Deduced a trap composed of 379 places in 354 ms of which 5 ms to minimize.
[2024-05-28 14:28:15] [INFO ] Deduced a trap composed of 489 places in 374 ms of which 5 ms to minimize.
[2024-05-28 14:28:16] [INFO ] Deduced a trap composed of 462 places in 348 ms of which 5 ms to minimize.
[2024-05-28 14:28:16] [INFO ] Deduced a trap composed of 463 places in 296 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 14:28:17] [INFO ] Deduced a trap composed of 343 places in 287 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 71 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 14:28:33] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:28:33] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 3 ms to minimize.
[2024-05-28 14:28:33] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 3 ms to minimize.
[2024-05-28 14:28:38] [INFO ] Deduced a trap composed of 351 places in 299 ms of which 5 ms to minimize.
[2024-05-28 14:28:39] [INFO ] Deduced a trap composed of 360 places in 352 ms of which 5 ms to minimize.
[2024-05-28 14:28:40] [INFO ] Deduced a trap composed of 355 places in 391 ms of which 5 ms to minimize.
[2024-05-28 14:28:40] [INFO ] Deduced a trap composed of 350 places in 346 ms of which 5 ms to minimize.
[2024-05-28 14:28:41] [INFO ] Deduced a trap composed of 195 places in 389 ms of which 5 ms to minimize.
[2024-05-28 14:28:41] [INFO ] Deduced a trap composed of 203 places in 363 ms of which 5 ms to minimize.
[2024-05-28 14:28:42] [INFO ] Deduced a trap composed of 3 places in 359 ms of which 5 ms to minimize.
[2024-05-28 14:28:44] [INFO ] Deduced a trap composed of 497 places in 256 ms of which 3 ms to minimize.
[2024-05-28 14:28:45] [INFO ] Deduced a trap composed of 425 places in 289 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1980 variables, and 83 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 33/33 constraints]
After SMT, in 61968ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 61999ms
Finished structural reductions in LTL mode , in 1 iterations and 106547 ms. Remains : 690/690 places, 1306/1306 transitions.
Support contains 636 out of 690 places after structural reductions.
[2024-05-28 14:28:49] [INFO ] Flatten gal took : 137 ms
[2024-05-28 14:28:50] [INFO ] Flatten gal took : 118 ms
[2024-05-28 14:28:50] [INFO ] Input system was already deterministic with 1306 transitions.
Reduction of identical properties reduced properties to check from 63 to 62
RANDOM walk for 40000 steps (12 resets) in 1439 ms. (27 steps per ms) remains 15/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 86 ms. (45 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 68 ms. (57 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 15/15 properties
[2024-05-28 14:28:51] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-28 14:28:51] [INFO ] Invariant cache hit.
[2024-05-28 14:28:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 2 (OVERLAPS) 138/461 variables, 6/8 constraints. Problems are: Problem set: 3 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 14/475 variables, 7/17 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 7 (OVERLAPS) 195/670 variables, 26/43 constraints. Problems are: Problem set: 11 solved, 4 unsolved
[2024-05-28 14:28:53] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 3 ms to minimize.
[2024-05-28 14:28:53] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 3 ms to minimize.
[2024-05-28 14:28:53] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-28 14:28:53] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:28:53] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:28:54] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:28:54] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:28:54] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/670 variables, 8/51 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/670 variables, 0/51 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/680 variables, 2/53 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/680 variables, 0/53 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/688 variables, 8/61 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/688 variables, 0/61 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1290/1978 variables, 688/749 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1978 variables, 96/845 constraints. Problems are: Problem set: 11 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1978/1980 variables, and 845 constraints, problems are : Problem set: 11 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 688/690 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 11 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 198/224 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 1/3 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 42/266 variables, 2/5 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/5 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/280 variables, 7/12 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/12 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 385/665 variables, 26/38 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 8/46 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/665 variables, 0/46 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/677 variables, 4/50 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/677 variables, 0/50 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 11/688 variables, 11/61 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/688 variables, 0/61 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1290/1978 variables, 688/749 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1978 variables, 96/845 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1978 variables, 4/849 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1978 variables, 0/849 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/1980 variables, 2/851 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1980 variables, 1/852 constraints. Problems are: Problem set: 11 solved, 4 unsolved
[2024-05-28 14:29:01] [INFO ] Deduced a trap composed of 356 places in 401 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1980 variables, 1/853 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1980 variables, 0/853 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1980 variables, 0/853 constraints. Problems are: Problem set: 11 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1980/1980 variables, and 853 constraints, problems are : Problem set: 11 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 690/690 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/15 constraints, Known Traps: 9/9 constraints]
After SMT, in 10483ms problems are : Problem set: 11 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 688 transition count 1250
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 122 place count 632 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 130 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 290 place count 544 transition count 1162
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 418 place count 480 transition count 1098
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 434 place count 480 transition count 1082
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 450 place count 464 transition count 1082
Applied a total of 450 rules in 239 ms. Remains 464 /690 variables (removed 226) and now considering 1082/1306 (removed 224) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 14:29:02] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 464 cols
[2024-05-28 14:29:02] [INFO ] Computed 52 invariants in 65 ms
[2024-05-28 14:29:02] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:29:11] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:29:11] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:29:11] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:29:11] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:29:11] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:29:11] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:29:11] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:29:11] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:29:12] [INFO ] Deduced a trap composed of 168 places in 287 ms of which 4 ms to minimize.
[2024-05-28 14:29:14] [INFO ] Deduced a trap composed of 69 places in 300 ms of which 4 ms to minimize.
[2024-05-28 14:29:16] [INFO ] Deduced a trap composed of 158 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:29:16] [INFO ] Deduced a trap composed of 276 places in 231 ms of which 4 ms to minimize.
[2024-05-28 14:29:21] [INFO ] Deduced a trap composed of 150 places in 254 ms of which 3 ms to minimize.
[2024-05-28 14:29:21] [INFO ] Deduced a trap composed of 137 places in 243 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1530 variables, and 64 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:29:26] [INFO ] Deduced a trap composed of 167 places in 259 ms of which 3 ms to minimize.
[2024-05-28 14:29:26] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-28 14:29:32] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1530 variables, and 67 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 17/17 constraints]
After SMT, in 42465ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 42479ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42721 ms. Remains : 464/690 places, 1082/1306 transitions.
RANDOM walk for 40000 steps (18 resets) in 753 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 336 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 122849 steps, run timeout after 3003 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 122849 steps, saw 75477 distinct states, run finished after 3012 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-28 14:29:48] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:29:48] [INFO ] Invariant cache hit.
[2024-05-28 14:29:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 25/209 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/223 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 216/439 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:29:48] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 3 ms to minimize.
[2024-05-28 14:29:48] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-28 14:29:49] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:29:49] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:29:49] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:29:49] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:29:49] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/442 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 19/461 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/462 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1066/1528 variables, 462/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1528 variables, 96/616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1528 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/1530 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1530 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1530 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1530 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1530/1530 variables, and 619 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4128 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 25/209 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/223 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 216/439 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:29:52] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:29:53] [INFO ] Deduced a trap composed of 178 places in 289 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/442 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 19/461 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/462 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1066/1528 variables, 462/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1528 variables, 96/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1528 variables, 4/622 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1528 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/1530 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1530 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1530 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/1530 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 625 constraints, problems are : Problem set: 0 solved, 4 unsolved in 15751 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 19915ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 12140 ms.
Support contains 26 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1082/1082 transitions.
Applied a total of 0 rules in 23 ms. Remains 464 /464 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 464/464 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1082/1082 transitions.
Applied a total of 0 rules in 20 ms. Remains 464 /464 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2024-05-28 14:30:20] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:30:20] [INFO ] Invariant cache hit.
[2024-05-28 14:30:20] [INFO ] Implicit Places using invariants in 405 ms returned [418, 419, 420, 421, 422, 423, 424, 425]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 412 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 456/464 places, 1082/1082 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 1074
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 1074
Applied a total of 16 rules in 30 ms. Remains 448 /456 variables (removed 8) and now considering 1074/1082 (removed 8) transitions.
[2024-05-28 14:30:20] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 448 cols
[2024-05-28 14:30:21] [INFO ] Computed 44 invariants in 64 ms
[2024-05-28 14:30:21] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-28 14:30:21] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:30:21] [INFO ] Invariant cache hit.
[2024-05-28 14:30:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:30:27] [INFO ] Implicit Places using invariants and state equation in 6411 ms returned []
Implicit Place search using SMT with State Equation took 6857 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 448/464 places, 1074/1082 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7321 ms. Remains : 448/464 places, 1074/1082 transitions.
RANDOM walk for 40000 steps (14 resets) in 569 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (11 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (11 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 148194 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 4
Probabilistic random walk after 148194 steps, saw 84669 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-28 14:30:31] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:30:31] [INFO ] Invariant cache hit.
[2024-05-28 14:30:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 25/209 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/223 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 216/439 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:30:31] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:30:31] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-28 14:30:32] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2024-05-28 14:30:32] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:30:32] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:30:32] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/446 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1058/1504 variables, 446/495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 96/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 2/1506 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1506 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1506 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 594 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3949 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 25/209 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/223 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 216/439 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/446 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1058/1504 variables, 446/495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 96/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 4/595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:30:38] [INFO ] Deduced a trap composed of 188 places in 326 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1504 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1504 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/1506 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1506 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1506 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1506 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1506/1506 variables, and 599 constraints, problems are : Problem set: 0 solved, 4 unsolved in 15357 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 19343ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 37229 ms.
Support contains 26 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 22 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 18 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-05-28 14:31:28] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:31:28] [INFO ] Invariant cache hit.
[2024-05-28 14:31:28] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-28 14:31:28] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:31:28] [INFO ] Invariant cache hit.
[2024-05-28 14:31:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:31:34] [INFO ] Implicit Places using invariants and state equation in 6410 ms returned []
Implicit Place search using SMT with State Equation took 6871 ms to find 0 implicit places.
[2024-05-28 14:31:35] [INFO ] Redundant transitions in 75 ms returned []
Running 1072 sub problems to find dead transitions.
[2024-05-28 14:31:35] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:31:35] [INFO ] Invariant cache hit.
[2024-05-28 14:31:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 13 ms to minimize.
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:31:44] [INFO ] Deduced a trap composed of 167 places in 183 ms of which 2 ms to minimize.
[2024-05-28 14:31:44] [INFO ] Deduced a trap composed of 165 places in 260 ms of which 3 ms to minimize.
[2024-05-28 14:31:44] [INFO ] Deduced a trap composed of 171 places in 98 ms of which 1 ms to minimize.
[2024-05-28 14:31:50] [INFO ] Deduced a trap composed of 150 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:31:50] [INFO ] Deduced a trap composed of 288 places in 173 ms of which 2 ms to minimize.
[2024-05-28 14:31:50] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-28 14:31:59] [INFO ] Deduced a trap composed of 179 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:31:59] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-28 14:32:06] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 59 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Problem TDEAD966 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/447 variables, 1/60 constraints. Problems are: Problem set: 48 solved, 1024 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/60 constraints. Problems are: Problem set: 48 solved, 1024 unsolved
Problem TDEAD964 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/448 variables, 1/61 constraints. Problems are: Problem set: 88 solved, 984 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/1506 variables, and 61 constraints, problems are : Problem set: 88 solved, 984 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 17/17 constraints]
After SMT, in 62295ms problems are : Problem set: 88 solved, 984 unsolved
Search for dead transitions found 88 dead transitions in 62316ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 448/448 places, 986/1074 transitions.
Reduce places removed 0 places and 16 transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 0 places and 16 transitions.
Applied a total of 0 rules in 16 ms. Remains 448 /448 variables (removed 0) and now considering 954/986 (removed 32) transitions.
[2024-05-28 14:32:37] [INFO ] Redundant transitions in 24 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69376 ms. Remains : 448/448 places, 954/1074 transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
[2024-05-28 14:32:37] [INFO ] Flatten gal took : 107 ms
[2024-05-28 14:32:37] [INFO ] Flatten gal took : 91 ms
[2024-05-28 14:32:37] [INFO ] Input system was already deterministic with 1306 transitions.
Support contains 471 out of 690 places (down from 480) after GAL structural reductions.
FORMULA PolyORBLF-COL-S02J06T08-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Applied a total of 18 rules in 24 ms. Remains 680 /690 variables (removed 10) and now considering 1298/1306 (removed 8) transitions.
Running 1296 sub problems to find dead transitions.
[2024-05-28 14:32:38] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 680 cols
[2024-05-28 14:32:38] [INFO ] Computed 52 invariants in 25 ms
[2024-05-28 14:32:38] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-28 14:32:50] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:32:51] [INFO ] Deduced a trap composed of 96 places in 188 ms of which 2 ms to minimize.
[2024-05-28 14:32:52] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:32:52] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 2 ms to minimize.
[2024-05-28 14:32:52] [INFO ] Deduced a trap composed of 73 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:32:52] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:32:52] [INFO ] Deduced a trap composed of 69 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:32:52] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:32:53] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:32:57] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 2 ms to minimize.
[2024-05-28 14:32:58] [INFO ] Deduced a trap composed of 360 places in 237 ms of which 4 ms to minimize.
[2024-05-28 14:32:59] [INFO ] Deduced a trap composed of 344 places in 242 ms of which 4 ms to minimize.
[2024-05-28 14:32:59] [INFO ] Deduced a trap composed of 123 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:32:59] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 4 ms to minimize.
[2024-05-28 14:32:59] [INFO ] Deduced a trap composed of 351 places in 237 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/1962 variables, and 65 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/680 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1296/1296 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-28 14:33:01] [INFO ] Deduced a trap composed of 143 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:33:01] [INFO ] Deduced a trap composed of 179 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:33:02] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:33:02] [INFO ] Deduced a trap composed of 192 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:33:02] [INFO ] Deduced a trap composed of 170 places in 223 ms of which 3 ms to minimize.
[2024-05-28 14:33:03] [INFO ] Deduced a trap composed of 399 places in 253 ms of which 4 ms to minimize.
[2024-05-28 14:33:03] [INFO ] Deduced a trap composed of 399 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:33:14] [INFO ] Deduced a trap composed of 327 places in 231 ms of which 4 ms to minimize.
[2024-05-28 14:33:15] [INFO ] Deduced a trap composed of 356 places in 299 ms of which 3 ms to minimize.
[2024-05-28 14:33:18] [INFO ] Deduced a trap composed of 174 places in 256 ms of which 4 ms to minimize.
[2024-05-28 14:33:18] [INFO ] Deduced a trap composed of 376 places in 203 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 678/1962 variables, and 76 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/680 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1296 constraints, Known Traps: 26/26 constraints]
After SMT, in 41876ms problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 41888ms
[2024-05-28 14:33:19] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-05-28 14:33:19] [INFO ] Invariant cache hit.
[2024-05-28 14:33:20] [INFO ] Implicit Places using invariants in 355 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 379 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 672/690 places, 1298/1306 transitions.
Applied a total of 0 rules in 8 ms. Remains 672 /672 variables (removed 0) and now considering 1298/1298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42316 ms. Remains : 672/690 places, 1298/1306 transitions.
[2024-05-28 14:33:20] [INFO ] Flatten gal took : 49 ms
[2024-05-28 14:33:20] [INFO ] Flatten gal took : 48 ms
[2024-05-28 14:33:20] [INFO ] Input system was already deterministic with 1298 transitions.
[2024-05-28 14:33:20] [INFO ] Flatten gal took : 87 ms
[2024-05-28 14:33:20] [INFO ] Flatten gal took : 75 ms
[2024-05-28 14:33:20] [INFO ] Time to serialize gal into /tmp/CTLFireability2645093521750344801.gal : 67 ms
[2024-05-28 14:33:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7482222206261144289.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2645093521750344801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7482222206261144289.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:33:51] [INFO ] Flatten gal took : 54 ms
[2024-05-28 14:33:51] [INFO ] Applying decomposition
[2024-05-28 14:33:51] [INFO ] Flatten gal took : 75 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/graph15844994368411834595.txt' '-o' '/tmp/graph15844994368411834595.bin' '-w' '/tmp/graph15844994368411834595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15844994368411834595.bin' '-l' '-1' '-v' '-w' '/tmp/graph15844994368411834595.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:33:51] [INFO ] Decomposing Gal with order
[2024-05-28 14:33:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:33:51] [INFO ] Removed a total of 1075 redundant transitions.
[2024-05-28 14:33:51] [INFO ] Flatten gal took : 270 ms
[2024-05-28 14:33:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 285 labels/synchronizations in 89 ms.
[2024-05-28 14:33:52] [INFO ] Time to serialize gal into /tmp/CTLFireability17115116826922984905.gal : 31 ms
[2024-05-28 14:33:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4899704715083355333.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17115116826922984905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4899704715083355333.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 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 68 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:34:22] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-05-28 14:34:22] [INFO ] Computed 52 invariants in 16 ms
[2024-05-28 14:34:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:34:37] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 4 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:34:43] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 58 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:34:46] [INFO ] Deduced a trap composed of 154 places in 314 ms of which 5 ms to minimize.
[2024-05-28 14:34:46] [INFO ] Deduced a trap composed of 174 places in 268 ms of which 4 ms to minimize.
[2024-05-28 14:34:46] [INFO ] Deduced a trap composed of 315 places in 292 ms of which 5 ms to minimize.
[2024-05-28 14:34:47] [INFO ] Deduced a trap composed of 327 places in 279 ms of which 3 ms to minimize.
[2024-05-28 14:34:47] [INFO ] Deduced a trap composed of 390 places in 232 ms of which 4 ms to minimize.
[2024-05-28 14:34:48] [INFO ] Deduced a trap composed of 336 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:34:48] [INFO ] Deduced a trap composed of 372 places in 339 ms of which 5 ms to minimize.
[2024-05-28 14:34:48] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 4 ms to minimize.
[2024-05-28 14:34:49] [INFO ] Deduced a trap composed of 343 places in 280 ms of which 4 ms to minimize.
[2024-05-28 14:34:49] [INFO ] Deduced a trap composed of 375 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:34:49] [INFO ] Deduced a trap composed of 348 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:35:01] [INFO ] Deduced a trap composed of 326 places in 234 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 70 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 20/20 constraints]
After SMT, in 41852ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41883ms
[2024-05-28 14:35:04] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:35:04] [INFO ] Invariant cache hit.
[2024-05-28 14:35:04] [INFO ] Implicit Places using invariants in 536 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 539 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 6 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42500 ms. Remains : 664/690 places, 1290/1306 transitions.
[2024-05-28 14:35:04] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:35:04] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:35:04] [INFO ] Input system was already deterministic with 1290 transitions.
[2024-05-28 14:35:04] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:35:04] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:35:04] [INFO ] Time to serialize gal into /tmp/CTLFireability3497115438214983907.gal : 7 ms
[2024-05-28 14:35:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2939345264511436291.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/CTLFireability3497115438214983907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2939345264511436291.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:35:35] [INFO ] Flatten gal took : 88 ms
[2024-05-28 14:35:35] [INFO ] Applying decomposition
[2024-05-28 14:35:35] [INFO ] Flatten gal took : 65 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/graph10547984559633599066.txt' '-o' '/tmp/graph10547984559633599066.bin' '-w' '/tmp/graph10547984559633599066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10547984559633599066.bin' '-l' '-1' '-v' '-w' '/tmp/graph10547984559633599066.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:35:35] [INFO ] Decomposing Gal with order
[2024-05-28 14:35:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:35:35] [INFO ] Removed a total of 1136 redundant transitions.
[2024-05-28 14:35:35] [INFO ] Flatten gal took : 140 ms
[2024-05-28 14:35:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 33 ms.
[2024-05-28 14:35:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1590937367324532432.gal : 15 ms
[2024-05-28 14:35:35] [INFO ] Time to serialize properties into /tmp/CTLFireability22097261188427407.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/CTLFireability1590937367324532432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability22097261188427407.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 682 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 682 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 674 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 674 transition count 1290
Applied a total of 32 rules in 37 ms. Remains 674 /690 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:36:05] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 674 cols
[2024-05-28 14:36:05] [INFO ] Computed 54 invariants in 24 ms
[2024-05-28 14:36:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:36:17] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:36:17] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:36:17] [INFO ] Deduced a trap composed of 349 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:36:17] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 4 ms to minimize.
[2024-05-28 14:36:17] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 384 places in 240 ms of which 4 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 2 ms to minimize.
[2024-05-28 14:36:19] [INFO ] Deduced a trap composed of 336 places in 245 ms of which 3 ms to minimize.
[2024-05-28 14:36:19] [INFO ] Deduced a trap composed of 319 places in 260 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 64 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:36:37] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-05-28 14:36:40] [INFO ] Deduced a trap composed of 351 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:36:40] [INFO ] Deduced a trap composed of 346 places in 284 ms of which 3 ms to minimize.
[2024-05-28 14:36:41] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:36:42] [INFO ] Deduced a trap composed of 374 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:36:42] [INFO ] Deduced a trap composed of 59 places in 260 ms of which 3 ms to minimize.
[2024-05-28 14:36:44] [INFO ] Deduced a trap composed of 391 places in 224 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1948 variables, and 71 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 21/21 constraints]
After SMT, in 41568ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41588ms
[2024-05-28 14:36:47] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:36:47] [INFO ] Invariant cache hit.
[2024-05-28 14:36:47] [INFO ] Implicit Places using invariants in 369 ms returned [532, 533, 534, 535, 536, 537, 538, 539]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 384 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 666/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 7 ms. Remains 666 /666 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42028 ms. Remains : 666/690 places, 1290/1306 transitions.
[2024-05-28 14:36:47] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:36:47] [INFO ] Flatten gal took : 52 ms
[2024-05-28 14:36:47] [INFO ] Input system was already deterministic with 1290 transitions.
[2024-05-28 14:36:47] [INFO ] Flatten gal took : 50 ms
[2024-05-28 14:36:48] [INFO ] Flatten gal took : 45 ms
[2024-05-28 14:36:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9174030902033157121.gal : 8 ms
[2024-05-28 14:36:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1336415204810073544.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/CTLFireability9174030902033157121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1336415204810073544.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:37:18] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:37:18] [INFO ] Applying decomposition
[2024-05-28 14:37:18] [INFO ] Flatten gal took : 32 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/graph11752561335951747722.txt' '-o' '/tmp/graph11752561335951747722.bin' '-w' '/tmp/graph11752561335951747722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11752561335951747722.bin' '-l' '-1' '-v' '-w' '/tmp/graph11752561335951747722.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:37:18] [INFO ] Decomposing Gal with order
[2024-05-28 14:37:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:37:18] [INFO ] Removed a total of 1258 redundant transitions.
[2024-05-28 14:37:18] [INFO ] Flatten gal took : 189 ms
[2024-05-28 14:37:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 47 ms.
[2024-05-28 14:37:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9554048478250924237.gal : 22 ms
[2024-05-28 14:37:18] [INFO ] Time to serialize properties into /tmp/CTLFireability18066405389265656151.ctl : 11 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/CTLFireability9554048478250924237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18066405389265656151.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 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 31 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:37:48] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-05-28 14:37:48] [INFO ] Computed 52 invariants in 24 ms
[2024-05-28 14:37:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:38:01] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 0 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:38:06] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:38:07] [INFO ] Deduced a trap composed of 382 places in 281 ms of which 3 ms to minimize.
[2024-05-28 14:38:07] [INFO ] Deduced a trap composed of 355 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:38:07] [INFO ] Deduced a trap composed of 361 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:38:08] [INFO ] Deduced a trap composed of 386 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:38:08] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-28 14:38:08] [INFO ] Deduced a trap composed of 398 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:38:08] [INFO ] Deduced a trap composed of 375 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:38:09] [INFO ] Deduced a trap composed of 360 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:38:09] [INFO ] Deduced a trap composed of 362 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:38:09] [INFO ] Deduced a trap composed of 342 places in 219 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:38:12] [INFO ] Deduced a trap composed of 355 places in 298 ms of which 4 ms to minimize.
[2024-05-28 14:38:12] [INFO ] Deduced a trap composed of 340 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:38:12] [INFO ] Deduced a trap composed of 334 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:38:13] [INFO ] Deduced a trap composed of 126 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:38:13] [INFO ] Deduced a trap composed of 198 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:38:13] [INFO ] Deduced a trap composed of 328 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:38:14] [INFO ] Deduced a trap composed of 389 places in 228 ms of which 4 ms to minimize.
[2024-05-28 14:38:22] [INFO ] Deduced a trap composed of 474 places in 248 ms of which 3 ms to minimize.
[2024-05-28 14:38:22] [INFO ] Deduced a trap composed of 461 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:38:22] [INFO ] Deduced a trap composed of 462 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:38:30] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 79 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 29/29 constraints]
After SMT, in 41758ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41774ms
[2024-05-28 14:38:30] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:38:30] [INFO ] Invariant cache hit.
[2024-05-28 14:38:30] [INFO ] Implicit Places using invariants in 382 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 393 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 6 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42207 ms. Remains : 664/690 places, 1290/1306 transitions.
[2024-05-28 14:38:31] [INFO ] Flatten gal took : 30 ms
[2024-05-28 14:38:31] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:38:31] [INFO ] Input system was already deterministic with 1290 transitions.
[2024-05-28 14:38:31] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:38:31] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:38:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7875624445464587143.gal : 6 ms
[2024-05-28 14:38:31] [INFO ] Time to serialize properties into /tmp/CTLFireability10009762730060618058.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/CTLFireability7875624445464587143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10009762730060618058.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 14:39:01] [INFO ] Flatten gal took : 58 ms
[2024-05-28 14:39:01] [INFO ] Applying decomposition
[2024-05-28 14:39:01] [INFO ] Flatten gal took : 31 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/graph2229606425140045978.txt' '-o' '/tmp/graph2229606425140045978.bin' '-w' '/tmp/graph2229606425140045978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2229606425140045978.bin' '-l' '-1' '-v' '-w' '/tmp/graph2229606425140045978.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:39:01] [INFO ] Decomposing Gal with order
[2024-05-28 14:39:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:39:01] [INFO ] Removed a total of 1098 redundant transitions.
[2024-05-28 14:39:01] [INFO ] Flatten gal took : 106 ms
[2024-05-28 14:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 12 ms.
[2024-05-28 14:39:01] [INFO ] Time to serialize gal into /tmp/CTLFireability3725867224986161244.gal : 21 ms
[2024-05-28 14:39:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2546774195534599236.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/CTLFireability3725867224986161244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2546774195534599236.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 688 transition count 1258
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 640 transition count 1250
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 632 transition count 1250
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 112 place count 632 transition count 1162
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 288 place count 544 transition count 1162
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 384 place count 496 transition count 1114
Applied a total of 384 rules in 121 ms. Remains 496 /690 variables (removed 194) and now considering 1114/1306 (removed 192) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-28 14:39:31] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 496 cols
[2024-05-28 14:39:31] [INFO ] Computed 52 invariants in 14 ms
[2024-05-28 14:39:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 14:39:41] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 3 ms to minimize.
[2024-05-28 14:39:41] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:39:41] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:39:41] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:39:41] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:39:41] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:39:41] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:39:41] [INFO ] Deduced a trap composed of 202 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:39:42] [INFO ] Deduced a trap composed of 191 places in 188 ms of which 2 ms to minimize.
[2024-05-28 14:39:42] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:39:50] [INFO ] Deduced a trap composed of 167 places in 178 ms of which 2 ms to minimize.
[2024-05-28 14:39:51] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1594 variables, and 62 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 14:39:59] [INFO ] Deduced a trap composed of 308 places in 177 ms of which 2 ms to minimize.
[2024-05-28 14:40:02] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 270 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 221 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-28 14:40:05] [INFO ] Deduced a trap composed of 68 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:40:05] [INFO ] Deduced a trap composed of 93 places in 173 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1594 variables, and 69 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 19/19 constraints]
After SMT, in 41586ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41599ms
[2024-05-28 14:40:13] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 14:40:13] [INFO ] Invariant cache hit.
[2024-05-28 14:40:13] [INFO ] Implicit Places using invariants in 327 ms returned [450, 451, 452, 453, 454, 455, 456, 457]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 337 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 488/690 places, 1114/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 480 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 480 transition count 1106
Applied a total of 16 rules in 25 ms. Remains 480 /488 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
[2024-05-28 14:40:13] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 480 cols
[2024-05-28 14:40:13] [INFO ] Computed 44 invariants in 14 ms
[2024-05-28 14:40:14] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-28 14:40:14] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2024-05-28 14:40:14] [INFO ] Invariant cache hit.
[2024-05-28 14:40:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:40:20] [INFO ] Implicit Places using invariants and state equation in 6263 ms returned []
Implicit Place search using SMT with State Equation took 6633 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 480/690 places, 1106/1306 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 48720 ms. Remains : 480/690 places, 1106/1306 transitions.
[2024-05-28 14:40:20] [INFO ] Flatten gal took : 28 ms
[2024-05-28 14:40:20] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:40:20] [INFO ] Input system was already deterministic with 1106 transitions.
[2024-05-28 14:40:20] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:40:20] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:40:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9329186208354986228.gal : 8 ms
[2024-05-28 14:40:20] [INFO ] Time to serialize properties into /tmp/CTLFireability3433991837516254581.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/CTLFireability9329186208354986228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3433991837516254581.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:40:50] [INFO ] Flatten gal took : 29 ms
[2024-05-28 14:40:50] [INFO ] Applying decomposition
[2024-05-28 14:40:50] [INFO ] Flatten gal took : 29 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/graph5074846347626961668.txt' '-o' '/tmp/graph5074846347626961668.bin' '-w' '/tmp/graph5074846347626961668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5074846347626961668.bin' '-l' '-1' '-v' '-w' '/tmp/graph5074846347626961668.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:40:51] [INFO ] Decomposing Gal with order
[2024-05-28 14:40:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:40:51] [INFO ] Removed a total of 816 redundant transitions.
[2024-05-28 14:40:51] [INFO ] Flatten gal took : 92 ms
[2024-05-28 14:40:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 302 labels/synchronizations in 11 ms.
[2024-05-28 14:40:51] [INFO ] Time to serialize gal into /tmp/CTLFireability12109199843177715321.gal : 8 ms
[2024-05-28 14:40:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4345462947087817374.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/CTLFireability12109199843177715321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4345462947087817374.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 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 32 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:41:21] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-05-28 14:41:21] [INFO ] Computed 52 invariants in 16 ms
[2024-05-28 14:41:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:41:35] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:41:36] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:41:36] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:41:36] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:41:37] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:41:37] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:41:37] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:41:40] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:41:41] [INFO ] Deduced a trap composed of 382 places in 248 ms of which 4 ms to minimize.
[2024-05-28 14:41:41] [INFO ] Deduced a trap composed of 355 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:41:42] [INFO ] Deduced a trap composed of 361 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:41:42] [INFO ] Deduced a trap composed of 386 places in 233 ms of which 4 ms to minimize.
[2024-05-28 14:41:42] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-28 14:41:42] [INFO ] Deduced a trap composed of 398 places in 281 ms of which 4 ms to minimize.
SMT process timed out in 21564ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 21580ms
[2024-05-28 14:41:42] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:41:42] [INFO ] Invariant cache hit.
[2024-05-28 14:41:43] [INFO ] Implicit Places using invariants in 375 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 389 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 5 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22011 ms. Remains : 664/690 places, 1290/1306 transitions.
[2024-05-28 14:41:43] [INFO ] Flatten gal took : 30 ms
[2024-05-28 14:41:43] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:41:43] [INFO ] Input system was already deterministic with 1290 transitions.
[2024-05-28 14:41:43] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:41:43] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:41:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2015829099059112413.gal : 5 ms
[2024-05-28 14:41:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8131136404135993615.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/CTLFireability2015829099059112413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8131136404135993615.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:42:13] [INFO ] Flatten gal took : 72 ms
[2024-05-28 14:42:13] [INFO ] Applying decomposition
[2024-05-28 14:42:13] [INFO ] Flatten gal took : 52 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/graph11446663449678825668.txt' '-o' '/tmp/graph11446663449678825668.bin' '-w' '/tmp/graph11446663449678825668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11446663449678825668.bin' '-l' '-1' '-v' '-w' '/tmp/graph11446663449678825668.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:42:13] [INFO ] Decomposing Gal with order
[2024-05-28 14:42:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:42:13] [INFO ] Removed a total of 1157 redundant transitions.
[2024-05-28 14:42:13] [INFO ] Flatten gal took : 94 ms
[2024-05-28 14:42:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 14 ms.
[2024-05-28 14:42:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15422431141598447663.gal : 12 ms
[2024-05-28 14:42:13] [INFO ] Time to serialize properties into /tmp/CTLFireability14351073714920019974.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/CTLFireability15422431141598447663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14351073714920019974.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 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 42 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:42:44] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:42:44] [INFO ] Invariant cache hit.
[2024-05-28 14:42:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:42:56] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:42:56] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 2 ms to minimize.
[2024-05-28 14:42:56] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:42:57] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:42:57] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:42:57] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:42:57] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:42:57] [INFO ] Deduced a trap composed of 380 places in 310 ms of which 4 ms to minimize.
[2024-05-28 14:42:58] [INFO ] Deduced a trap composed of 364 places in 283 ms of which 4 ms to minimize.
[2024-05-28 14:42:58] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:42:58] [INFO ] Deduced a trap composed of 367 places in 362 ms of which 5 ms to minimize.
[2024-05-28 14:42:59] [INFO ] Deduced a trap composed of 184 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:43:00] [INFO ] Deduced a trap composed of 366 places in 360 ms of which 4 ms to minimize.
[2024-05-28 14:43:00] [INFO ] Deduced a trap composed of 382 places in 323 ms of which 5 ms to minimize.
[2024-05-28 14:43:00] [INFO ] Deduced a trap composed of 395 places in 316 ms of which 5 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 356 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 402 places in 300 ms of which 5 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 353 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:43:02] [INFO ] Deduced a trap composed of 346 places in 297 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:43:08] [INFO ] Deduced a trap composed of 341 places in 298 ms of which 3 ms to minimize.
[2024-05-28 14:43:09] [INFO ] Deduced a trap composed of 380 places in 328 ms of which 5 ms to minimize.
[2024-05-28 14:43:16] [INFO ] Deduced a trap composed of 461 places in 309 ms of which 4 ms to minimize.
[2024-05-28 14:43:18] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:43:23] [INFO ] Deduced a trap composed of 350 places in 259 ms of which 3 ms to minimize.
[2024-05-28 14:43:24] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 75 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 25/25 constraints]
After SMT, in 41994ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42013ms
[2024-05-28 14:43:26] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:43:26] [INFO ] Invariant cache hit.
[2024-05-28 14:43:26] [INFO ] Implicit Places using invariants in 391 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 395 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 6 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42461 ms. Remains : 664/690 places, 1290/1306 transitions.
[2024-05-28 14:43:26] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:43:26] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:43:26] [INFO ] Input system was already deterministic with 1290 transitions.
[2024-05-28 14:43:26] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:43:26] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:43:26] [INFO ] Time to serialize gal into /tmp/CTLFireability14084616281085549033.gal : 5 ms
[2024-05-28 14:43:26] [INFO ] Time to serialize properties into /tmp/CTLFireability11334827860158218665.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/CTLFireability14084616281085549033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11334827860158218665.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:43:56] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:43:56] [INFO ] Applying decomposition
[2024-05-28 14:43:56] [INFO ] Flatten gal took : 32 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/graph9673831824221096188.txt' '-o' '/tmp/graph9673831824221096188.bin' '-w' '/tmp/graph9673831824221096188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9673831824221096188.bin' '-l' '-1' '-v' '-w' '/tmp/graph9673831824221096188.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:43:56] [INFO ] Decomposing Gal with order
[2024-05-28 14:43:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:43:57] [INFO ] Removed a total of 1088 redundant transitions.
[2024-05-28 14:43:57] [INFO ] Flatten gal took : 65 ms
[2024-05-28 14:43:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 12 ms.
[2024-05-28 14:43:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8046256567150685016.gal : 7 ms
[2024-05-28 14:43:57] [INFO ] Time to serialize properties into /tmp/CTLFireability820136182929043132.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/CTLFireability8046256567150685016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability820136182929043132.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 30 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:44:27] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:44:27] [INFO ] Invariant cache hit.
[2024-05-28 14:44:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:44:38] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:44:38] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:44:38] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 380 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 364 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 0 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 367 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:44:40] [INFO ] Deduced a trap composed of 184 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:44:41] [INFO ] Deduced a trap composed of 366 places in 235 ms of which 4 ms to minimize.
[2024-05-28 14:44:41] [INFO ] Deduced a trap composed of 382 places in 237 ms of which 4 ms to minimize.
[2024-05-28 14:44:42] [INFO ] Deduced a trap composed of 395 places in 237 ms of which 3 ms to minimize.
[2024-05-28 14:44:42] [INFO ] Deduced a trap composed of 356 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:44:42] [INFO ] Deduced a trap composed of 402 places in 251 ms of which 4 ms to minimize.
[2024-05-28 14:44:42] [INFO ] Deduced a trap composed of 353 places in 240 ms of which 4 ms to minimize.
[2024-05-28 14:44:43] [INFO ] Deduced a trap composed of 346 places in 287 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:44:50] [INFO ] Deduced a trap composed of 341 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:44:51] [INFO ] Deduced a trap composed of 380 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:44:58] [INFO ] Deduced a trap composed of 461 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:44:59] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:45:03] [INFO ] Deduced a trap composed of 350 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:45:04] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:45:06] [INFO ] Deduced a trap composed of 396 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 371 places in 213 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 77 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 27/27 constraints]
After SMT, in 41755ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41766ms
[2024-05-28 14:45:08] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:45:08] [INFO ] Invariant cache hit.
[2024-05-28 14:45:09] [INFO ] Implicit Places using invariants in 315 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 316 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 10 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42125 ms. Remains : 664/690 places, 1290/1306 transitions.
[2024-05-28 14:45:09] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:45:09] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:45:09] [INFO ] Input system was already deterministic with 1290 transitions.
[2024-05-28 14:45:09] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:45:09] [INFO ] Flatten gal took : 70 ms
[2024-05-28 14:45:09] [INFO ] Time to serialize gal into /tmp/CTLFireability4043861897500050983.gal : 6 ms
[2024-05-28 14:45:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10918208424033539908.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/CTLFireability4043861897500050983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10918208424033539908.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 14:45:39] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:45:39] [INFO ] Applying decomposition
[2024-05-28 14:45:39] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11082378275969005069.txt' '-o' '/tmp/graph11082378275969005069.bin' '-w' '/tmp/graph11082378275969005069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11082378275969005069.bin' '-l' '-1' '-v' '-w' '/tmp/graph11082378275969005069.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:45:39] [INFO ] Decomposing Gal with order
[2024-05-28 14:45:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:45:39] [INFO ] Removed a total of 1033 redundant transitions.
[2024-05-28 14:45:39] [INFO ] Flatten gal took : 70 ms
[2024-05-28 14:45:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 8 ms.
[2024-05-28 14:45:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6064605836381196737.gal : 20 ms
[2024-05-28 14:45:39] [INFO ] Time to serialize properties into /tmp/CTLFireability15466551788967077115.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/CTLFireability6064605836381196737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15466551788967077115.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 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Applied a total of 18 rules in 25 ms. Remains 680 /690 variables (removed 10) and now considering 1298/1306 (removed 8) transitions.
Running 1296 sub problems to find dead transitions.
[2024-05-28 14:46:10] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 680 cols
[2024-05-28 14:46:10] [INFO ] Computed 52 invariants in 20 ms
[2024-05-28 14:46:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-28 14:46:23] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:46:24] [INFO ] Deduced a trap composed of 96 places in 219 ms of which 3 ms to minimize.
[2024-05-28 14:46:24] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:46:24] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:46:25] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:46:25] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 2 ms to minimize.
[2024-05-28 14:46:25] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:46:25] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:46:25] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
[2024-05-28 14:46:29] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:46:31] [INFO ] Deduced a trap composed of 360 places in 219 ms of which 4 ms to minimize.
[2024-05-28 14:46:31] [INFO ] Deduced a trap composed of 344 places in 230 ms of which 4 ms to minimize.
SMT process timed out in 21573ms, After SMT, problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 21593ms
[2024-05-28 14:46:31] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-05-28 14:46:31] [INFO ] Invariant cache hit.
[2024-05-28 14:46:32] [INFO ] Implicit Places using invariants in 477 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 478 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 672/690 places, 1298/1306 transitions.
Applied a total of 0 rules in 5 ms. Remains 672 /672 variables (removed 0) and now considering 1298/1298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22108 ms. Remains : 672/690 places, 1298/1306 transitions.
[2024-05-28 14:46:32] [INFO ] Flatten gal took : 30 ms
[2024-05-28 14:46:32] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:46:32] [INFO ] Input system was already deterministic with 1298 transitions.
[2024-05-28 14:46:32] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:46:32] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:46:32] [INFO ] Time to serialize gal into /tmp/CTLFireability17025659851374643157.gal : 5 ms
[2024-05-28 14:46:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16631343732455225393.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/CTLFireability17025659851374643157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16631343732455225393.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:47:02] [INFO ] Flatten gal took : 74 ms
[2024-05-28 14:47:02] [INFO ] Applying decomposition
[2024-05-28 14:47:02] [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/graph2698332935818564600.txt' '-o' '/tmp/graph2698332935818564600.bin' '-w' '/tmp/graph2698332935818564600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2698332935818564600.bin' '-l' '-1' '-v' '-w' '/tmp/graph2698332935818564600.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:47:02] [INFO ] Decomposing Gal with order
[2024-05-28 14:47:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:47:02] [INFO ] Removed a total of 1225 redundant transitions.
[2024-05-28 14:47:02] [INFO ] Flatten gal took : 99 ms
[2024-05-28 14:47:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 13 ms.
[2024-05-28 14:47:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4763499271535938914.gal : 8 ms
[2024-05-28 14:47:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14448824400466048541.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/CTLFireability4763499271535938914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14448824400466048541.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 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 20 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:47:32] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-05-28 14:47:32] [INFO ] Computed 52 invariants in 48 ms
[2024-05-28 14:47:32] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:47:46] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:47:49] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:47:49] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:47:49] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:47:49] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:47:49] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:47:49] [INFO ] Deduced a trap composed of 71 places in 32 ms of which 1 ms to minimize.
[2024-05-28 14:47:52] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:47:53] [INFO ] Deduced a trap composed of 382 places in 360 ms of which 4 ms to minimize.
[2024-05-28 14:47:53] [INFO ] Deduced a trap composed of 355 places in 299 ms of which 4 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 361 places in 283 ms of which 4 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 386 places in 271 ms of which 4 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 63 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:47:56] [INFO ] Deduced a trap composed of 355 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:47:56] [INFO ] Deduced a trap composed of 340 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:47:57] [INFO ] Deduced a trap composed of 334 places in 333 ms of which 5 ms to minimize.
[2024-05-28 14:47:57] [INFO ] Deduced a trap composed of 126 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:47:57] [INFO ] Deduced a trap composed of 186 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:47:58] [INFO ] Deduced a trap composed of 338 places in 229 ms of which 4 ms to minimize.
[2024-05-28 14:47:58] [INFO ] Deduced a trap composed of 391 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:47:59] [INFO ] Deduced a trap composed of 378 places in 260 ms of which 3 ms to minimize.
[2024-05-28 14:47:59] [INFO ] Deduced a trap composed of 376 places in 271 ms of which 4 ms to minimize.
[2024-05-28 14:47:59] [INFO ] Deduced a trap composed of 362 places in 250 ms of which 3 ms to minimize.
[2024-05-28 14:47:59] [INFO ] Deduced a trap composed of 378 places in 336 ms of which 5 ms to minimize.
[2024-05-28 14:48:00] [INFO ] Deduced a trap composed of 370 places in 287 ms of which 4 ms to minimize.
[2024-05-28 14:48:00] [INFO ] Deduced a trap composed of 396 places in 320 ms of which 5 ms to minimize.
[2024-05-28 14:48:00] [INFO ] Deduced a trap composed of 376 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:48:01] [INFO ] Deduced a trap composed of 370 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:48:01] [INFO ] Deduced a trap composed of 404 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:48:01] [INFO ] Deduced a trap composed of 352 places in 236 ms of which 4 ms to minimize.
[2024-05-28 14:48:01] [INFO ] Deduced a trap composed of 361 places in 323 ms of which 4 ms to minimize.
[2024-05-28 14:48:02] [INFO ] Deduced a trap composed of 399 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:48:02] [INFO ] Deduced a trap composed of 388 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:48:04] [INFO ] Deduced a trap composed of 375 places in 315 ms of which 5 ms to minimize.
[2024-05-28 14:48:05] [INFO ] Deduced a trap composed of 359 places in 267 ms of which 4 ms to minimize.
[2024-05-28 14:48:05] [INFO ] Deduced a trap composed of 444 places in 298 ms of which 3 ms to minimize.
[2024-05-28 14:48:05] [INFO ] Deduced a trap composed of 443 places in 235 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 87 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 37/37 constraints]
After SMT, in 41847ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41858ms
[2024-05-28 14:48:14] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:48:14] [INFO ] Invariant cache hit.
[2024-05-28 14:48:15] [INFO ] Implicit Places using invariants in 369 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 383 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 6 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42269 ms. Remains : 664/690 places, 1290/1306 transitions.
[2024-05-28 14:48:15] [INFO ] Flatten gal took : 30 ms
[2024-05-28 14:48:15] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:48:15] [INFO ] Input system was already deterministic with 1290 transitions.
[2024-05-28 14:48:15] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:48:15] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:48:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10302059265077856115.gal : 4 ms
[2024-05-28 14:48:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1659871426006806436.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/CTLFireability10302059265077856115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1659871426006806436.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 14:48:45] [INFO ] Flatten gal took : 52 ms
[2024-05-28 14:48:45] [INFO ] Applying decomposition
[2024-05-28 14:48:45] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14489877558223942923.txt' '-o' '/tmp/graph14489877558223942923.bin' '-w' '/tmp/graph14489877558223942923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14489877558223942923.bin' '-l' '-1' '-v' '-w' '/tmp/graph14489877558223942923.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:48:45] [INFO ] Decomposing Gal with order
[2024-05-28 14:48:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:48:45] [INFO ] Removed a total of 1097 redundant transitions.
[2024-05-28 14:48:45] [INFO ] Flatten gal took : 105 ms
[2024-05-28 14:48:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 12 ms.
[2024-05-28 14:48:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4253805872739943274.gal : 8 ms
[2024-05-28 14:48:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15515189268542634829.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/CTLFireability4253805872739943274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15515189268542634829.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 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 20 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:49:15] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:49:15] [INFO ] Invariant cache hit.
[2024-05-28 14:49:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:49:27] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:49:27] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:49:27] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 0 ms to minimize.
[2024-05-28 14:49:27] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:49:28] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:49:28] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:49:28] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:49:28] [INFO ] Deduced a trap composed of 380 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:49:28] [INFO ] Deduced a trap composed of 364 places in 237 ms of which 3 ms to minimize.
[2024-05-28 14:49:28] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:49:29] [INFO ] Deduced a trap composed of 367 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:49:29] [INFO ] Deduced a trap composed of 184 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:49:30] [INFO ] Deduced a trap composed of 366 places in 248 ms of which 3 ms to minimize.
[2024-05-28 14:49:30] [INFO ] Deduced a trap composed of 382 places in 233 ms of which 4 ms to minimize.
[2024-05-28 14:49:30] [INFO ] Deduced a trap composed of 395 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:49:31] [INFO ] Deduced a trap composed of 356 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:49:31] [INFO ] Deduced a trap composed of 402 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:49:31] [INFO ] Deduced a trap composed of 353 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:49:31] [INFO ] Deduced a trap composed of 346 places in 250 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:49:39] [INFO ] Deduced a trap composed of 341 places in 248 ms of which 3 ms to minimize.
[2024-05-28 14:49:39] [INFO ] Deduced a trap composed of 380 places in 261 ms of which 3 ms to minimize.
[2024-05-28 14:49:46] [INFO ] Deduced a trap composed of 461 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:49:47] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:49:51] [INFO ] Deduced a trap composed of 350 places in 262 ms of which 4 ms to minimize.
[2024-05-28 14:49:52] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:49:54] [INFO ] Deduced a trap composed of 396 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:49:55] [INFO ] Deduced a trap composed of 371 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 77 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 27/27 constraints]
After SMT, in 41568ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41578ms
[2024-05-28 14:49:57] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:49:57] [INFO ] Invariant cache hit.
[2024-05-28 14:49:57] [INFO ] Implicit Places using invariants in 515 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 529 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 6 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42136 ms. Remains : 664/690 places, 1290/1306 transitions.
[2024-05-28 14:49:58] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:49:58] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:49:58] [INFO ] Input system was already deterministic with 1290 transitions.
[2024-05-28 14:49:58] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:49:58] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:49:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13982909327083463947.gal : 5 ms
[2024-05-28 14:49:58] [INFO ] Time to serialize properties into /tmp/CTLFireability10920478892784718551.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/CTLFireability13982909327083463947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10920478892784718551.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:50:28] [INFO ] Flatten gal took : 68 ms
[2024-05-28 14:50:28] [INFO ] Applying decomposition
[2024-05-28 14:50:28] [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/graph8658716365471536850.txt' '-o' '/tmp/graph8658716365471536850.bin' '-w' '/tmp/graph8658716365471536850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8658716365471536850.bin' '-l' '-1' '-v' '-w' '/tmp/graph8658716365471536850.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:50:28] [INFO ] Decomposing Gal with order
[2024-05-28 14:50:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:50:28] [INFO ] Removed a total of 1022 redundant transitions.
[2024-05-28 14:50:28] [INFO ] Flatten gal took : 99 ms
[2024-05-28 14:50:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 7 ms.
[2024-05-28 14:50:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11898741383035768566.gal : 22 ms
[2024-05-28 14:50:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14777379880137219164.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/CTLFireability11898741383035768566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14777379880137219164.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 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 46 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:50:58] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:50:58] [INFO ] Invariant cache hit.
[2024-05-28 14:50:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 1 ms to minimize.
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 1 ms to minimize.
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:51:11] [INFO ] Deduced a trap composed of 380 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:51:11] [INFO ] Deduced a trap composed of 364 places in 334 ms of which 5 ms to minimize.
[2024-05-28 14:51:11] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:51:12] [INFO ] Deduced a trap composed of 367 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:51:12] [INFO ] Deduced a trap composed of 184 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:51:13] [INFO ] Deduced a trap composed of 366 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:51:13] [INFO ] Deduced a trap composed of 382 places in 260 ms of which 3 ms to minimize.
[2024-05-28 14:51:13] [INFO ] Deduced a trap composed of 395 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:51:13] [INFO ] Deduced a trap composed of 356 places in 245 ms of which 3 ms to minimize.
[2024-05-28 14:51:14] [INFO ] Deduced a trap composed of 402 places in 256 ms of which 3 ms to minimize.
[2024-05-28 14:51:14] [INFO ] Deduced a trap composed of 353 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:51:14] [INFO ] Deduced a trap composed of 346 places in 249 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 7.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 2.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 9.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 4.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 2.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:51:22] [INFO ] Deduced a trap composed of 341 places in 253 ms of which 3 ms to minimize.
[2024-05-28 14:51:23] [INFO ] Deduced a trap composed of 380 places in 247 ms of which 4 ms to minimize.
[2024-05-28 14:51:30] [INFO ] Deduced a trap composed of 461 places in 233 ms of which 3 ms to minimize.
[2024-05-28 14:51:31] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:51:35] [INFO ] Deduced a trap composed of 350 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:51:36] [INFO ] Deduced a trap composed of 69 places in 171 ms of which 2 ms to minimize.
[2024-05-28 14:51:38] [INFO ] Deduced a trap composed of 396 places in 243 ms of which 4 ms to minimize.
[2024-05-28 14:51:38] [INFO ] Deduced a trap composed of 371 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 77 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 27/27 constraints]
After SMT, in 41870ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41888ms
[2024-05-28 14:51:40] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:51:40] [INFO ] Invariant cache hit.
[2024-05-28 14:51:41] [INFO ] Implicit Places using invariants in 380 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 395 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 6 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42340 ms. Remains : 664/690 places, 1290/1306 transitions.
[2024-05-28 14:51:41] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:51:41] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:51:41] [INFO ] Input system was already deterministic with 1290 transitions.
[2024-05-28 14:51:41] [INFO ] Flatten gal took : 46 ms
[2024-05-28 14:51:41] [INFO ] Flatten gal took : 63 ms
[2024-05-28 14:51:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17724858723959418596.gal : 8 ms
[2024-05-28 14:51:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9009022432645788966.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/CTLFireability17724858723959418596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9009022432645788966.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 14:52:11] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:52:11] [INFO ] Applying decomposition
[2024-05-28 14:52:11] [INFO ] Flatten gal took : 31 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/graph7361388237437283942.txt' '-o' '/tmp/graph7361388237437283942.bin' '-w' '/tmp/graph7361388237437283942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7361388237437283942.bin' '-l' '-1' '-v' '-w' '/tmp/graph7361388237437283942.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:52:11] [INFO ] Decomposing Gal with order
[2024-05-28 14:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:52:11] [INFO ] Removed a total of 1207 redundant transitions.
[2024-05-28 14:52:11] [INFO ] Flatten gal took : 66 ms
[2024-05-28 14:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 258 labels/synchronizations in 10 ms.
[2024-05-28 14:52:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16888843839381890390.gal : 6 ms
[2024-05-28 14:52:11] [INFO ] Time to serialize properties into /tmp/CTLFireability14543428166308217357.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/CTLFireability16888843839381890390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14543428166308217357.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 : 690/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 8 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2024-05-28 14:52:41] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-05-28 14:52:41] [INFO ] Computed 54 invariants in 14 ms
[2024-05-28 14:52:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 74 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:52:55] [INFO ] Deduced a trap composed of 370 places in 227 ms of which 4 ms to minimize.
[2024-05-28 14:52:55] [INFO ] Deduced a trap composed of 210 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:52:55] [INFO ] Deduced a trap composed of 188 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:52:56] [INFO ] Deduced a trap composed of 353 places in 255 ms of which 4 ms to minimize.
[2024-05-28 14:52:57] [INFO ] Deduced a trap composed of 373 places in 275 ms of which 3 ms to minimize.
[2024-05-28 14:52:57] [INFO ] Deduced a trap composed of 453 places in 254 ms of which 3 ms to minimize.
[2024-05-28 14:52:57] [INFO ] Deduced a trap composed of 361 places in 248 ms of which 6 ms to minimize.
[2024-05-28 14:52:57] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 65 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 14:53:05] [INFO ] Deduced a trap composed of 356 places in 245 ms of which 4 ms to minimize.
[2024-05-28 14:53:12] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 3 ms to minimize.
[2024-05-28 14:53:17] [INFO ] Deduced a trap composed of 346 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:53:17] [INFO ] Deduced a trap composed of 354 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:53:17] [INFO ] Deduced a trap composed of 327 places in 237 ms of which 3 ms to minimize.
[2024-05-28 14:53:18] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:53:18] [INFO ] Deduced a trap composed of 47 places in 279 ms of which 4 ms to minimize.
[2024-05-28 14:53:19] [INFO ] Deduced a trap composed of 379 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:53:19] [INFO ] Deduced a trap composed of 372 places in 244 ms of which 4 ms to minimize.
[2024-05-28 14:53:20] [INFO ] Deduced a trap composed of 369 places in 230 ms of which 4 ms to minimize.
[2024-05-28 14:53:20] [INFO ] Deduced a trap composed of 361 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:53:20] [INFO ] Deduced a trap composed of 349 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:53:22] [INFO ] Deduced a trap composed of 378 places in 235 ms of which 4 ms to minimize.
[2024-05-28 14:53:23] [INFO ] Deduced a trap composed of 406 places in 236 ms of which 4 ms to minimize.
[2024-05-28 14:53:23] [INFO ] Deduced a trap composed of 407 places in 266 ms of which 3 ms to minimize.
[2024-05-28 14:53:23] [INFO ] Deduced a trap composed of 385 places in 278 ms of which 4 ms to minimize.
SMT process timed out in 42014ms, After SMT, problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 42025ms
[2024-05-28 14:53:23] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-28 14:53:23] [INFO ] Invariant cache hit.
[2024-05-28 14:53:24] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-28 14:53:24] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-28 14:53:24] [INFO ] Invariant cache hit.
[2024-05-28 14:53:24] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:53:30] [INFO ] Implicit Places using invariants and state equation in 6380 ms returned []
Implicit Place search using SMT with State Equation took 6758 ms to find 0 implicit places.
Running 1304 sub problems to find dead transitions.
[2024-05-28 14:53:30] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-28 14:53:30] [INFO ] Invariant cache hit.
[2024-05-28 14:53:30] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 14:53:42] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-28 14:53:42] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:53:42] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:53:42] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:53:42] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 0 ms to minimize.
[2024-05-28 14:53:43] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:53:43] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:53:43] [INFO ] Deduced a trap composed of 361 places in 230 ms of which 8 ms to minimize.
[2024-05-28 14:53:43] [INFO ] Deduced a trap composed of 340 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:53:44] [INFO ] Deduced a trap composed of 206 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:53:44] [INFO ] Deduced a trap composed of 382 places in 216 ms of which 4 ms to minimize.
[2024-05-28 14:53:44] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:53:45] [INFO ] Deduced a trap composed of 378 places in 231 ms of which 4 ms to minimize.
[2024-05-28 14:53:45] [INFO ] Deduced a trap composed of 372 places in 253 ms of which 3 ms to minimize.
[2024-05-28 14:53:45] [INFO ] Deduced a trap composed of 387 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:53:46] [INFO ] Deduced a trap composed of 379 places in 256 ms of which 4 ms to minimize.
[2024-05-28 14:53:46] [INFO ] Deduced a trap composed of 379 places in 249 ms of which 4 ms to minimize.
[2024-05-28 14:53:53] [INFO ] Deduced a trap composed of 489 places in 276 ms of which 3 ms to minimize.
[2024-05-28 14:53:53] [INFO ] Deduced a trap composed of 462 places in 294 ms of which 4 ms to minimize.
[2024-05-28 14:53:54] [INFO ] Deduced a trap composed of 463 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 14:53:55] [INFO ] Deduced a trap composed of 343 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:54:01] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:54:01] [INFO ] Deduced a trap composed of 349 places in 238 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 9.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 10.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 6.0)
(s607 0.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 73 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 23/73 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 14:54:04] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:54:08] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:54:16] [INFO ] Deduced a trap composed of 352 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:54:17] [INFO ] Deduced a trap composed of 357 places in 269 ms of which 3 ms to minimize.
[2024-05-28 14:54:17] [INFO ] Deduced a trap composed of 366 places in 287 ms of which 4 ms to minimize.
[2024-05-28 14:54:18] [INFO ] Deduced a trap composed of 368 places in 240 ms of which 4 ms to minimize.
[2024-05-28 14:54:18] [INFO ] Deduced a trap composed of 353 places in 233 ms of which 4 ms to minimize.
[2024-05-28 14:54:19] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 3 ms to minimize.
[2024-05-28 14:54:21] [INFO ] Deduced a trap composed of 407 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:54:21] [INFO ] Deduced a trap composed of 379 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1980 variables, and 83 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 33/33 constraints]
After SMT, in 61529ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 61543ms
Finished structural reductions in LTL mode , in 1 iterations and 110340 ms. Remains : 690/690 places, 1306/1306 transitions.
[2024-05-28 14:54:32] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:54:32] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:54:32] [INFO ] Input system was already deterministic with 1306 transitions.
[2024-05-28 14:54:32] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:54:32] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:54:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15312543891653838045.gal : 5 ms
[2024-05-28 14:54:32] [INFO ] Time to serialize properties into /tmp/CTLFireability465338170849579898.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/CTLFireability15312543891653838045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability465338170849579898.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:55:02] [INFO ] Flatten gal took : 71 ms
[2024-05-28 14:55:02] [INFO ] Applying decomposition
[2024-05-28 14:55:02] [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/graph14051783996976721400.txt' '-o' '/tmp/graph14051783996976721400.bin' '-w' '/tmp/graph14051783996976721400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14051783996976721400.bin' '-l' '-1' '-v' '-w' '/tmp/graph14051783996976721400.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:55:02] [INFO ] Decomposing Gal with order
[2024-05-28 14:55:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:55:02] [INFO ] Removed a total of 1022 redundant transitions.
[2024-05-28 14:55:02] [INFO ] Flatten gal took : 106 ms
[2024-05-28 14:55:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 11 ms.
[2024-05-28 14:55:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17431151336984260186.gal : 9 ms
[2024-05-28 14:55:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14982211489355690766.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/CTLFireability17431151336984260186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14982211489355690766.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 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Applied a total of 18 rules in 13 ms. Remains 680 /690 variables (removed 10) and now considering 1298/1306 (removed 8) transitions.
Running 1296 sub problems to find dead transitions.
[2024-05-28 14:55:32] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 680 cols
[2024-05-28 14:55:33] [INFO ] Computed 52 invariants in 36 ms
[2024-05-28 14:55:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-28 14:55:45] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:55:46] [INFO ] Deduced a trap composed of 96 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:55:46] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:55:47] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:55:47] [INFO ] Deduced a trap composed of 73 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:55:47] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 2 ms to minimize.
[2024-05-28 14:55:47] [INFO ] Deduced a trap composed of 69 places in 231 ms of which 2 ms to minimize.
[2024-05-28 14:55:47] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:55:47] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:55:52] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:55:53] [INFO ] Deduced a trap composed of 360 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:55:54] [INFO ] Deduced a trap composed of 344 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:55:54] [INFO ] Deduced a trap composed of 123 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:55:54] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 4 ms to minimize.
SMT process timed out in 21588ms, After SMT, problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 21600ms
[2024-05-28 14:55:54] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-05-28 14:55:54] [INFO ] Invariant cache hit.
[2024-05-28 14:55:54] [INFO ] Implicit Places using invariants in 319 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 334 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 672/690 places, 1298/1306 transitions.
Applied a total of 0 rules in 6 ms. Remains 672 /672 variables (removed 0) and now considering 1298/1298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21955 ms. Remains : 672/690 places, 1298/1306 transitions.
[2024-05-28 14:55:54] [INFO ] Flatten gal took : 29 ms
[2024-05-28 14:55:54] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:55:55] [INFO ] Input system was already deterministic with 1298 transitions.
[2024-05-28 14:55:55] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:55:55] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:55:55] [INFO ] Time to serialize gal into /tmp/CTLFireability7283729831663922771.gal : 5 ms
[2024-05-28 14:55:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1402167066808225491.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/CTLFireability7283729831663922771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1402167066808225491.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:56:25] [INFO ] Flatten gal took : 74 ms
[2024-05-28 14:56:25] [INFO ] Applying decomposition
[2024-05-28 14:56:25] [INFO ] Flatten gal took : 53 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/graph14760886341583725890.txt' '-o' '/tmp/graph14760886341583725890.bin' '-w' '/tmp/graph14760886341583725890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14760886341583725890.bin' '-l' '-1' '-v' '-w' '/tmp/graph14760886341583725890.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:56:25] [INFO ] Decomposing Gal with order
[2024-05-28 14:56:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:56:25] [INFO ] Removed a total of 1305 redundant transitions.
[2024-05-28 14:56:25] [INFO ] Flatten gal took : 95 ms
[2024-05-28 14:56:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 6 ms.
[2024-05-28 14:56:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17239002328817758209.gal : 9 ms
[2024-05-28 14:56:25] [INFO ] Time to serialize properties into /tmp/CTLFireability11787322785070895492.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17239002328817758209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11787322785070895492.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.
[2024-05-28 14:56:55] [INFO ] Flatten gal took : 75 ms
[2024-05-28 14:56:55] [INFO ] Flatten gal took : 39 ms
[2024-05-28 14:56:55] [INFO ] Applying decomposition
[2024-05-28 14:56:55] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11906134779331855982.txt' '-o' '/tmp/graph11906134779331855982.bin' '-w' '/tmp/graph11906134779331855982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11906134779331855982.bin' '-l' '-1' '-v' '-w' '/tmp/graph11906134779331855982.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:56:56] [INFO ] Decomposing Gal with order
[2024-05-28 14:56:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:56:56] [INFO ] Removed a total of 980 redundant transitions.
[2024-05-28 14:56:56] [INFO ] Flatten gal took : 111 ms
[2024-05-28 14:56:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 251 labels/synchronizations in 14 ms.
[2024-05-28 14:56:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2545736235249915558.gal : 10 ms
[2024-05-28 14:56:56] [INFO ] Time to serialize properties into /tmp/CTLFireability3432593710308047101.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/CTLFireability2545736235249915558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3432593710308047101.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 15:03:13] [INFO ] Applying decomposition
[2024-05-28 15:03:13] [INFO ] Flatten gal took : 60 ms
[2024-05-28 15:03:13] [INFO ] Decomposing Gal with order
[2024-05-28 15:03:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:03:13] [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],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[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],[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],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[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],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50, ScheduleTaskE_Work_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51, ScheduleTaskE_Work_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52, ScheduleTaskE_Work_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53, ScheduleTaskE_Work_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54, ScheduleTaskE_Work_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55, ScheduleTaskE_Work_55],[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],

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 15:03:14] [INFO ] Flatten gal took : 59 ms
[2024-05-28 15:03:14] [INFO ] Time to serialize gal into /tmp/CTLFireability308502516252053276.gal : 7 ms
[2024-05-28 15:03:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1449213640407545459.ctl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability308502516252053276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1449213640407545459.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 15:09:30] [INFO ] Flatten gal took : 45 ms
[2024-05-28 15:09:30] [INFO ] Input system was already deterministic with 1306 transitions.
[2024-05-28 15:09:30] [INFO ] Transformed 690 places.
[2024-05-28 15:09:30] [INFO ] Transformed 1306 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 15:10:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10849019354590244068.gal : 9 ms
[2024-05-28 15:10:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8157109017892022885.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/CTLFireability10849019354590244068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8157109017892022885.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2965989 ms.

BK_STOP 1716909379858

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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