Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r312-tall-171662339400826.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ResAllocation-PT-R003C050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662339400826
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 23:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 23:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 23:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 360K 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 ResAllocation-PT-R003C050-CTLFireability-2024-00
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-01
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-02
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-03
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-04
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-05
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-06
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-07
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-08
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-09
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-10
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2024-11
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2023-12
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2023-13
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2023-14
FORMULA_NAME ResAllocation-PT-R003C050-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716717061202

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-26 09:51:02] [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-26 09:51:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 09:51:02] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-26 09:51:02] [INFO ] Transformed 300 places.
[2024-05-26 09:51:02] [INFO ] Transformed 200 transitions.
[2024-05-26 09:51:02] [INFO ] Found NUPN structural information;
[2024-05-26 09:51:02] [INFO ] Parsed PT model containing 300 places and 200 transitions and 894 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 129 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 18 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2024-05-26 09:51:02] [INFO ] Computed 150 invariants in 18 ms
[2024-05-26 09:51:03] [INFO ] Implicit Places using invariants in 350 ms returned [295, 297, 299]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 381 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/300 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 424 ms. Remains : 297/300 places, 200/200 transitions.
Support contains 129 out of 297 places after structural reductions.
[2024-05-26 09:51:03] [INFO ] Flatten gal took : 47 ms
[2024-05-26 09:51:03] [INFO ] Flatten gal took : 25 ms
[2024-05-26 09:51:03] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 124 out of 297 places (down from 129) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 61 to 57
RANDOM walk for 40000 steps (379 resets) in 2611 ms. (15 steps per ms) remains 2/57 properties
BEST_FIRST walk for 40004 steps (10 resets) in 211 ms. (188 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
// Phase 1: matrix 200 rows 297 cols
[2024-05-26 09:51:04] [INFO ] Computed 147 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp54 is UNSAT
After SMT solving in domain Real declared 7/497 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 47 ms.
Refiners :[Domain max(s): 3/297 constraints, Positive P Invariants (semi-flows): 3/147 constraints, State Equation: 0/297 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-26 09:51:04] [INFO ] Flatten gal took : 17 ms
[2024-05-26 09:51:04] [INFO ] Flatten gal took : 17 ms
[2024-05-26 09:51:04] [INFO ] Input system was already deterministic with 200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 16 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-26 09:51:04] [INFO ] Invariant cache hit.
[2024-05-26 09:51:04] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-26 09:51:04] [INFO ] Invariant cache hit.
[2024-05-26 09:51:05] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 09:51:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:51:06] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 11 ms to minimize.
[2024-05-26 09:51:06] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 09:51:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:51:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:51:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
[2024-05-26 09:51:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:51:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:51:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:51:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:51:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 5 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:51:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:51:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 09:51:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:51:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:51:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:51:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:51:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:51:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:51:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 09:51:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:51:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:51:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:51:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:51:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
[2024-05-26 09:51:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
[2024-05-26 09:51:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
[2024-05-26 09:51:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:51:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 09:51:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:51:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:51:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:51:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10964 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:51:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:51:22] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 16980 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27997ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27999ms
Finished structural reductions in LTL mode , in 1 iterations and 28853 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 09:51:33] [INFO ] Flatten gal took : 15 ms
[2024-05-26 09:51:33] [INFO ] Flatten gal took : 14 ms
[2024-05-26 09:51:33] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 09:51:33] [INFO ] Flatten gal took : 11 ms
[2024-05-26 09:51:33] [INFO ] Flatten gal took : 11 ms
[2024-05-26 09:51:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1955485373487591986.gal : 6 ms
[2024-05-26 09:51:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4626026094678885791.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/CTLFireability1955485373487591986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4626026094678885791.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-26 09:52:03] [INFO ] Flatten gal took : 12 ms
[2024-05-26 09:52:03] [INFO ] Applying decomposition
[2024-05-26 09:52:03] [INFO ] Flatten gal took : 12 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/graph13363666541215229624.txt' '-o' '/tmp/graph13363666541215229624.bin' '-w' '/tmp/graph13363666541215229624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13363666541215229624.bin' '-l' '-1' '-v' '-w' '/tmp/graph13363666541215229624.weights' '-q' '0' '-e' '0.001'
[2024-05-26 09:52:03] [INFO ] Decomposing Gal with order
[2024-05-26 09:52:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 09:52:03] [INFO ] Flatten gal took : 49 ms
[2024-05-26 09:52:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-26 09:52:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8691106994836984205.gal : 8 ms
[2024-05-26 09:52:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11310729256021076786.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/CTLFireability8691106994836984205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11310729256021076786.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.354122,21552,4404,147,43831,926,761,60976,79,2523,0


Converting to forward existential form...Done !
original formula: AG(AX(((((i7.i0.i0.u94.r_36_0==0)||(i7.i0.i0.u97.r_37_0==0))||((i7.i0.i1.u95.p_37_1==0)||(i5.u67.p_26_2==0)))||((i1.u13.r_4_2==1)&&(i1.u1...170
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((((i7.i0.i0.u94.r_36_0==0)||(i7.i0.i0.u97.r_37_0==0))||((i7.i0.i1.u95.p_37_1==0)||(i5...224
(forward)formula 0,0,0.495749,21804,1,0,43831,926,1150,77880,124,2523,62906
FORMULA ResAllocation-PT-R003C050-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-26 09:52:04] [INFO ] Invariant cache hit.
[2024-05-26 09:52:04] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-26 09:52:04] [INFO ] Invariant cache hit.
[2024-05-26 09:52:04] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 09:52:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:52:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:52:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:52:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:52:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:52:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:52:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:52:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:52:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:52:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:52:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:52:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:52:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:52:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:52:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:52:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:52:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:52:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:52:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:52:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:52:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:52:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:52:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:52:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10587 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:52:18] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:52:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17142 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27756ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27762ms
Finished structural reductions in LTL mode , in 1 iterations and 28232 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 09:52:32] [INFO ] Flatten gal took : 11 ms
[2024-05-26 09:52:32] [INFO ] Flatten gal took : 10 ms
[2024-05-26 09:52:32] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 09:52:32] [INFO ] Flatten gal took : 10 ms
[2024-05-26 09:52:32] [INFO ] Flatten gal took : 10 ms
[2024-05-26 09:52:32] [INFO ] Time to serialize gal into /tmp/CTLFireability8225785622849142925.gal : 2 ms
[2024-05-26 09:52:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4415743594573558181.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/CTLFireability8225785622849142925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4415743594573558181.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-26 09:53:02] [INFO ] Flatten gal took : 11 ms
[2024-05-26 09:53:02] [INFO ] Applying decomposition
[2024-05-26 09:53:02] [INFO ] Flatten gal took : 13 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/graph7709648263163649989.txt' '-o' '/tmp/graph7709648263163649989.bin' '-w' '/tmp/graph7709648263163649989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7709648263163649989.bin' '-l' '-1' '-v' '-w' '/tmp/graph7709648263163649989.weights' '-q' '0' '-e' '0.001'
[2024-05-26 09:53:02] [INFO ] Decomposing Gal with order
[2024-05-26 09:53:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 09:53:02] [INFO ] Flatten gal took : 16 ms
[2024-05-26 09:53:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 09:53:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7917907823711519650.gal : 5 ms
[2024-05-26 09:53:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5748809285900105560.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/CTLFireability7917907823711519650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5748809285900105560.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.363276,20508,3068,196,42254,996,789,56412,100,3012,0


Converting to forward existential form...Done !
original formula: EF(AX((A((((i8.i0.u99.r_45_1==1)&&(i8.i0.u98.p_46_0==1))&&(i8.i2.u103.r_46_1==1)) U (i7.i0.u76.p_34_2==1)) + (((i4.i0.u45.r_21_1==1)&&(i4...201
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!((E(!((i7.i0.u76.p_34_2==1)) U (!((((i8.i0.u99.r_45_1==1)&&(i8.i0.u98.p_46_0==1))&&...330
Reverse transition relation is NOT exact ! Due to transitions t20, t67, t84, t100, t115, t132, t156, t172, i0.t12, i0.t11, i0.i0.t4, i0.i0.u2.t3, i0.i2.t19...696
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 258 transition count 161
Applied a total of 78 rules in 39 ms. Remains 258 /297 variables (removed 39) and now considering 161/200 (removed 39) transitions.
// Phase 1: matrix 161 rows 258 cols
[2024-05-26 09:53:32] [INFO ] Computed 147 invariants in 1 ms
[2024-05-26 09:53:32] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-26 09:53:32] [INFO ] Invariant cache hit.
[2024-05-26 09:53:33] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-26 09:53:33] [INFO ] Redundant transitions in 4 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-26 09:53:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 147/405 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-26 09:53:33] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 09:53:33] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:53:33] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-26 09:53:33] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:53:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:53:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:53:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:53:34] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 09:53:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 09:53:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:53:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 11/416 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 161/419 variables, 258/674 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 0/419 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 674 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4506 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 147/405 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 11/416 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 161/419 variables, 258/674 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 111/785 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/419 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 785 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4512 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 11/11 constraints]
After SMT, in 9067ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 9076ms
Starting structural reductions in SI_CTL mode, iteration 1 : 258/297 places, 161/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9488 ms. Remains : 258/297 places, 161/200 transitions.
[2024-05-26 09:53:42] [INFO ] Flatten gal took : 8 ms
[2024-05-26 09:53:42] [INFO ] Flatten gal took : 6 ms
[2024-05-26 09:53:42] [INFO ] Input system was already deterministic with 161 transitions.
[2024-05-26 09:53:42] [INFO ] Flatten gal took : 7 ms
[2024-05-26 09:53:42] [INFO ] Flatten gal took : 6 ms
[2024-05-26 09:53:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3140483977783582805.gal : 3 ms
[2024-05-26 09:53:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4423334671731379975.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/CTLFireability3140483977783582805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4423334671731379975.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84004e+26,0.542712,23860,2,24532,5,110370,6,0,1196,89893,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-26 09:54:12] [INFO ] Flatten gal took : 7 ms
[2024-05-26 09:54:12] [INFO ] Applying decomposition
[2024-05-26 09:54:12] [INFO ] Flatten gal took : 6 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/graph4472361108107225390.txt' '-o' '/tmp/graph4472361108107225390.bin' '-w' '/tmp/graph4472361108107225390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4472361108107225390.bin' '-l' '-1' '-v' '-w' '/tmp/graph4472361108107225390.weights' '-q' '0' '-e' '0.001'
[2024-05-26 09:54:12] [INFO ] Decomposing Gal with order
[2024-05-26 09:54:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 09:54:12] [INFO ] Flatten gal took : 10 ms
[2024-05-26 09:54:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 09:54:12] [INFO ] Time to serialize gal into /tmp/CTLFireability14733923443580892331.gal : 3 ms
[2024-05-26 09:54:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3872656809862883940.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/CTLFireability14733923443580892331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3872656809862883940.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84004e+26,0.05901,5856,462,100,3400,442,617,2996,119,993,0


Converting to forward existential form...Done !
original formula: A(!((EG(((AG((((i10.u60.r_46_0==1)&&(i10.u62.r_47_0==1))&&(i10.u61.p_47_1==1))) + !(E(((i5.i0.u33.r_24_2==1)&&(i5.i1.u34.r_25_2==1)) U ((...675
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(!((((i8.u50.r_38_0==1)&&(i8.u52.r_39_0==1))&&(i8.u51.p_39_1==1))) U (!(E(TRUE...1515
Reverse transition relation is NOT exact ! Due to transitions t46, t125, t136, t138, t139, t151, t158, i0.t124, i0.t123, i0.t13, i0.t7, i3.t135, i3.i0.t34,...397
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 0 with 90 rules applied. Total rules applied 90 place count 252 transition count 155
Applied a total of 90 rules in 49 ms. Remains 252 /297 variables (removed 45) and now considering 155/200 (removed 45) transitions.
// Phase 1: matrix 155 rows 252 cols
[2024-05-26 09:54:42] [INFO ] Computed 147 invariants in 1 ms
[2024-05-26 09:54:42] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-26 09:54:42] [INFO ] Invariant cache hit.
[2024-05-26 09:54:42] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-26 09:54:42] [INFO ] Redundant transitions in 4 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-26 09:54:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 147/399 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-26 09:54:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:54:43] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:54:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:54:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:54:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 5/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 155/407 variables, 252/656 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/407 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 656 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3946 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 147/399 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 5/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 155/407 variables, 252/656 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 105/761 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-26 09:54:49] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/407 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/407 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 762 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6259 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 6/6 constraints]
After SMT, in 10222ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 10223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 252/297 places, 155/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10675 ms. Remains : 252/297 places, 155/200 transitions.
[2024-05-26 09:54:53] [INFO ] Flatten gal took : 9 ms
[2024-05-26 09:54:53] [INFO ] Flatten gal took : 10 ms
[2024-05-26 09:54:53] [INFO ] Input system was already deterministic with 155 transitions.
[2024-05-26 09:54:53] [INFO ] Flatten gal took : 5 ms
[2024-05-26 09:54:53] [INFO ] Flatten gal took : 5 ms
[2024-05-26 09:54:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2600777346590207061.gal : 1 ms
[2024-05-26 09:54:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17931296550127591493.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/CTLFireability2600777346590207061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17931296550127591493.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.46688e+25,0.121377,6948,2,4222,5,17180,6,0,1166,13948,0


Converting to forward existential form...Done !
original formula: EG(EF(!(A((AG(((r_43_0==1)&&(r_44_0==1))) * E(((r_14_2==1)&&(r_15_2==1)) U (((r_20_0==1)&&(r_21_0==1))&&(p_21_1==1)))) U AF((((r_5_1==1)&...185
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(!((E(!(!(EG(!((((r_5_1==1)&&(p_6_0==1))&&(r_6_1==1)))))) U (!((!(E(TRUE U !(((r_43_0==1)&&...377
Reverse transition relation is NOT exact ! Due to transitions t31, t37, t46, t92, t98, t123, t124, t125, t128, t129, t149, t150, t151, Intersection with r...235
Detected timeout of ITS tools.
[2024-05-26 09:55:23] [INFO ] Flatten gal took : 9 ms
[2024-05-26 09:55:23] [INFO ] Applying decomposition
[2024-05-26 09:55:23] [INFO ] Flatten gal took : 6 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/graph7352650548791522072.txt' '-o' '/tmp/graph7352650548791522072.bin' '-w' '/tmp/graph7352650548791522072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7352650548791522072.bin' '-l' '-1' '-v' '-w' '/tmp/graph7352650548791522072.weights' '-q' '0' '-e' '0.001'
[2024-05-26 09:55:23] [INFO ] Decomposing Gal with order
[2024-05-26 09:55:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 09:55:23] [INFO ] Flatten gal took : 25 ms
[2024-05-26 09:55:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-26 09:55:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12474548074478828015.gal : 12 ms
[2024-05-26 09:55:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1728537422611759282.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/CTLFireability12474548074478828015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1728537422611759282.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.46688e+25,0.056728,5820,324,59,2558,298,633,2172,102,576,0


Converting to forward existential form...Done !
original formula: EG(EF(!(A((AG(((i9.i0.u50.r_43_0==1)&&(i9.i1.u52.r_44_0==1))) * E(((i2.i1.u19.r_14_2==1)&&(i3.i0.u20.r_15_2==1)) U (((i4.u23.r_20_0==1)&&...273
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(!((E(!(!(EG(!((((i1.i0.u6.r_5_1==1)&&(i1.i0.u7.p_6_0==1))&&(i1.i0.u7.r_6_1==1)))))) U (!((...519
Reverse transition relation is NOT exact ! Due to transitions t124, t128, t151, i2.t123, i2.i1.t31, i3.t125, i3.i0.t37, i4.t129, i4.t46, i9.t150, i9.i0.t92...280
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 12 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2024-05-26 09:55:53] [INFO ] Computed 147 invariants in 2 ms
[2024-05-26 09:55:53] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-26 09:55:53] [INFO ] Invariant cache hit.
[2024-05-26 09:55:53] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 09:55:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:55:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:55:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:55:54] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:55:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:55:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:55:54] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:55:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:55:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:55:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:55:56] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:55:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:55:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:55:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:55:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:55:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:55:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:55:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:55:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10605 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:56:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:56:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17220 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27850ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27852ms
Finished structural reductions in LTL mode , in 1 iterations and 28304 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 09:56:21] [INFO ] Flatten gal took : 13 ms
[2024-05-26 09:56:21] [INFO ] Flatten gal took : 9 ms
[2024-05-26 09:56:21] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 09:56:21] [INFO ] Flatten gal took : 7 ms
[2024-05-26 09:56:21] [INFO ] Flatten gal took : 8 ms
[2024-05-26 09:56:21] [INFO ] Time to serialize gal into /tmp/CTLFireability15606047784700552028.gal : 2 ms
[2024-05-26 09:56:21] [INFO ] Time to serialize properties into /tmp/CTLFireability17623168104489387862.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/CTLFireability15606047784700552028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17623168104489387862.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-26 09:56:51] [INFO ] Flatten gal took : 7 ms
[2024-05-26 09:56:51] [INFO ] Applying decomposition
[2024-05-26 09:56:51] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10139773204376243719.txt' '-o' '/tmp/graph10139773204376243719.bin' '-w' '/tmp/graph10139773204376243719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10139773204376243719.bin' '-l' '-1' '-v' '-w' '/tmp/graph10139773204376243719.weights' '-q' '0' '-e' '0.001'
[2024-05-26 09:56:51] [INFO ] Decomposing Gal with order
[2024-05-26 09:56:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 09:56:51] [INFO ] Flatten gal took : 13 ms
[2024-05-26 09:56:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 09:56:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6015901189098914000.gal : 4 ms
[2024-05-26 09:56:51] [INFO ] Time to serialize properties into /tmp/CTLFireability5667882920066987559.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/CTLFireability6015901189098914000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5667882920066987559.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.544388,27972,4561,141,61278,790,637,87299,84,1995,0


Converting to forward existential form...Done !
original formula: (!(E(EG((((i7.u92.r_38_1==1)&&(i7.u92.r_39_1==1))&&(i7.u92.p_39_2==1))) U EG(EF(!((((i2.u20.r_7_2==1)&&(i2.u19.p_8_1==1))&&(i2.u23.r_8_2=...475
=> equivalent forward existential formula: ([FwdG(FwdU(Init,EG((((i7.u92.r_38_1==1)&&(i7.u92.r_39_1==1))&&(i7.u92.p_39_2==1)))),E(TRUE U !((((i2.u20.r_7_2=...568
Reverse transition relation is NOT exact ! Due to transitions t51, t100, t147, t163, t164, t180, t187, i0.t12, i0.t11, i0.t4, i0.u2.t3, i1.t28, i1.t27, i1....617
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-26 09:57:22] [INFO ] Invariant cache hit.
[2024-05-26 09:57:22] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-26 09:57:22] [INFO ] Invariant cache hit.
[2024-05-26 09:57:22] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 09:57:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:57:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:57:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:57:25] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 09:57:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:57:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 09:57:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:57:28] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:57:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:57:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10366 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:57:35] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:57:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17122 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27512ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27514ms
Finished structural reductions in LTL mode , in 1 iterations and 27960 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 09:57:49] [INFO ] Flatten gal took : 9 ms
[2024-05-26 09:57:49] [INFO ] Flatten gal took : 6 ms
[2024-05-26 09:57:49] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 09:57:50] [INFO ] Flatten gal took : 7 ms
[2024-05-26 09:57:50] [INFO ] Flatten gal took : 6 ms
[2024-05-26 09:57:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12148969845443796656.gal : 2 ms
[2024-05-26 09:57:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9496888654520056154.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/CTLFireability12148969845443796656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9496888654520056154.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-26 09:58:20] [INFO ] Flatten gal took : 12 ms
[2024-05-26 09:58:20] [INFO ] Applying decomposition
[2024-05-26 09:58:20] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5333987529252108226.txt' '-o' '/tmp/graph5333987529252108226.bin' '-w' '/tmp/graph5333987529252108226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5333987529252108226.bin' '-l' '-1' '-v' '-w' '/tmp/graph5333987529252108226.weights' '-q' '0' '-e' '0.001'
[2024-05-26 09:58:20] [INFO ] Decomposing Gal with order
[2024-05-26 09:58:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 09:58:20] [INFO ] Flatten gal took : 17 ms
[2024-05-26 09:58:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 09:58:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3448304874724794045.gal : 3 ms
[2024-05-26 09:58:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13671771625171002669.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/CTLFireability3448304874724794045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13671771625171002669.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.388634,21876,4292,76,48276,529,633,55473,69,1458,0


Converting to forward existential form...Done !
original formula: AX(AF((((i1.u15.r_5_1==1)&&(i1.u14.p_6_0==1)) * ((i1.u16.r_6_1==1) * ((!(A(((i6.i1.i1.u87.r_37_0==1)&&(i6.i1.i1.u89.r_38_0==1)) U ((i5.u7...391
=> equivalent forward existential formula: [FwdG(EY(Init),!((((i1.u15.r_5_1==1)&&(i1.u14.p_6_0==1)) * ((i1.u16.r_6_1==1) * ((!(!((E(!(((i5.u72.r_29_0==1)&&...650
Reverse transition relation is NOT exact ! Due to transitions t20, t43, t60, t84, t108, t115, t124, t131, t179, i0.t19, i0.t12, i0.t11, i0.t4, i0.u2.t3, i1...627
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-26 09:58:50] [INFO ] Invariant cache hit.
[2024-05-26 09:58:50] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-26 09:58:50] [INFO ] Invariant cache hit.
[2024-05-26 09:58:50] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 09:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:58:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:58:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:58:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:58:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:58:53] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:58:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:58:53] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 09:58:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:58:53] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 09:58:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:58:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:58:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:58:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:58:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:58:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 09:58:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:58:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:58:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 09:58:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:58:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:58:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 09:58:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 09:58:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10593 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:59:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 09:59:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17223 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27842ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27843ms
Finished structural reductions in LTL mode , in 1 iterations and 28278 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 09:59:18] [INFO ] Flatten gal took : 7 ms
[2024-05-26 09:59:18] [INFO ] Flatten gal took : 6 ms
[2024-05-26 09:59:18] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 09:59:18] [INFO ] Flatten gal took : 7 ms
[2024-05-26 09:59:18] [INFO ] Flatten gal took : 6 ms
[2024-05-26 09:59:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10678930785209278240.gal : 2 ms
[2024-05-26 09:59:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6387940497989110573.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/CTLFireability10678930785209278240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6387940497989110573.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-26 09:59:48] [INFO ] Flatten gal took : 14 ms
[2024-05-26 09:59:48] [INFO ] Applying decomposition
[2024-05-26 09:59:48] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1455040011186075200.txt' '-o' '/tmp/graph1455040011186075200.bin' '-w' '/tmp/graph1455040011186075200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1455040011186075200.bin' '-l' '-1' '-v' '-w' '/tmp/graph1455040011186075200.weights' '-q' '0' '-e' '0.001'
[2024-05-26 09:59:48] [INFO ] Decomposing Gal with order
[2024-05-26 09:59:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 09:59:48] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-26 09:59:48] [INFO ] Flatten gal took : 72 ms
[2024-05-26 09:59:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 09:59:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13567312865805499188.gal : 12 ms
[2024-05-26 09:59:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3867109593380995548.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/CTLFireability13567312865805499188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3867109593380995548.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.390343,22436,4556,174,43696,892,630,69514,81,2232,0


Converting to forward existential form...Done !
original formula: EF(((AX(EX((((i4.u50.r_18_0==1)&&(i4.u54.r_19_0==1))&&(i4.u51.p_19_1==1)))) * AF(E((((i2.u30.r_9_1==1)&&(i2.u29.p_10_0==1))&&(i2.u31.r_10...295
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((i2.u27.r_9_0==1)&&(i2.u29.r_10_0==1))) * !(EX(!(EX((((i4.u50.r_18_0==1)&&(i4.u54.r_19_0=...359
Reverse transition relation is NOT exact ! Due to transitions t19, t52, t68, t75, t84, t115, t131, t140, t171, i0.t12, i0.t11, i0.t4, i0.u2.t3, i1.t27, i1....618
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-26 10:00:18] [INFO ] Invariant cache hit.
[2024-05-26 10:00:19] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-26 10:00:19] [INFO ] Invariant cache hit.
[2024-05-26 10:00:19] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 10:00:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:00:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:00:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:00:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:00:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-26 10:00:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:00:24] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:00:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:00:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:00:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:00:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:00:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:00:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:00:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:00:24] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:00:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:00:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:00:25] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:00:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:00:25] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10259 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:00:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:00:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 16788 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27092ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27093ms
Finished structural reductions in LTL mode , in 1 iterations and 27622 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 10:00:46] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:00:46] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:00:46] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 10:00:46] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:00:46] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:00:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11225190217423222747.gal : 12 ms
[2024-05-26 10:00:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12263915783820625689.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/CTLFireability11225190217423222747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12263915783820625689.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-26 10:01:16] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:01:16] [INFO ] Applying decomposition
[2024-05-26 10:01:16] [INFO ] Flatten gal took : 6 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/graph2723081966151434600.txt' '-o' '/tmp/graph2723081966151434600.bin' '-w' '/tmp/graph2723081966151434600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2723081966151434600.bin' '-l' '-1' '-v' '-w' '/tmp/graph2723081966151434600.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:01:16] [INFO ] Decomposing Gal with order
[2024-05-26 10:01:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:01:16] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:01:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:01:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5895108153334182418.gal : 3 ms
[2024-05-26 10:01:16] [INFO ] Time to serialize properties into /tmp/CTLFireability6205892473712633814.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/CTLFireability5895108153334182418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6205892473712633814.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.478651,25392,4530,69,53407,523,632,79808,61,1331,0


Converting to forward existential form...Done !
original formula: E(((i1.u24.r_9_0==1)&&(i2.u26.r_10_0==1)) U AG(!(AX((((i8.u102.p_40_2==1)||(i8.u101.p_41_0==1)) * EX((i6.i0.i1.u79.p_32_2==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,((i1.u24.r_9_0==1)&&(i2.u26.r_10_0==1))) * !(E(TRUE U !(!(!(EX(!((((i8.u102.p_40_2==1)||(i8.u101.p_4...213
Reverse transition relation is NOT exact ! Due to transitions t20, t76, t91, t92, t108, t147, t179, i0.t19, i0.t12, i0.t11, i0.t4, i0.u2.t3, i1.t36, i1.t35...633
(forward)formula 0,0,7.83668,272220,1,0,470040,906,3804,1.84081e+06,373,3486,480942
FORMULA ResAllocation-PT-R003C050-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-26 10:01:24] [INFO ] Invariant cache hit.
[2024-05-26 10:01:24] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-26 10:01:24] [INFO ] Invariant cache hit.
[2024-05-26 10:01:25] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 10:01:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:01:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 8 ms to minimize.
[2024-05-26 10:01:27] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:01:28] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:01:29] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:01:30] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10374 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:01:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:01:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17168 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27580ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27582ms
Finished structural reductions in LTL mode , in 1 iterations and 28075 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 10:01:52] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:01:52] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:01:52] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 10:01:52] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:01:52] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:01:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5952208975820040128.gal : 2 ms
[2024-05-26 10:01:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1268480568862855318.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/CTLFireability5952208975820040128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1268480568862855318.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-26 10:02:22] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:02:22] [INFO ] Applying decomposition
[2024-05-26 10:02:22] [INFO ] Flatten gal took : 6 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/graph12914210772933968591.txt' '-o' '/tmp/graph12914210772933968591.bin' '-w' '/tmp/graph12914210772933968591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12914210772933968591.bin' '-l' '-1' '-v' '-w' '/tmp/graph12914210772933968591.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:02:22] [INFO ] Decomposing Gal with order
[2024-05-26 10:02:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:02:22] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:02:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:02:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7107732031109296545.gal : 3 ms
[2024-05-26 10:02:22] [INFO ] Time to serialize properties into /tmp/CTLFireability16471499528783746271.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/CTLFireability7107732031109296545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16471499528783746271.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.351903,21408,4678,68,43012,430,627,62874,63,1076,0


Converting to forward existential form...Done !
original formula: E(AX(AF(AX((((i8.u99.r_40_1==1)&&(i8.u102.r_41_1==1))&&(i8.u100.p_41_2==1))))) U A(AX((E(((i2.i0.i1.u24.r_8_2==1)&&(i2.i0.i1.u25.r_9_2==1...288
=> equivalent forward existential formula: [((FwdU(Init,!(EX(!(!(EG(!(!(EX(!((((i8.u99.r_40_1==1)&&(i8.u102.r_41_1==1))&&(i8.u100.p_41_2==1)))))))))))) * !...444
Reverse transition relation is NOT exact ! Due to transitions t12, t35, t60, t84, t100, t132, t155, t171, i0.t11, i0.t4, i0.u2.t3, i1.t28, i1.t27, i1.u11.t...618
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-26 10:02:53] [INFO ] Invariant cache hit.
[2024-05-26 10:02:53] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-26 10:02:53] [INFO ] Invariant cache hit.
[2024-05-26 10:02:53] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 10:02:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:02:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:02:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:02:56] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:02:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:02:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:02:57] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:02:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:02:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:02:58] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:02:58] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:02:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:02:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:02:58] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:02:58] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:02:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:02:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:02:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:02:59] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:02:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:02:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10328 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:03:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:03:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17554 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27904ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27906ms
Finished structural reductions in LTL mode , in 1 iterations and 28391 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 10:03:21] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:03:21] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:03:21] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 10:03:21] [INFO ] Flatten gal took : 15 ms
[2024-05-26 10:03:21] [INFO ] Flatten gal took : 13 ms
[2024-05-26 10:03:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17589117325608406069.gal : 1 ms
[2024-05-26 10:03:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9319714402770688589.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/CTLFireability17589117325608406069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9319714402770688589.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-26 10:03:51] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:03:51] [INFO ] Applying decomposition
[2024-05-26 10:03:51] [INFO ] Flatten gal took : 6 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/graph2538636256552778938.txt' '-o' '/tmp/graph2538636256552778938.bin' '-w' '/tmp/graph2538636256552778938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2538636256552778938.bin' '-l' '-1' '-v' '-w' '/tmp/graph2538636256552778938.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:03:51] [INFO ] Decomposing Gal with order
[2024-05-26 10:03:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:03:51] [INFO ] Flatten gal took : 26 ms
[2024-05-26 10:03:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 10:03:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13144608721429783797.gal : 26 ms
[2024-05-26 10:03:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13538605339091414971.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/CTLFireability13144608721429783797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13538605339091414971.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.580724,26948,5097,60,53191,456,646,96271,62,1137,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(AF((((i3.u44.r_17_2==0)||(i3.u43.p_18_1==0))||(i3.u46.r_18_2==0))))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(EG(!((((i3.u44.r_17_2==0)||(i3.u43.p_18_1==0))||(i3.u46.r_18_2==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, t27, t51, t76, t164, i0.t19, i0.t12, i0.t11, i0.t4, i0.u2.t3, i1.t43, i1.t36, i1.i0.i0.u...622
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-26 10:04:21] [INFO ] Invariant cache hit.
[2024-05-26 10:04:21] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-26 10:04:21] [INFO ] Invariant cache hit.
[2024-05-26 10:04:22] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 10:04:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 6 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:04:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:04:24] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:04:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:04:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:04:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10143 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:04:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:04:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 16754 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 26955ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 26956ms
Finished structural reductions in LTL mode , in 1 iterations and 27424 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 10:04:49] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:04:49] [INFO ] Flatten gal took : 8 ms
[2024-05-26 10:04:49] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 10:04:49] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:04:49] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:04:49] [INFO ] Time to serialize gal into /tmp/CTLFireability9537872049543658916.gal : 2 ms
[2024-05-26 10:04:49] [INFO ] Time to serialize properties into /tmp/CTLFireability230427706134740676.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/CTLFireability9537872049543658916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability230427706134740676.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 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-26 10:05:19] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:05:19] [INFO ] Applying decomposition
[2024-05-26 10:05:19] [INFO ] Flatten gal took : 6 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/graph10755676966738734787.txt' '-o' '/tmp/graph10755676966738734787.bin' '-w' '/tmp/graph10755676966738734787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10755676966738734787.bin' '-l' '-1' '-v' '-w' '/tmp/graph10755676966738734787.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:05:19] [INFO ] Decomposing Gal with order
[2024-05-26 10:05:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:05:19] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:05:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:05:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11893904979848618562.gal : 2 ms
[2024-05-26 10:05:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8275131633830378352.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/CTLFireability11893904979848618562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8275131633830378352.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.266992,16068,3816,130,30491,770,619,35391,83,1798,0


Converting to forward existential form...Done !
original formula: AF(AX(E((!(EG((((i0.u10.r_4_1==1)&&(i1.u13.r_5_1==1))&&(i1.u14.p_5_2==1)))) * EF((i1.u12.p_5_0==1))) U EG(((((i5.u63.r_28_1==1)&&(i5.u66....234
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(E((!(EG((((i0.u10.r_4_1==1)&&(i1.u13.r_5_1==1))&&(i1.u14.p_5_2==1)))) * E(TRUE U (i1.u12.p_5...291
Reverse transition relation is NOT exact ! Due to transitions t20, t36, t52, t76, t83, t107, t108, t123, t124, t155, i0.t19, i0.t12, i0.t11, i0.t4, i0.u2.t...610
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 0 with 94 rules applied. Total rules applied 94 place count 250 transition count 153
Applied a total of 94 rules in 14 ms. Remains 250 /297 variables (removed 47) and now considering 153/200 (removed 47) transitions.
// Phase 1: matrix 153 rows 250 cols
[2024-05-26 10:05:49] [INFO ] Computed 147 invariants in 1 ms
[2024-05-26 10:05:49] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-26 10:05:49] [INFO ] Invariant cache hit.
[2024-05-26 10:05:49] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-26 10:05:49] [INFO ] Redundant transitions in 3 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-26 10:05:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 147/397 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-26 10:05:50] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:05:50] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 153/403 variables, 250/649 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 649 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3519 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 147/397 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-26 10:05:53] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 153/403 variables, 250/650 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 103/753 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/403 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 753 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3923 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 3/3 constraints]
After SMT, in 7460ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 7461ms
Starting structural reductions in SI_CTL mode, iteration 1 : 250/297 places, 153/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7863 ms. Remains : 250/297 places, 153/200 transitions.
[2024-05-26 10:05:57] [INFO ] Flatten gal took : 12 ms
[2024-05-26 10:05:57] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:05:57] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-26 10:05:57] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:05:57] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:05:57] [INFO ] Time to serialize gal into /tmp/CTLFireability11772321718732026154.gal : 1 ms
[2024-05-26 10:05:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15800521849119622334.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/CTLFireability11772321718732026154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15800521849119622334.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.47133e+25,0.122865,7464,2,5006,5,20366,6,0,1156,16368,0


Converting to forward existential form...Done !
original formula: EG(AF((!(A(((p_8_2==1)||(((r_4_1==1)&&(r_5_1==1))&&(p_5_2==1))) U A((((r_18_1==1)&&(r_19_1==1))&&(p_19_2==1)) U (p_17_0==1)))) * (((r_42_...191
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!(!((E(!(!((E(!((p_17_0==1)) U (!((((r_18_1==1)&&(r_19_1==1))&&(p_19_2==1))) * !((p_17_0==1))...538
Reverse transition relation is NOT exact ! Due to transitions t19, t36, t90, t113, t114, t121, t122, t146, t147, Intersection with reachable at each step ...212
Detected timeout of ITS tools.
[2024-05-26 10:06:27] [INFO ] Flatten gal took : 8 ms
[2024-05-26 10:06:27] [INFO ] Applying decomposition
[2024-05-26 10:06:27] [INFO ] Flatten gal took : 5 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/graph16899189694753335077.txt' '-o' '/tmp/graph16899189694753335077.bin' '-w' '/tmp/graph16899189694753335077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16899189694753335077.bin' '-l' '-1' '-v' '-w' '/tmp/graph16899189694753335077.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:06:27] [INFO ] Decomposing Gal with order
[2024-05-26 10:06:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:06:27] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:06:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-26 10:06:27] [INFO ] Time to serialize gal into /tmp/CTLFireability456561885837700042.gal : 2 ms
[2024-05-26 10:06:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10588117528087878840.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/CTLFireability456561885837700042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10588117528087878840.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.47133e+25,0.06139,5732,253,67,2025,328,546,1575,103,664,0


Converting to forward existential form...Done !
original formula: EG(AF((!(A(((i1.u10.p_8_2==1)||(((i0.i1.u6.r_4_1==1)&&(i0.i1.u6.r_5_1==1))&&(i0.i1.u6.p_5_2==1))) U A((((i3.u21.r_18_1==1)&&(i3.u23.r_19_...277
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!(!((E(!(!((E(!((i3.u19.p_17_0==1)) U (!((((i3.u21.r_18_1==1)&&(i3.u23.r_19_1==1))&&(i3.u22.p...722
Reverse transition relation is NOT exact ! Due to transitions t114, t121, t146, t147, i1.t113, i1.t19, i3.t122, i3.t36, i10.t90, Intersection with reachab...228
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 255 transition count 158
Applied a total of 84 rules in 20 ms. Remains 255 /297 variables (removed 42) and now considering 158/200 (removed 42) transitions.
// Phase 1: matrix 158 rows 255 cols
[2024-05-26 10:06:57] [INFO ] Computed 147 invariants in 1 ms
[2024-05-26 10:06:57] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-26 10:06:57] [INFO ] Invariant cache hit.
[2024-05-26 10:06:57] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-05-26 10:06:57] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-26 10:06:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 147/402 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-26 10:06:58] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:06:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:06:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:06:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:06:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:06:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:06:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:06:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 8/410 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 158/413 variables, 255/665 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/413 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 665 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3960 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 147/402 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 8/410 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 158/413 variables, 255/665 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 108/773 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 773 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4226 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 8/8 constraints]
After SMT, in 8230ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 8231ms
Starting structural reductions in SI_CTL mode, iteration 1 : 255/297 places, 158/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8702 ms. Remains : 255/297 places, 158/200 transitions.
[2024-05-26 10:07:06] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:07:06] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:07:06] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-26 10:07:06] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:07:06] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:07:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6739012111440368966.gal : 1 ms
[2024-05-26 10:07:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10715004226230592072.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/CTLFireability6739012111440368966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10715004226230592072.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12925e+26,0.916582,37056,2,34862,5,188098,6,0,1181,156101,0


Converting to forward existential form...Done !
original formula: (EF(EG((((r_11_1!=1)||(p_12_0!=1))||(r_12_1!=1)))) * EF(((EF((p_35_0==0)) + (p_7_0==0)) + (((((r_15_0==0)||(r_16_0==0))&&(r_6_2==1))&&((r...195
=> equivalent forward existential formula: (([(FwdU(FwdU((Init * E(TRUE U EG((((r_11_1!=1)||(p_12_0!=1))||(r_12_1!=1))))),TRUE),TRUE) * (p_35_0==0))] != FA...442
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t23, t36, t42, t72, t78, t84, t121, t122, t127, t128, t129, t141, t142, t143, t144,...256
Detected timeout of ITS tools.
[2024-05-26 10:07:36] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:07:36] [INFO ] Applying decomposition
[2024-05-26 10:07:36] [INFO ] Flatten gal took : 12 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/graph637132492516524037.txt' '-o' '/tmp/graph637132492516524037.bin' '-w' '/tmp/graph637132492516524037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph637132492516524037.bin' '-l' '-1' '-v' '-w' '/tmp/graph637132492516524037.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:07:36] [INFO ] Decomposing Gal with order
[2024-05-26 10:07:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:07:36] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:07:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:07:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4724799908512740159.gal : 15 ms
[2024-05-26 10:07:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4909782025370691844.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/CTLFireability4724799908512740159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4909782025370691844.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12925e+26,0.065852,5848,374,86,2937,368,621,2575,116,702,0


Converting to forward existential form...Done !
original formula: (EF(EG((((i3.u16.r_11_1!=1)||(i3.u17.p_12_0!=1))||(i3.u19.r_12_1!=1)))) * EF(((EF((i7.u45.p_35_0==0)) + (i1.i1.u10.p_7_0==0)) + (((((i2.i...286
=> equivalent forward existential formula: (([(FwdU(FwdU((Init * E(TRUE U EG((((i3.u16.r_11_1!=1)||(i3.u17.p_12_0!=1))||(i3.u19.r_12_1!=1))))),TRUE),TRUE) ...575
Reverse transition relation is NOT exact ! Due to transitions t15, t121, t122, t127, t129, t142, t144, i1.t23, i1.i1.t16, i2.t128, i2.i0.t36, i2.i1.t42, i6...295
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,20.9353,445064,1,0,598605,1025,3623,2.62499e+06,877,4157,243986
FORMULA ResAllocation-PT-R003C050-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2024-05-26 10:07:57] [INFO ] Computed 147 invariants in 6 ms
[2024-05-26 10:07:57] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-26 10:07:57] [INFO ] Invariant cache hit.
[2024-05-26 10:07:57] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 10:07:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:07:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:07:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:07:58] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:07:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:07:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:07:58] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:07:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:07:58] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:07:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:07:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:08:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:08:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:08:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:08:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:08:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-26 10:08:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:08:02] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:08:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:08:02] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:08:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:08:02] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:08:03] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10331 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:08:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:08:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17174 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27540ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27541ms
Finished structural reductions in LTL mode , in 1 iterations and 27989 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 10:08:25] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:08:25] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:08:25] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 10:08:25] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:08:25] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:08:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16072876766535659293.gal : 1 ms
[2024-05-26 10:08:25] [INFO ] Time to serialize properties into /tmp/CTLFireability11360824874965191534.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/CTLFireability16072876766535659293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11360824874965191534.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-26 10:08:55] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:08:55] [INFO ] Applying decomposition
[2024-05-26 10:08:55] [INFO ] Flatten gal took : 6 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/graph5292351691481853517.txt' '-o' '/tmp/graph5292351691481853517.bin' '-w' '/tmp/graph5292351691481853517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5292351691481853517.bin' '-l' '-1' '-v' '-w' '/tmp/graph5292351691481853517.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:08:55] [INFO ] Decomposing Gal with order
[2024-05-26 10:08:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:08:55] [INFO ] Flatten gal took : 12 ms
[2024-05-26 10:08:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:08:55] [INFO ] Time to serialize gal into /tmp/CTLFireability10524311027822581387.gal : 3 ms
[2024-05-26 10:08:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3630281012567226986.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/CTLFireability10524311027822581387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3630281012567226986.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.294844,17052,3107,109,35261,626,750,38484,85,1666,0


Converting to forward existential form...Done !
original formula: (EG(EF(((((i8.i0.u91.r_41_1==1)&&(i8.i0.u90.p_42_0==1))&&((i8.i2.u93.r_42_1==1)&&(i8.i0.u87.r_38_2==1)))&&(i8.i0.u88.r_39_2==1)))) * !(A(...618
=> equivalent forward existential formula: (([(FwdU(((FwdU((FwdU((Init * EG(E(TRUE U ((((i8.i0.u91.r_41_1==1)&&(i8.i0.u90.p_42_0==1))&&((i8.i2.u93.r_42_1==...3047
Reverse transition relation is NOT exact ! Due to transitions t12, t28, t59, t68, t75, t107, t124, t148, t179, i0.t20, i0.i2.t19, i0.i2.t27, i1.t11, i1.t4,...680
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 248 transition count 151
Applied a total of 98 rules in 17 ms. Remains 248 /297 variables (removed 49) and now considering 151/200 (removed 49) transitions.
// Phase 1: matrix 151 rows 248 cols
[2024-05-26 10:09:25] [INFO ] Computed 147 invariants in 2 ms
[2024-05-26 10:09:25] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-26 10:09:25] [INFO ] Invariant cache hit.
[2024-05-26 10:09:25] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-26 10:09:25] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-26 10:09:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 248/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 147/395 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-26 10:09:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 151/399 variables, 248/645 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/399 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 645 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3836 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 248/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 147/395 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 151/399 variables, 248/645 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 101/746 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/399 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 746 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3563 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints]
After SMT, in 7431ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7433ms
Starting structural reductions in SI_CTL mode, iteration 1 : 248/297 places, 151/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7852 ms. Remains : 248/297 places, 151/200 transitions.
[2024-05-26 10:09:33] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:09:33] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:09:33] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-26 10:09:33] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:09:33] [INFO ] Flatten gal took : 4 ms
[2024-05-26 10:09:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17442296532533309757.gal : 1 ms
[2024-05-26 10:09:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11545483360377789343.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/CTLFireability17442296532533309757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11545483360377789343.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.22269e+25,0.116561,7448,2,4781,5,19923,6,0,1146,16038,0


Converting to forward existential form...Done !
original formula: EF(AG((p_12_2==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p_12_2==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t113, t114, Intersection with reachable at each step enabled. (destroyed/reverse/inters...178
(forward)formula 0,0,3.97824,144080,1,0,315,1.02602e+06,324,155,7498,498030,315
FORMULA ResAllocation-PT-R003C050-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 10 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2024-05-26 10:09:37] [INFO ] Computed 147 invariants in 5 ms
[2024-05-26 10:09:37] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-26 10:09:37] [INFO ] Invariant cache hit.
[2024-05-26 10:09:37] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-26 10:09:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:09:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:09:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:09:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:09:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:09:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:09:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:09:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-26 10:09:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:09:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-26 10:09:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10451 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:09:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-26 10:09:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 16882 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27354ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27357ms
Finished structural reductions in LTL mode , in 1 iterations and 27826 ms. Remains : 297/297 places, 200/200 transitions.
[2024-05-26 10:10:05] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:10:05] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:10:05] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 10:10:05] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:10:05] [INFO ] Flatten gal took : 12 ms
[2024-05-26 10:10:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13339621420475242863.gal : 1 ms
[2024-05-26 10:10:05] [INFO ] Time to serialize properties into /tmp/CTLFireability5292401422897343786.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/CTLFireability13339621420475242863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5292401422897343786.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-26 10:10:35] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:10:35] [INFO ] Applying decomposition
[2024-05-26 10:10:35] [INFO ] Flatten gal took : 5 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/graph14043711023121179571.txt' '-o' '/tmp/graph14043711023121179571.bin' '-w' '/tmp/graph14043711023121179571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14043711023121179571.bin' '-l' '-1' '-v' '-w' '/tmp/graph14043711023121179571.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:10:35] [INFO ] Decomposing Gal with order
[2024-05-26 10:10:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:10:35] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:10:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-26 10:10:35] [INFO ] Time to serialize gal into /tmp/CTLFireability312458058109313477.gal : 4 ms
[2024-05-26 10:10:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3071770642286300859.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/CTLFireability312458058109313477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3071770642286300859.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.322172,20520,3697,249,42600,1280,690,53275,110,3622,0


Converting to forward existential form...Done !
original formula: EF(EX(AX(AG((i3.u43.p_17_0==0)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX(!(!(E(TRUE U !((i3.u43.p_17_0==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t20, t51, t60, t75, t99, t115, t132, t155, t172, t179, i0.t12, i0.t11, i0.t4, i0.u2.t3, ...602
(forward)formula 0,1,2.24617,116088,1,0,214407,3697,3903,732195,744,15311,240182
FORMULA ResAllocation-PT-R003C050-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-26 10:10:37] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:10:37] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:10:37] [INFO ] Applying decomposition
[2024-05-26 10:10:37] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9473073317703615553.txt' '-o' '/tmp/graph9473073317703615553.bin' '-w' '/tmp/graph9473073317703615553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9473073317703615553.bin' '-l' '-1' '-v' '-w' '/tmp/graph9473073317703615553.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:10:37] [INFO ] Decomposing Gal with order
[2024-05-26 10:10:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:10:37] [INFO ] Flatten gal took : 26 ms
[2024-05-26 10:10:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:10:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3310541555533009833.gal : 2 ms
[2024-05-26 10:10:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1151791863383754964.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/CTLFireability3310541555533009833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1151791863383754964.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 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.373518,18852,2555,175,39243,1201,789,47164,95,3870,0


Converting to forward existential form...Done !
original formula: EF(AX((A((((i8.i0.u99.r_45_1==1)&&(i8.i1.u98.p_46_0==1))&&(i8.i1.u101.r_46_1==1)) U (i5.i3.u75.p_34_2==1)) + (((i3.i1.u51.r_21_1==1)&&(i3...201
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!((E(!((i5.i3.u75.p_34_2==1)) U (!((((i8.i0.u99.r_45_1==1)&&(i8.i1.u98.p_46_0==1))&&...330
Reverse transition relation is NOT exact ! Due to transitions t20, t51, t52, t83, t140, t164, t179, t180, i0.t12, i0.i0.t4, i0.i0.t11, i0.i0.u2.t3, i0.i2.t...693
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,1375.77,5452008,1,0,8.82858e+06,7388,1667,3.90436e+07,231,76177,665876
FORMULA ResAllocation-PT-R003C050-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-26 10:37:09] [INFO ] Applying decomposition
[2024-05-26 10:37:09] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:37:09] [INFO ] Decomposing Gal with order
[2024-05-26 10:37:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:37:09] [INFO ] Removed a total of 144 redundant transitions.
[2024-05-26 10:37:09] [INFO ] Flatten gal took : 14 ms
[2024-05-26 10:37:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-26 10:37:09] [INFO ] Time to serialize gal into /tmp/CTLFireability332161656476322840.gal : 2 ms
[2024-05-26 10:37:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2177836349213563057.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/CTLFireability332161656476322840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2177836349213563057.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,57.9572,1951172,1.06613e+06,12,5.20447e+06,528,663,3.17139e+06,21,396,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-26 10:44:34] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:44:34] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 10:44:34] [INFO ] Transformed 297 places.
[2024-05-26 10:44:34] [INFO ] Transformed 200 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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-26 10:44:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15942651844488082157.gal : 2 ms
[2024-05-26 10:44:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5286085407162465378.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/CTLFireability15942651844488082157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5286085407162465378.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87175e+28,0.078665,5868,2,2567,5,8462,6,0,1391,6122,0


Converting to forward existential form...Done !
original formula: A(!((EG(((AG((((r_46_0==1)&&(r_47_0==1))&&(p_47_1==1))) + !(E(((r_24_2==1)&&(r_25_2==1)) U (((r_25_2==1)&&(p_26_1==1))&&(r_26_2==1))))) +...455
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(!((((r_38_0==1)&&(r_39_0==1))&&(p_39_1==1))) U (!(E(TRUE U EG(((r_2_2==1)&&(r...1103
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t11, t12, t19, t20, t27, t28, t35, t36, t43, t44, t51, t52, t59, t60, t67, t68, t75, ...435

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C050"
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 ResAllocation-PT-R003C050, 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 r312-tall-171662339400826"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C050.tgz
mv ResAllocation-PT-R003C050 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 ;