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.r004-smll-171620117600010.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 ASLink-PT-01a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117600010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 201K May 18 16:42 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 ASLink-PT-01a-CTLFireability-2024-00
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-01
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-02
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-03
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-04
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-05
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-06
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-07
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-08
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-09
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-10
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-11
FORMULA_NAME ASLink-PT-01a-CTLFireability-2023-12
FORMULA_NAME ASLink-PT-01a-CTLFireability-2023-13
FORMULA_NAME ASLink-PT-01a-CTLFireability-2023-14
FORMULA_NAME ASLink-PT-01a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716211837138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-20 13:30:39] [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-20 13:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 13:30:39] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2024-05-20 13:30:39] [INFO ] Transformed 431 places.
[2024-05-20 13:30:39] [INFO ] Transformed 735 transitions.
[2024-05-20 13:30:39] [INFO ] Found NUPN structural information;
[2024-05-20 13:30:39] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 164 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Support contains 146 out of 431 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 426 transition count 728
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 422 transition count 724
Ensure Unique test removed 1 places
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 421 transition count 724
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 421 transition count 722
Applied a total of 16 rules in 165 ms. Remains 421 /431 variables (removed 10) and now considering 722/728 (removed 6) transitions.
// Phase 1: matrix 722 rows 421 cols
[2024-05-20 13:30:40] [INFO ] Computed 74 invariants in 59 ms
[2024-05-20 13:30:41] [INFO ] Implicit Places using invariants in 996 ms returned [1, 19, 20, 23, 70, 199, 204, 216, 222, 258, 260, 263, 282, 284, 302, 310, 318, 330, 336, 342, 350, 356, 362, 370]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1070 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 397/431 places, 722/728 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 385 transition count 710
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 385 transition count 710
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 377 transition count 702
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 377 transition count 702
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 374 transition count 699
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 374 transition count 699
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 373 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 373 transition count 698
Applied a total of 48 rules in 54 ms. Remains 373 /397 variables (removed 24) and now considering 698/722 (removed 24) transitions.
// Phase 1: matrix 698 rows 373 cols
[2024-05-20 13:30:41] [INFO ] Computed 50 invariants in 25 ms
[2024-05-20 13:30:41] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-20 13:30:41] [INFO ] Invariant cache hit.
[2024-05-20 13:30:42] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 373/431 places, 698/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2512 ms. Remains : 373/431 places, 698/728 transitions.
Support contains 146 out of 373 places after structural reductions.
[2024-05-20 13:30:43] [INFO ] Flatten gal took : 154 ms
[2024-05-20 13:30:43] [INFO ] Flatten gal took : 87 ms
[2024-05-20 13:30:43] [INFO ] Input system was already deterministic with 698 transitions.
Reduction of identical properties reduced properties to check from 101 to 100
RANDOM walk for 40000 steps (738 resets) in 3414 ms. (11 steps per ms) remains 55/100 properties
BEST_FIRST walk for 4003 steps (32 resets) in 80 ms. (49 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (27 resets) in 74 ms. (53 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (22 resets) in 66 ms. (59 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (35 resets) in 45 ms. (87 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (22 resets) in 46 ms. (85 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (21 resets) in 55 ms. (71 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (31 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (29 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (28 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (30 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (29 resets) in 18 ms. (210 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (31 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (32 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (31 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (27 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (25 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (30 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (33 resets) in 22 ms. (174 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (27 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (34 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (24 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (27 resets) in 45 ms. (87 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (30 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (28 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (28 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (29 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (26 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (27 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (21 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (30 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (27 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (29 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (30 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (23 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (26 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (26 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (29 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (24 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (33 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (26 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (29 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (27 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (27 resets) in 44 ms. (88 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (25 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (28 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (21 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
[2024-05-20 13:30:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 107/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 16/205 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 5 (OVERLAPS) 168/373 variables, 41/50 constraints. Problems are: Problem set: 7 solved, 46 unsolved
[2024-05-20 13:30:47] [INFO ] Deduced a trap composed of 25 places in 406 ms of which 42 ms to minimize.
[2024-05-20 13:30:47] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 3 ms to minimize.
[2024-05-20 13:30:47] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 4 ms to minimize.
[2024-05-20 13:30:48] [INFO ] Deduced a trap composed of 92 places in 249 ms of which 4 ms to minimize.
Problem AtomicPropp37 is UNSAT
[2024-05-20 13:30:48] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 3 ms to minimize.
[2024-05-20 13:30:48] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
Problem AtomicPropp63 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 6/56 constraints. Problems are: Problem set: 9 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/56 constraints. Problems are: Problem set: 9 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 698/1071 variables, 373/429 constraints. Problems are: Problem set: 9 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1071/1071 variables, and 429 constraints, problems are : Problem set: 9 solved, 44 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 9 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 105/170 variables, 6/6 constraints. Problems are: Problem set: 9 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 20/190 variables, 3/9 constraints. Problems are: Problem set: 9 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 44 unsolved
Problem AtomicPropp80 is UNSAT
At refinement iteration 5 (OVERLAPS) 183/373 variables, 41/50 constraints. Problems are: Problem set: 10 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 6/56 constraints. Problems are: Problem set: 10 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/56 constraints. Problems are: Problem set: 10 solved, 43 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 8 (OVERLAPS) 698/1071 variables, 373/429 constraints. Problems are: Problem set: 40 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1071/1071 variables, and 442 constraints, problems are : Problem set: 40 solved, 13 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 13/53 constraints, Known Traps: 6/6 constraints]
After SMT, in 10193ms problems are : Problem set: 40 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 698/698 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 372 transition count 660
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 334 transition count 660
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 77 place count 334 transition count 628
Deduced a syphon composed of 32 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 153 place count 290 transition count 628
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 290 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 155 place count 289 transition count 627
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 159 place count 285 transition count 610
Iterating global reduction 4 with 4 rules applied. Total rules applied 163 place count 285 transition count 610
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 164 place count 284 transition count 610
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 164 place count 284 transition count 609
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 283 transition count 609
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 167 place count 282 transition count 608
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 282 transition count 608
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 214 place count 259 transition count 585
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 215 place count 258 transition count 584
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 258 transition count 584
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 228 place count 258 transition count 572
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 240 place count 246 transition count 572
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 241 place count 246 transition count 572
Applied a total of 241 rules in 180 ms. Remains 246 /373 variables (removed 127) and now considering 572/698 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 246/373 places, 572/698 transitions.
RANDOM walk for 40000 steps (891 resets) in 1486 ms. (26 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (464 resets) in 227 ms. (175 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (430 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (465 resets) in 232 ms. (171 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (280 resets) in 154 ms. (258 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (484 resets) in 234 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (444 resets) in 205 ms. (194 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (465 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (427 resets) in 181 ms. (219 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (438 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (441 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (450 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (434 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (449 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 200139 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :3 out of 12
Probabilistic random walk after 200139 steps, saw 76959 distinct states, run finished after 3007 ms. (steps per millisecond=66 ) properties seen :3
// Phase 1: matrix 572 rows 246 cols
[2024-05-20 13:30:59] [INFO ] Computed 36 invariants in 7 ms
[2024-05-20 13:30:59] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 44/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 80/142 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 13:31:00] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 13:31:00] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 103/245 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 13:31:00] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/246 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 572/818 variables, 246/285 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/818 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/818 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/818 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 289 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2181 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 246/246 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 44/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 80/142 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 13:31:02] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 103/245 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/246 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp100 is UNSAT
After SMT solving in domain Int declared 818/818 variables, and 286 constraints, problems are : Problem set: 9 solved, 0 unsolved in 1648 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 246/246 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 3867ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 50 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-01a-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 13:31:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-20 13:31:03] [INFO ] Flatten gal took : 57 ms
[2024-05-20 13:31:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ASLink-PT-01a-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 13:31:03] [INFO ] Flatten gal took : 53 ms
[2024-05-20 13:31:04] [INFO ] Input system was already deterministic with 698 transitions.
Support contains 39 out of 373 places (down from 81) after GAL structural reductions.
FORMULA ASLink-PT-01a-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 698/698 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 372 transition count 698
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 368 transition count 681
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 368 transition count 681
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 365 transition count 671
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 365 transition count 671
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 363 transition count 662
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 363 transition count 662
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 361 transition count 653
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 361 transition count 653
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 359 transition count 644
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 359 transition count 644
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 358 transition count 636
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 358 transition count 636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 357 transition count 628
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 357 transition count 628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 356 transition count 620
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 356 transition count 620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 355 transition count 612
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 355 transition count 612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 354 transition count 604
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 354 transition count 604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 353 transition count 596
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 353 transition count 596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 352 transition count 588
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 352 transition count 588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 351 transition count 580
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 351 transition count 580
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 350 transition count 572
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 350 transition count 572
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 349 transition count 564
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 349 transition count 564
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 348 transition count 556
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 348 transition count 556
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 347 transition count 548
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 347 transition count 548
Applied a total of 51 rules in 132 ms. Remains 347 /373 variables (removed 26) and now considering 548/698 (removed 150) transitions.
// Phase 1: matrix 548 rows 347 cols
[2024-05-20 13:31:04] [INFO ] Computed 49 invariants in 6 ms
[2024-05-20 13:31:04] [INFO ] Implicit Places using invariants in 306 ms returned [29, 47, 212, 213, 251, 252, 283]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 309 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 340/373 places, 548/698 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 338 transition count 546
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 338 transition count 546
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 337 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 337 transition count 545
Applied a total of 6 rules in 21 ms. Remains 337 /340 variables (removed 3) and now considering 545/548 (removed 3) transitions.
// Phase 1: matrix 545 rows 337 cols
[2024-05-20 13:31:04] [INFO ] Computed 42 invariants in 6 ms
[2024-05-20 13:31:04] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-20 13:31:04] [INFO ] Invariant cache hit.
[2024-05-20 13:31:05] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 337/373 places, 545/698 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1676 ms. Remains : 337/373 places, 545/698 transitions.
[2024-05-20 13:31:05] [INFO ] Flatten gal took : 36 ms
[2024-05-20 13:31:05] [INFO ] Flatten gal took : 28 ms
[2024-05-20 13:31:05] [INFO ] Input system was already deterministic with 545 transitions.
[2024-05-20 13:31:05] [INFO ] Flatten gal took : 27 ms
[2024-05-20 13:31:05] [INFO ] Flatten gal took : 26 ms
[2024-05-20 13:31:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10964714586512399368.gal : 24 ms
[2024-05-20 13:31:05] [INFO ] Time to serialize properties into /tmp/CTLFireability5149602567235723695.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/CTLFireability10964714586512399368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5149602567235723695.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.59346e+08,5.81579,138592,2,29465,5,408411,6,0,1895,451811,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 13:31:36] [INFO ] Flatten gal took : 34 ms
[2024-05-20 13:31:36] [INFO ] Applying decomposition
[2024-05-20 13:31:36] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8258458377759346316.txt' '-o' '/tmp/graph8258458377759346316.bin' '-w' '/tmp/graph8258458377759346316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8258458377759346316.bin' '-l' '-1' '-v' '-w' '/tmp/graph8258458377759346316.weights' '-q' '0' '-e' '0.001'
[2024-05-20 13:31:36] [INFO ] Decomposing Gal with order
[2024-05-20 13:31:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 13:31:36] [INFO ] Removed a total of 816 redundant transitions.
[2024-05-20 13:31:36] [INFO ] Flatten gal took : 170 ms
[2024-05-20 13:31:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 42 ms.
[2024-05-20 13:31:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13399781664139726349.gal : 20 ms
[2024-05-20 13:31:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8986405123228462783.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/CTLFireability13399781664139726349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8986405123228462783.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.59346e+08,2.13102,65044,2104,452,91618,24682,1047,247183,178,103325,0


Converting to forward existential form...Done !
original formula: AX(EG(AF((((i7.i1.i1.u100.p307==0)||(i6.u64.p69==0))||(i6.u64.p210==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(!((((i7.i1.i1.u100.p307==0)||(i6.u64.p69==0))||(i6.u64.p210==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t276, t444, t465, t515, i0.t5, i3.u37.t65, i3.u46.t55, i3.u53.t45, i4.t4, i4.t0, ...417
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,15.1264,366532,1,0,509104,26824,7775,2.14504e+06,1013,103325,1278571
FORMULA ASLink-PT-01a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 373/373 places, 698/698 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 372 transition count 660
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 334 transition count 660
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 76 place count 334 transition count 628
Deduced a syphon composed of 32 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 152 place count 290 transition count 628
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 152 place count 290 transition count 627
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 289 transition count 627
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 159 place count 284 transition count 609
Iterating global reduction 2 with 5 rules applied. Total rules applied 164 place count 284 transition count 609
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 283 transition count 608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 167 place count 282 transition count 608
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 167 place count 282 transition count 607
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 281 transition count 607
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 172 place count 278 transition count 597
Iterating global reduction 4 with 3 rules applied. Total rules applied 175 place count 278 transition count 597
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 278 transition count 596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 277 transition count 596
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 179 place count 275 transition count 587
Iterating global reduction 6 with 2 rules applied. Total rules applied 181 place count 275 transition count 587
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 183 place count 273 transition count 578
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 273 transition count 578
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 272 transition count 570
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 272 transition count 570
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 188 place count 271 transition count 562
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 271 transition count 562
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 190 place count 270 transition count 554
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 270 transition count 554
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 192 place count 269 transition count 546
Iterating global reduction 6 with 1 rules applied. Total rules applied 193 place count 269 transition count 546
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 194 place count 268 transition count 538
Iterating global reduction 6 with 1 rules applied. Total rules applied 195 place count 268 transition count 538
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 196 place count 267 transition count 530
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 267 transition count 530
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 198 place count 266 transition count 522
Iterating global reduction 6 with 1 rules applied. Total rules applied 199 place count 266 transition count 522
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 200 place count 265 transition count 514
Iterating global reduction 6 with 1 rules applied. Total rules applied 201 place count 265 transition count 514
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 202 place count 264 transition count 506
Iterating global reduction 6 with 1 rules applied. Total rules applied 203 place count 264 transition count 506
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 204 place count 263 transition count 498
Iterating global reduction 6 with 1 rules applied. Total rules applied 205 place count 263 transition count 498
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 206 place count 262 transition count 490
Iterating global reduction 6 with 1 rules applied. Total rules applied 207 place count 262 transition count 490
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 208 place count 261 transition count 482
Iterating global reduction 6 with 1 rules applied. Total rules applied 209 place count 261 transition count 482
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 210 place count 260 transition count 474
Iterating global reduction 6 with 1 rules applied. Total rules applied 211 place count 260 transition count 474
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 253 place count 239 transition count 453
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 238 transition count 452
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 238 transition count 452
Applied a total of 255 rules in 206 ms. Remains 238 /373 variables (removed 135) and now considering 452/698 (removed 246) transitions.
// Phase 1: matrix 452 rows 238 cols
[2024-05-20 13:31:52] [INFO ] Computed 36 invariants in 5 ms
[2024-05-20 13:31:52] [INFO ] Implicit Places using invariants in 294 ms returned [21, 39, 143, 144, 145, 182, 200, 228]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 297 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 230/373 places, 452/698 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 230 transition count 443
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 221 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 220 transition count 442
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 20 place count 220 transition count 432
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 40 place count 210 transition count 432
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 9 rules applied. Total rules applied 49 place count 207 transition count 426
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 55 place count 201 transition count 426
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 59 place count 197 transition count 422
Iterating global reduction 5 with 4 rules applied. Total rules applied 63 place count 197 transition count 422
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 65 place count 197 transition count 420
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 71 place count 194 transition count 417
Applied a total of 71 rules in 37 ms. Remains 194 /230 variables (removed 36) and now considering 417/452 (removed 35) transitions.
// Phase 1: matrix 417 rows 194 cols
[2024-05-20 13:31:52] [INFO ] Computed 25 invariants in 4 ms
[2024-05-20 13:31:52] [INFO ] Implicit Places using invariants in 203 ms returned [95, 104, 111, 113, 116, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 207 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 188/373 places, 417/698 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 187 transition count 416
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 184 transition count 413
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 184 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 184 transition count 412
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 11 place count 182 transition count 410
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 182 transition count 410
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 180 transition count 408
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 180 transition count 408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 179 transition count 407
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 179 transition count 407
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 178 transition count 406
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 178 transition count 406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 176 transition count 404
Applied a total of 25 rules in 37 ms. Remains 176 /188 variables (removed 12) and now considering 404/417 (removed 13) transitions.
// Phase 1: matrix 404 rows 176 cols
[2024-05-20 13:31:52] [INFO ] Computed 19 invariants in 3 ms
[2024-05-20 13:31:52] [INFO ] Implicit Places using invariants in 186 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 175/373 places, 404/698 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 174 transition count 403
Applied a total of 2 rules in 12 ms. Remains 174 /175 variables (removed 1) and now considering 403/404 (removed 1) transitions.
// Phase 1: matrix 403 rows 174 cols
[2024-05-20 13:31:52] [INFO ] Computed 18 invariants in 4 ms
[2024-05-20 13:31:53] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-20 13:31:53] [INFO ] Invariant cache hit.
[2024-05-20 13:31:53] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 4 : 174/373 places, 403/698 transitions.
Finished structural reductions in SI_CTL mode , in 4 iterations and 1735 ms. Remains : 174/373 places, 403/698 transitions.
[2024-05-20 13:31:53] [INFO ] Flatten gal took : 15 ms
[2024-05-20 13:31:53] [INFO ] Flatten gal took : 17 ms
[2024-05-20 13:31:53] [INFO ] Input system was already deterministic with 403 transitions.
[2024-05-20 13:31:53] [INFO ] Flatten gal took : 16 ms
[2024-05-20 13:31:53] [INFO ] Flatten gal took : 16 ms
[2024-05-20 13:31:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13951597323356794740.gal : 3 ms
[2024-05-20 13:31:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7951848903115355925.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/CTLFireability13951597323356794740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7951848903115355925.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,429447,1.19733,30344,2,7223,5,82608,6,0,1101,87902,0


Converting to forward existential form...Done !
original formula: EG(!(E(((p292==1)&&(p309==1)) U EG(((p71==1)&&(p210==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((p292==1)&&(p309==1)) U EG(((p71==1)&&(p210==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t10, t313, t316, t317, t323, t350, t352, t363, t364, t365, t373, t383, t387, t389, t3...285
(forward)formula 0,1,8.45534,167092,1,0,441,442384,610,230,10144,325302,773
FORMULA ASLink-PT-01a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 698/698 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 372 transition count 698
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 367 transition count 680
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 367 transition count 680
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 364 transition count 670
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 364 transition count 670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 362 transition count 661
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 362 transition count 661
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 360 transition count 652
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 360 transition count 652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 358 transition count 643
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 358 transition count 643
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 357 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 357 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 356 transition count 627
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 356 transition count 627
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 355 transition count 619
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 355 transition count 619
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 354 transition count 611
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 354 transition count 611
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 353 transition count 603
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 353 transition count 603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 352 transition count 595
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 352 transition count 595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 351 transition count 587
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 351 transition count 587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 350 transition count 579
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 350 transition count 579
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 349 transition count 571
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 349 transition count 571
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 348 transition count 563
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 348 transition count 563
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 347 transition count 555
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 347 transition count 555
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 346 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 346 transition count 547
Applied a total of 53 rules in 105 ms. Remains 346 /373 variables (removed 27) and now considering 547/698 (removed 151) transitions.
// Phase 1: matrix 547 rows 346 cols
[2024-05-20 13:32:02] [INFO ] Computed 49 invariants in 5 ms
[2024-05-20 13:32:02] [INFO ] Implicit Places using invariants in 462 ms returned [29, 47, 212, 213, 251, 252, 282]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 464 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 339/373 places, 547/698 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 337 transition count 545
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 337 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 336 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 336 transition count 544
Applied a total of 6 rules in 16 ms. Remains 336 /339 variables (removed 3) and now considering 544/547 (removed 3) transitions.
// Phase 1: matrix 544 rows 336 cols
[2024-05-20 13:32:03] [INFO ] Computed 42 invariants in 8 ms
[2024-05-20 13:32:03] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-20 13:32:03] [INFO ] Invariant cache hit.
[2024-05-20 13:32:03] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 336/373 places, 544/698 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1556 ms. Remains : 336/373 places, 544/698 transitions.
[2024-05-20 13:32:03] [INFO ] Flatten gal took : 17 ms
[2024-05-20 13:32:04] [INFO ] Flatten gal took : 18 ms
[2024-05-20 13:32:04] [INFO ] Input system was already deterministic with 544 transitions.
[2024-05-20 13:32:04] [INFO ] Flatten gal took : 25 ms
[2024-05-20 13:32:04] [INFO ] Flatten gal took : 25 ms
[2024-05-20 13:32:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5909206624534155138.gal : 4 ms
[2024-05-20 13:32:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14858299018463411658.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/CTLFireability5909206624534155138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14858299018463411658.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.58935e+08,7.1809,145044,2,28884,5,418425,6,0,1890,471152,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,7.26692,145044,1,0,6,418425,7,1,2685,471152,1
FORMULA ASLink-PT-01a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 698/698 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 369 transition count 681
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 369 transition count 681
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 367 transition count 672
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 367 transition count 672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 366 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 366 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 365 transition count 656
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 365 transition count 656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 364 transition count 648
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 364 transition count 648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 363 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 363 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 362 transition count 632
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 362 transition count 632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 361 transition count 624
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 361 transition count 624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 360 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 360 transition count 616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 359 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 359 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 358 transition count 600
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 358 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 357 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 357 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 356 transition count 584
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 356 transition count 584
Applied a total of 34 rules in 132 ms. Remains 356 /373 variables (removed 17) and now considering 584/698 (removed 114) transitions.
// Phase 1: matrix 584 rows 356 cols
[2024-05-20 13:32:11] [INFO ] Computed 50 invariants in 16 ms
[2024-05-20 13:32:12] [INFO ] Implicit Places using invariants in 471 ms returned [29, 47, 212, 213, 257, 288]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 473 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 350/373 places, 584/698 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 349 transition count 583
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 349 transition count 583
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 348 transition count 582
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 348 transition count 582
Applied a total of 4 rules in 14 ms. Remains 348 /350 variables (removed 2) and now considering 582/584 (removed 2) transitions.
// Phase 1: matrix 582 rows 348 cols
[2024-05-20 13:32:12] [INFO ] Computed 44 invariants in 6 ms
[2024-05-20 13:32:12] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-20 13:32:12] [INFO ] Invariant cache hit.
[2024-05-20 13:32:13] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 348/373 places, 582/698 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1794 ms. Remains : 348/373 places, 582/698 transitions.
[2024-05-20 13:32:13] [INFO ] Flatten gal took : 26 ms
[2024-05-20 13:32:13] [INFO ] Flatten gal took : 29 ms
[2024-05-20 13:32:13] [INFO ] Input system was already deterministic with 582 transitions.
[2024-05-20 13:32:13] [INFO ] Flatten gal took : 28 ms
[2024-05-20 13:32:13] [INFO ] Flatten gal took : 29 ms
[2024-05-20 13:32:13] [INFO ] Time to serialize gal into /tmp/CTLFireability14840107145530000548.gal : 7 ms
[2024-05-20 13:32:13] [INFO ] Time to serialize properties into /tmp/CTLFireability444976030308910765.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/CTLFireability14840107145530000548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability444976030308910765.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.7157e+08,8.26406,169444,2,30700,5,478596,6,0,1976,539331,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 13:32:43] [INFO ] Flatten gal took : 17 ms
[2024-05-20 13:32:43] [INFO ] Applying decomposition
[2024-05-20 13:32:43] [INFO ] Flatten gal took : 16 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/graph2026901817933177809.txt' '-o' '/tmp/graph2026901817933177809.bin' '-w' '/tmp/graph2026901817933177809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2026901817933177809.bin' '-l' '-1' '-v' '-w' '/tmp/graph2026901817933177809.weights' '-q' '0' '-e' '0.001'
[2024-05-20 13:32:43] [INFO ] Decomposing Gal with order
[2024-05-20 13:32:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 13:32:43] [INFO ] Removed a total of 913 redundant transitions.
[2024-05-20 13:32:43] [INFO ] Flatten gal took : 42 ms
[2024-05-20 13:32:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 17 ms.
[2024-05-20 13:32:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6448617058602148199.gal : 8 ms
[2024-05-20 13:32:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7941429497094302388.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/CTLFireability6448617058602148199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7941429497094302388.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.7157e+08,1.95406,57200,1794,277,92291,10737,1214,188830,165,67318,0


Converting to forward existential form...Done !
original formula: (A((!(EF(EG(((i8.i0.u85.p290==1)&&(i8.i0.u104.p386==1))))) * (!(AX((i7.i4.u119.p427==1))) + EG((i7.i2.u94.p322==1)))) U (EG(!((((i3.u14.p...289
=> equivalent forward existential formula: [(EY((Init * !(!((E(!((EG(!((((i3.u14.p46==1)&&(i3.u74.p243==1))||((i8.i1.u105.p287==1)&&(i8.i1.u109.p401==1))))...654
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t279, t280, t502, t552, i1.t4, i1.i0.t0, i3.t343, i3.t311, i4.i0.u37.t66, i4.i1.u...432
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,13.2072,328856,1,0,612966,10737,8744,1.23377e+06,807,67318,1206734
FORMULA ASLink-PT-01a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 698/698 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 372 transition count 698
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 367 transition count 680
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 367 transition count 680
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 364 transition count 670
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 364 transition count 670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 362 transition count 661
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 362 transition count 661
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 360 transition count 652
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 360 transition count 652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 358 transition count 643
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 358 transition count 643
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 357 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 357 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 356 transition count 627
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 356 transition count 627
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 355 transition count 619
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 355 transition count 619
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 354 transition count 611
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 354 transition count 611
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 353 transition count 603
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 353 transition count 603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 352 transition count 595
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 352 transition count 595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 351 transition count 587
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 351 transition count 587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 350 transition count 579
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 350 transition count 579
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 349 transition count 571
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 349 transition count 571
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 348 transition count 563
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 348 transition count 563
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 347 transition count 555
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 347 transition count 555
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 346 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 346 transition count 547
Applied a total of 53 rules in 95 ms. Remains 346 /373 variables (removed 27) and now considering 547/698 (removed 151) transitions.
// Phase 1: matrix 547 rows 346 cols
[2024-05-20 13:32:57] [INFO ] Computed 49 invariants in 6 ms
[2024-05-20 13:32:57] [INFO ] Implicit Places using invariants in 297 ms returned [29, 47, 212, 213, 251, 252, 282]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 300 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 339/373 places, 547/698 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 337 transition count 545
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 337 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 336 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 336 transition count 544
Applied a total of 6 rules in 16 ms. Remains 336 /339 variables (removed 3) and now considering 544/547 (removed 3) transitions.
// Phase 1: matrix 544 rows 336 cols
[2024-05-20 13:32:57] [INFO ] Computed 42 invariants in 4 ms
[2024-05-20 13:32:57] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-20 13:32:57] [INFO ] Invariant cache hit.
[2024-05-20 13:32:58] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 336/373 places, 544/698 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1802 ms. Remains : 336/373 places, 544/698 transitions.
[2024-05-20 13:32:58] [INFO ] Flatten gal took : 15 ms
[2024-05-20 13:32:58] [INFO ] Flatten gal took : 16 ms
[2024-05-20 13:32:58] [INFO ] Input system was already deterministic with 544 transitions.
[2024-05-20 13:32:58] [INFO ] Flatten gal took : 15 ms
[2024-05-20 13:32:58] [INFO ] Flatten gal took : 16 ms
[2024-05-20 13:32:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7997416407762722018.gal : 4 ms
[2024-05-20 13:32:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4129382711302362026.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/CTLFireability7997416407762722018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4129382711302362026.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.58935e+08,6.46135,145528,2,28884,5,418425,6,0,1890,471152,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 13:33:29] [INFO ] Flatten gal took : 26 ms
[2024-05-20 13:33:29] [INFO ] Applying decomposition
[2024-05-20 13:33:29] [INFO ] Flatten gal took : 27 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/graph14758796532858321386.txt' '-o' '/tmp/graph14758796532858321386.bin' '-w' '/tmp/graph14758796532858321386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14758796532858321386.bin' '-l' '-1' '-v' '-w' '/tmp/graph14758796532858321386.weights' '-q' '0' '-e' '0.001'
[2024-05-20 13:33:29] [INFO ] Decomposing Gal with order
[2024-05-20 13:33:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 13:33:29] [INFO ] Removed a total of 815 redundant transitions.
[2024-05-20 13:33:29] [INFO ] Flatten gal took : 72 ms
[2024-05-20 13:33:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 16 ms.
[2024-05-20 13:33:29] [INFO ] Time to serialize gal into /tmp/CTLFireability8774636914501378838.gal : 10 ms
[2024-05-20 13:33:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2497030875602493783.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/CTLFireability8774636914501378838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2497030875602493783.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.58935e+08,1.8107,44292,1602,257,75588,2921,1128,136404,150,18934,0


Converting to forward existential form...Done !
original formula: EG(E((i4.i3.u56.p171==1) U (EF(((i6.i0.u66.p176==1)&&(i6.i1.u69.p217==1))) * (!(EX(((i6.i0.u66.p58==1)&&(i6.i0.u68.p214==1)))) + EX((i5.i...174
=> equivalent forward existential formula: [FwdG(Init,E((i4.i3.u56.p171==1) U (E(TRUE U ((i6.i0.u66.p176==1)&&(i6.i1.u69.p217==1))) * (!(EX(((i6.i0.u66.p58...223
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t276, t464, t514, i0.i1.t5, i4.i0.u41.t64, i4.i2.u49.t54, i4.i3.u56.t44, i5.t4, i...409
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 698/698 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 372 transition count 698
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 368 transition count 689
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 368 transition count 689
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 366 transition count 687
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 366 transition count 687
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 365 transition count 686
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 365 transition count 686
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 364 transition count 685
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 364 transition count 685
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 363 transition count 684
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 363 transition count 684
Applied a total of 19 rules in 30 ms. Remains 363 /373 variables (removed 10) and now considering 684/698 (removed 14) transitions.
// Phase 1: matrix 684 rows 363 cols
[2024-05-20 13:33:59] [INFO ] Computed 49 invariants in 6 ms
[2024-05-20 13:33:59] [INFO ] Implicit Places using invariants in 360 ms returned [29, 47, 212, 268, 269, 299]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 362 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 357/373 places, 684/698 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 355 transition count 682
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 355 transition count 682
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 354 transition count 681
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 354 transition count 681
Applied a total of 6 rules in 14 ms. Remains 354 /357 variables (removed 3) and now considering 681/684 (removed 3) transitions.
// Phase 1: matrix 681 rows 354 cols
[2024-05-20 13:33:59] [INFO ] Computed 43 invariants in 5 ms
[2024-05-20 13:34:00] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-20 13:34:00] [INFO ] Invariant cache hit.
[2024-05-20 13:34:01] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 354/373 places, 681/698 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1877 ms. Remains : 354/373 places, 681/698 transitions.
[2024-05-20 13:34:01] [INFO ] Flatten gal took : 29 ms
[2024-05-20 13:34:01] [INFO ] Flatten gal took : 32 ms
[2024-05-20 13:34:01] [INFO ] Input system was already deterministic with 681 transitions.
[2024-05-20 13:34:01] [INFO ] Flatten gal took : 31 ms
[2024-05-20 13:34:01] [INFO ] Flatten gal took : 32 ms
[2024-05-20 13:34:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6148224563411361440.gal : 7 ms
[2024-05-20 13:34:01] [INFO ] Time to serialize properties into /tmp/CTLFireability701811379435472792.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/CTLFireability6148224563411361440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability701811379435472792.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.
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.58935e+08,9.30551,182716,2,39819,5,466477,6,0,2099,511544,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 13:34:31] [INFO ] Flatten gal took : 20 ms
[2024-05-20 13:34:31] [INFO ] Applying decomposition
[2024-05-20 13:34:31] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7587385862127714258.txt' '-o' '/tmp/graph7587385862127714258.bin' '-w' '/tmp/graph7587385862127714258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7587385862127714258.bin' '-l' '-1' '-v' '-w' '/tmp/graph7587385862127714258.weights' '-q' '0' '-e' '0.001'
[2024-05-20 13:34:31] [INFO ] Decomposing Gal with order
[2024-05-20 13:34:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 13:34:31] [INFO ] Removed a total of 1154 redundant transitions.
[2024-05-20 13:34:31] [INFO ] Flatten gal took : 48 ms
[2024-05-20 13:34:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 12 ms.
[2024-05-20 13:34:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8554178168911307799.gal : 7 ms
[2024-05-20 13:34:31] [INFO ] Time to serialize properties into /tmp/CTLFireability8345298815001348462.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/CTLFireability8554178168911307799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8345298815001348462.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.58935e+08,2.23011,53868,1992,456,85482,10982,1322,165226,205,62284,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) + AF(((((AX((i3.i0.u36.p115==0)) * AX(((i4.i1.u49.p155==1)||((i2.u14.p42==1)&&(i2.u83.p260==1))))) + A((i8.i0.u102.p309==1) U ...377
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(FALSE))))),!(((((!(EX(!((i3.i0.u36.p115==0)))) * !(EX(!(((i4.i1.u49.p155==1)||((i2.u14.p4...720
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t276, t277, t576, t601, t654, i1.i2.t5, i4.i0.u39.t64, i4.i1.u47.t54, i4.i2.u54.t...412
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 373/373 places, 698/698 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 371 transition count 659
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 332 transition count 659
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 77 place count 332 transition count 625
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 156 place count 287 transition count 625
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 160 place count 286 transition count 622
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 163 place count 283 transition count 622
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 169 place count 277 transition count 603
Iterating global reduction 4 with 6 rules applied. Total rules applied 175 place count 277 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 178 place count 276 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 179 place count 275 transition count 601
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 179 place count 275 transition count 600
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 181 place count 274 transition count 600
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 184 place count 271 transition count 590
Iterating global reduction 6 with 3 rules applied. Total rules applied 187 place count 271 transition count 590
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 188 place count 271 transition count 589
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 189 place count 270 transition count 589
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 191 place count 268 transition count 580
Iterating global reduction 8 with 2 rules applied. Total rules applied 193 place count 268 transition count 580
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 195 place count 266 transition count 571
Iterating global reduction 8 with 2 rules applied. Total rules applied 197 place count 266 transition count 571
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 198 place count 265 transition count 563
Iterating global reduction 8 with 1 rules applied. Total rules applied 199 place count 265 transition count 563
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 200 place count 264 transition count 555
Iterating global reduction 8 with 1 rules applied. Total rules applied 201 place count 264 transition count 555
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 202 place count 263 transition count 547
Iterating global reduction 8 with 1 rules applied. Total rules applied 203 place count 263 transition count 547
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 204 place count 262 transition count 539
Iterating global reduction 8 with 1 rules applied. Total rules applied 205 place count 262 transition count 539
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 206 place count 261 transition count 531
Iterating global reduction 8 with 1 rules applied. Total rules applied 207 place count 261 transition count 531
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 208 place count 260 transition count 523
Iterating global reduction 8 with 1 rules applied. Total rules applied 209 place count 260 transition count 523
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 210 place count 259 transition count 515
Iterating global reduction 8 with 1 rules applied. Total rules applied 211 place count 259 transition count 515
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 212 place count 258 transition count 507
Iterating global reduction 8 with 1 rules applied. Total rules applied 213 place count 258 transition count 507
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 214 place count 257 transition count 499
Iterating global reduction 8 with 1 rules applied. Total rules applied 215 place count 257 transition count 499
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 216 place count 256 transition count 491
Iterating global reduction 8 with 1 rules applied. Total rules applied 217 place count 256 transition count 491
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 218 place count 255 transition count 483
Iterating global reduction 8 with 1 rules applied. Total rules applied 219 place count 255 transition count 483
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 220 place count 254 transition count 475
Iterating global reduction 8 with 1 rules applied. Total rules applied 221 place count 254 transition count 475
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 222 place count 253 transition count 467
Iterating global reduction 8 with 1 rules applied. Total rules applied 223 place count 253 transition count 467
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 269 place count 230 transition count 444
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 270 place count 229 transition count 443
Iterating global reduction 8 with 1 rules applied. Total rules applied 271 place count 229 transition count 443
Applied a total of 271 rules in 243 ms. Remains 229 /373 variables (removed 144) and now considering 443/698 (removed 255) transitions.
// Phase 1: matrix 443 rows 229 cols
[2024-05-20 13:35:02] [INFO ] Computed 35 invariants in 3 ms
[2024-05-20 13:35:02] [INFO ] Implicit Places using invariants in 252 ms returned [20, 38, 74, 113, 126, 138, 139, 176, 177, 192, 219]
[2024-05-20 13:35:02] [INFO ] Actually due to overlaps returned [139, 38, 20, 138, 176, 177, 74, 126, 192, 219]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 256 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 219/373 places, 443/698 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 219 transition count 426
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 202 transition count 426
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 34 place count 202 transition count 417
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 53 place count 192 transition count 417
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 65 place count 188 transition count 409
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 73 place count 180 transition count 409
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 77 place count 176 transition count 405
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 176 transition count 405
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 84 place count 176 transition count 402
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 92 place count 172 transition count 398
Applied a total of 92 rules in 28 ms. Remains 172 /219 variables (removed 47) and now considering 398/443 (removed 45) transitions.
// Phase 1: matrix 398 rows 172 cols
[2024-05-20 13:35:02] [INFO ] Computed 20 invariants in 3 ms
[2024-05-20 13:35:02] [INFO ] Implicit Places using invariants in 174 ms returned [88, 95, 104]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 177 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 169/373 places, 398/698 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 396
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 166 transition count 395
Applied a total of 6 rules in 15 ms. Remains 166 /169 variables (removed 3) and now considering 395/398 (removed 3) transitions.
// Phase 1: matrix 395 rows 166 cols
[2024-05-20 13:35:02] [INFO ] Computed 17 invariants in 3 ms
[2024-05-20 13:35:02] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-20 13:35:02] [INFO ] Invariant cache hit.
[2024-05-20 13:35:03] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 166/373 places, 395/698 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1261 ms. Remains : 166/373 places, 395/698 transitions.
[2024-05-20 13:35:03] [INFO ] Flatten gal took : 11 ms
[2024-05-20 13:35:03] [INFO ] Flatten gal took : 20 ms
[2024-05-20 13:35:03] [INFO ] Input system was already deterministic with 395 transitions.
[2024-05-20 13:35:03] [INFO ] Flatten gal took : 13 ms
[2024-05-20 13:35:03] [INFO ] Flatten gal took : 14 ms
[2024-05-20 13:35:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3352317061502425376.gal : 4 ms
[2024-05-20 13:35:03] [INFO ] Time to serialize properties into /tmp/CTLFireability9887197431200674142.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/CTLFireability3352317061502425376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9887197431200674142.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,674888,1.92994,45612,2,10000,5,124462,6,0,1062,140245,0


Converting to forward existential form...Done !
original formula: (EG((p168!=1)) + AG(((p212==1)&&(p283==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG((p168!=1)))),TRUE) * !(((p212==1)&&(p283==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t300, t303, t304, t335, t347, t348, t352, t355, t356, t357, t358, t360, t369, t370, t381, t38...326
Detected timeout of ITS tools.
[2024-05-20 13:35:33] [INFO ] Flatten gal took : 13 ms
[2024-05-20 13:35:33] [INFO ] Applying decomposition
[2024-05-20 13:35:33] [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/graph15922666559883940423.txt' '-o' '/tmp/graph15922666559883940423.bin' '-w' '/tmp/graph15922666559883940423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15922666559883940423.bin' '-l' '-1' '-v' '-w' '/tmp/graph15922666559883940423.weights' '-q' '0' '-e' '0.001'
[2024-05-20 13:35:33] [INFO ] Decomposing Gal with order
[2024-05-20 13:35:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 13:35:33] [INFO ] Removed a total of 792 redundant transitions.
[2024-05-20 13:35:33] [INFO ] Flatten gal took : 29 ms
[2024-05-20 13:35:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 3 ms.
[2024-05-20 13:35:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1219866126657011295.gal : 3 ms
[2024-05-20 13:35:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9652981002861325765.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/CTLFireability1219866126657011295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9652981002861325765.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,674888,3.19311,83128,1248,641,96144,26757,609,460331,166,149787,0


Converting to forward existential form...Done !
original formula: (EG((i2.u26.p168!=1)) + AG(((i3.u29.p212==1)&&(i3.u45.p283==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG((i2.u26.p168!=1)))),TRUE) * !(((i3.u29.p212==1)&&(i3.u45.p283==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t300, t303, t348, t389, t390, i2.t394, i2.t370, i2.t352, i2.t335, i2.u23.t369, i2.u23.t392, i...419
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,15.0469,413980,1,0,404171,42156,4883,3.43284e+06,1146,258331,1005567
FORMULA ASLink-PT-01a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-20 13:35:48] [INFO ] Flatten gal took : 30 ms
[2024-05-20 13:35:48] [INFO ] Flatten gal took : 19 ms
[2024-05-20 13:35:48] [INFO ] Applying decomposition
[2024-05-20 13:35:48] [INFO ] Flatten gal took : 21 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/graph4256542511487776651.txt' '-o' '/tmp/graph4256542511487776651.bin' '-w' '/tmp/graph4256542511487776651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4256542511487776651.bin' '-l' '-1' '-v' '-w' '/tmp/graph4256542511487776651.weights' '-q' '0' '-e' '0.001'
[2024-05-20 13:35:48] [INFO ] Decomposing Gal with order
[2024-05-20 13:35:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 13:35:48] [INFO ] Removed a total of 1161 redundant transitions.
[2024-05-20 13:35:48] [INFO ] Flatten gal took : 40 ms
[2024-05-20 13:35:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 10 ms.
[2024-05-20 13:35:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6557830017490373845.gal : 5 ms
[2024-05-20 13:35:48] [INFO ] Time to serialize properties into /tmp/CTLFireability16278383235931363189.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/CTLFireability6557830017490373845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16278383235931363189.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 2 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.73216e+08,2.46314,61420,2256,555,101859,11294,1359,197382,254,65261,0


Converting to forward existential form...Done !
original formula: EG(E((i4.i2.u47.p171==1) U (EF(((i6.i0.u57.p176==1)&&(i6.i1.u60.p217==1))) * (!(EX(((i6.i0.u57.p58==1)&&(i6.i0.u59.p214==1)))) + EX((i5.i...174
=> equivalent forward existential formula: [FwdG(Init,E((i4.i2.u47.p171==1) U (E(TRUE U ((i6.i0.u57.p176==1)&&(i6.i1.u60.p217==1))) * (!(EX(((i6.i0.u57.p58...223
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t13, t279, t612, t669, t671, i1.i2.t5, i2.t665, i4.i0.u36.t67, i4.i1.u41.t57,...423
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,129.375,1680148,1,0,2.86895e+06,15942,9483,8.47003e+06,1574,69644,3810333
FORMULA ASLink-PT-01a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(FALSE) + AF(((((AX((i2.u33.p115==0)) * AX(((i4.i1.u42.p155==1)||((i3.u15.p42==1)&&(i3.u77.p260==1))))) + A((i8.u97.p309==1) U (i7.i0....382
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(FALSE))))),!(((((!(EX(!((i2.u33.p115==0)))) * !(EX(!(((i4.i1.u42.p155==1)||((i3.u15.p42==...725
(forward)formula 1,0,311.285,2201216,1,0,3.83914e+06,22227,3091,1.02687e+07,605,99959,2686025
FORMULA ASLink-PT-01a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 621353 ms.

BK_STOP 1716212460583

--------------------
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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r004-smll-171620117600010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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