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.r378-smll-171683810600018.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 SieveSingleMsgMbox-PT-d0m18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810600018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 19:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 19:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716876836299

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 06:13:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:13:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:13:58] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2024-05-28 06:13:58] [INFO ] Transformed 262 places.
[2024-05-28 06:13:58] [INFO ] Transformed 73 transitions.
[2024-05-28 06:13:58] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 591 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 43 ms.
Deduced a syphon composed of 190 places in 3 ms
Reduce places removed 190 places and 0 transitions.
Support contains 64 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Applied a total of 2 rules in 34 ms. Remains 70 /72 variables (removed 2) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2024-05-28 06:13:59] [INFO ] Computed 5 invariants in 14 ms
[2024-05-28 06:13:59] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-28 06:13:59] [INFO ] Invariant cache hit.
[2024-05-28 06:13:59] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 06:13:59] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-28 06:13:59] [INFO ] Invariant cache hit.
[2024-05-28 06:13:59] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 06:14:01] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 13 ms to minimize.
[2024-05-28 06:14:01] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 06:14:03] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/143 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 109 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4405 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 72/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 181 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3880 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
After SMT, in 8608ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 8642ms
Starting structural reductions in LTL mode, iteration 1 : 70/72 places, 73/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9276 ms. Remains : 70/72 places, 73/73 transitions.
Support contains 64 out of 70 places after structural reductions.
[2024-05-28 06:14:08] [INFO ] Flatten gal took : 45 ms
[2024-05-28 06:14:08] [INFO ] Flatten gal took : 20 ms
[2024-05-28 06:14:08] [INFO ] Input system was already deterministic with 73 transitions.
Support contains 63 out of 70 places (down from 64) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 77 to 71
RANDOM walk for 40000 steps (8968 resets) in 3318 ms. (12 steps per ms) remains 42/71 properties
BEST_FIRST walk for 4003 steps (210 resets) in 88 ms. (44 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (415 resets) in 97 ms. (40 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (193 resets) in 49 ms. (80 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (187 resets) in 45 ms. (87 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (800 resets) in 74 ms. (53 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (407 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (191 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (411 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (411 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (190 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (412 resets) in 22 ms. (174 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4002 steps (197 resets) in 18 ms. (210 steps per ms) remains 39/41 properties
BEST_FIRST walk for 4003 steps (403 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (244 resets) in 53 ms. (74 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (178 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (411 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (184 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (179 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (189 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (410 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (213 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (194 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (198 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (193 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (433 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (619 resets) in 46 ms. (85 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (429 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (197 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (193 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (183 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (418 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (387 resets) in 45 ms. (86 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (405 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (250 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (230 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (200 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (187 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (206 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (159 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (208 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
[2024-05-28 06:14:10] [INFO ] Invariant cache hit.
[2024-05-28 06:14:10] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 17/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/68 variables, 3/5 constraints. Problems are: Problem set: 7 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/73 constraints. Problems are: Problem set: 7 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 30/103 constraints. Problems are: Problem set: 7 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/103 constraints. Problems are: Problem set: 7 solved, 32 unsolved
Problem AtomicPropp71 is UNSAT
At refinement iteration 8 (OVERLAPS) 3/143 variables, 2/105 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/106 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/106 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/106 constraints. Problems are: Problem set: 8 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 106 constraints, problems are : Problem set: 8 solved, 31 unsolved in 1436 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 30/64 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 3/5 constraints. Problems are: Problem set: 8 solved, 31 unsolved
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/6 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 72/140 variables, 68/74 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 30/104 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 10/114 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/114 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 3/143 variables, 2/116 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 1/117 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 21/138 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/138 constraints. Problems are: Problem set: 8 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 0/143 variables, 0/138 constraints. Problems are: Problem set: 8 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 138 constraints, problems are : Problem set: 8 solved, 31 unsolved in 2703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 31/39 constraints, Known Traps: 1/1 constraints]
After SMT, in 4244ms problems are : Problem set: 8 solved, 31 unsolved
Fused 31 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 2195 ms.
Support contains 34 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 70
Applied a total of 6 rules in 14 ms. Remains 67 /70 variables (removed 3) and now considering 70/73 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 67/70 places, 70/73 transitions.
RANDOM walk for 40000 steps (8843 resets) in 341 ms. (116 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (195 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (420 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (800 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (421 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (203 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (400 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (417 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (193 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (402 resets) in 22 ms. (173 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (187 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (436 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (182 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (399 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (203 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (198 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (198 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (397 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (197 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (200 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (198 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (416 resets) in 16 ms. (235 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4002 steps (439 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (184 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (184 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (420 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (421 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (199 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (194 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (184 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (208 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
Finished probabilistic random walk after 80829 steps, run visited all 29 properties in 739 ms. (steps per millisecond=109 )
Probabilistic random walk after 80829 steps, saw 42871 distinct states, run finished after 758 ms. (steps per millisecond=106 ) properties seen :29
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:14:18] [INFO ] Flatten gal took : 17 ms
[2024-05-28 06:14:18] [INFO ] Flatten gal took : 16 ms
[2024-05-28 06:14:18] [INFO ] Input system was already deterministic with 73 transitions.
Computed a total of 10 stabilizing places and 13 stable transitions
Graph (complete) has 213 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 20 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:14:18] [INFO ] Computed 5 invariants in 6 ms
[2024-05-28 06:14:18] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-28 06:14:18] [INFO ] Invariant cache hit.
[2024-05-28 06:14:18] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:14:18] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 06:14:18] [INFO ] Invariant cache hit.
[2024-05-28 06:14:18] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:14:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:14:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 93 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 154 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 2/2 constraints]
After SMT, in 4657ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4660ms
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 62/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4933 ms. Remains : 60/70 places, 62/73 transitions.
[2024-05-28 06:14:23] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:14:23] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:14:23] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-28 06:14:23] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:14:23] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:14:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5195225398491920074.gal : 4 ms
[2024-05-28 06:14:23] [INFO ] Time to serialize properties into /tmp/CTLFireability6989222184050017622.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/CTLFireability5195225398491920074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6989222184050017622.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,4.33386e+07,1.88883,40832,2,8188,5,177169,6,0,302,154838,0


Converting to forward existential form...Done !
original formula: ((EG((AX(((s1<1)||(l24<1))) + A(((s1>=1)&&(l86>=1)) U ((p22>=1)&&(l211>=1))))) * EF(AG(EF((((s1>=1)&&(l29>=1))||((s1>=1)&&(l55>=1))))))) ...309
=> equivalent forward existential formula: ([((((FwdU((Init * (EG((!(EX(!(((s1<1)||(l24<1))))) + !((E(!(((p22>=1)&&(l211>=1))) U (!(((s1>=1)&&(l86>=1))) * ...852
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t10, t41, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t56, t57, t59, t61, Inte...248
(forward)formula 0,0,6.83699,117732,1,0,175,620441,149,85,2050,428996,200
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 13 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-05-28 06:14:30] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 06:14:30] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 06:14:30] [INFO ] Invariant cache hit.
[2024-05-28 06:14:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:14:30] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-28 06:14:30] [INFO ] Invariant cache hit.
[2024-05-28 06:14:30] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 06:14:31] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-28 06:14:31] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/124 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 94 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2811 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/124 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 62/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 156 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3438 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints]
After SMT, in 6321ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 6323ms
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6615 ms. Remains : 61/70 places, 63/73 transitions.
[2024-05-28 06:14:36] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:14:36] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:14:36] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-28 06:14:36] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:14:36] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:14:36] [INFO ] Time to serialize gal into /tmp/CTLFireability838926343606773588.gal : 4 ms
[2024-05-28 06:14:36] [INFO ] Time to serialize properties into /tmp/CTLFireability374231184314452900.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/CTLFireability838926343606773588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability374231184314452900.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.33386e+07,1.97677,38928,2,9247,5,152171,6,0,307,123666,0


Converting to forward existential form...Done !
original formula: EF(((EG(AX(((s1<1)||(l24<1)))) * AF(((s1<1)||(l90<1)))) * ((p10<1)||(l0<1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p10<1)||(l0<1))) * EG(!(EX(!(((s1<1)||(l24<1))))))) * !(EG(!(((s1<1)||(l90<1))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t10, t41, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t56, t57, t58, t60, t62, ...253
Using saturation style SCC detection
(forward)formula 0,1,16.4496,320844,1,0,660,1.85655e+06,158,332,2131,1.46055e+06,720
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 68
Applied a total of 10 rules in 9 ms. Remains 65 /70 variables (removed 5) and now considering 68/73 (removed 5) transitions.
// Phase 1: matrix 68 rows 65 cols
[2024-05-28 06:14:53] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 06:14:53] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 06:14:53] [INFO ] Invariant cache hit.
[2024-05-28 06:14:53] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-28 06:14:53] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-28 06:14:53] [INFO ] Invariant cache hit.
[2024-05-28 06:14:53] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 68/133 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 100 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2903 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 68/133 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 167 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3948 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints]
After SMT, in 6915ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 6917ms
Starting structural reductions in LTL mode, iteration 1 : 65/70 places, 68/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7225 ms. Remains : 65/70 places, 68/73 transitions.
[2024-05-28 06:15:00] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:15:00] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:15:00] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-28 06:15:00] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:15:00] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:15:00] [INFO ] Time to serialize gal into /tmp/CTLFireability6980882713077249585.gal : 3 ms
[2024-05-28 06:15:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10181881330652823833.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/CTLFireability6980882713077249585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10181881330652823833.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,4.62116e+07,3.34309,67012,2,8005,5,277150,6,0,328,207870,0


Converting to forward existential form...Done !
original formula: AG(((((AX(((p21<1)||(l67<1))) + (s2<1)) + ((l128<1) + (E(((AF(((s1>=1)&&(l25>=1))) * (s1>=1)) * (l70>=1)) U EF(((s8>=1)&&(l0>=1)))) * EG(...387
=> equivalent forward existential formula: ([(EY((((FwdU(Init,TRUE) * !(((!((E(!(((s1>=1)&&(l209>=1))) U (!(((s1>=1)&&(l126>=1))) * !(((s1>=1)&&(l209>=1)))...707
Reverse transition relation is NOT exact ! Due to transitions t8, t19, t44, t48, t49, t50, t51, t52, t53, t54, t55, t57, t58, t59, t60, t61, t62, t64, t65,...259
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 06:15:30] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:15:30] [INFO ] Applying decomposition
[2024-05-28 06:15:30] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3961092784222238047.txt' '-o' '/tmp/graph3961092784222238047.bin' '-w' '/tmp/graph3961092784222238047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3961092784222238047.bin' '-l' '-1' '-v' '-w' '/tmp/graph3961092784222238047.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:15:30] [INFO ] Decomposing Gal with order
[2024-05-28 06:15:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:15:30] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-28 06:15:30] [INFO ] Flatten gal took : 73 ms
[2024-05-28 06:15:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 13 ms.
[2024-05-28 06:15:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8061550111132763169.gal : 6 ms
[2024-05-28 06:15:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15328371582638658754.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/CTLFireability8061550111132763169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15328371582638658754.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Applied a total of 16 rules in 7 ms. Remains 62 /70 variables (removed 8) and now considering 65/73 (removed 8) transitions.
// Phase 1: matrix 65 rows 62 cols
[2024-05-28 06:16:00] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 06:16:01] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 06:16:01] [INFO ] Invariant cache hit.
[2024-05-28 06:16:01] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-28 06:16:01] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-28 06:16:01] [INFO ] Invariant cache hit.
[2024-05-28 06:16:01] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:16:02] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 3 ms to minimize.
[2024-05-28 06:16:02] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/127 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 96 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2928 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/127 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 64/160 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 160 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3793 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 2/2 constraints]
After SMT, in 6763ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6765ms
Starting structural reductions in LTL mode, iteration 1 : 62/70 places, 65/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7013 ms. Remains : 62/70 places, 65/73 transitions.
[2024-05-28 06:16:07] [INFO ] Flatten gal took : 10 ms
[2024-05-28 06:16:08] [INFO ] Flatten gal took : 10 ms
[2024-05-28 06:16:08] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-28 06:16:08] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:16:08] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:16:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12551871488412157494.gal : 2 ms
[2024-05-28 06:16:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13043823866355976903.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/CTLFireability12551871488412157494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13043823866355976903.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32159e+08,3.85867,70120,2,8641,5,304728,6,0,313,247325,0


Converting to forward existential form...Done !
original formula: AF((((s6>=1)&&(l0>=1)) * ((EX((((((s2<1)||(l65<1))||((s1<1)||(l202<1)))&&(s1>=1))&&(l127>=1))) + EG(EX(((s1>=1)&&(l90>=1))))) + (EF(AG(((...253
=> equivalent forward existential formula: [FwdG(Init,!((((s6>=1)&&(l0>=1)) * ((EX((((((s2<1)||(l65<1))||((s1<1)||(l202<1)))&&(s1>=1))&&(l127>=1))) + EG(EX...316
Reverse transition relation is NOT exact ! Due to transitions t32, t43, t47, t48, t49, t50, t51, t52, t53, t54, t56, t57, t58, t59, t60, t62, t64, Interse...245
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 06:16:38] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:16:38] [INFO ] Applying decomposition
[2024-05-28 06:16:38] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17694748142200903891.txt' '-o' '/tmp/graph17694748142200903891.bin' '-w' '/tmp/graph17694748142200903891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17694748142200903891.bin' '-l' '-1' '-v' '-w' '/tmp/graph17694748142200903891.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:16:38] [INFO ] Decomposing Gal with order
[2024-05-28 06:16:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:16:38] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-28 06:16:38] [INFO ] Flatten gal took : 14 ms
[2024-05-28 06:16:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 5 ms.
[2024-05-28 06:16:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12811561923830123609.gal : 4 ms
[2024-05-28 06:16:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14488715564739278104.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/CTLFireability12811561923830123609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14488715564739278104.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 19 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-05-28 06:17:08] [INFO ] Computed 5 invariants in 5 ms
[2024-05-28 06:17:08] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 06:17:08] [INFO ] Invariant cache hit.
[2024-05-28 06:17:08] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:17:08] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-28 06:17:08] [INFO ] Invariant cache hit.
[2024-05-28 06:17:08] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 06:17:09] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-05-28 06:17:09] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/124 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 94 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2542 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/124 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 62/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 156 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3558 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints]
After SMT, in 6152ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 6153ms
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6414 ms. Remains : 61/70 places, 63/73 transitions.
[2024-05-28 06:17:14] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:17:14] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:17:14] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-28 06:17:14] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:17:14] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:17:14] [INFO ] Time to serialize gal into /tmp/CTLFireability642363846110411376.gal : 2 ms
[2024-05-28 06:17:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9556752763159265609.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/CTLFireability642363846110411376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9556752763159265609.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.2797e+08,5.1424,102012,2,8151,5,478331,6,0,307,311917,0


Converting to forward existential form...Done !
original formula: AF((E(((((EF(((s1>=1)&&(l126>=1))) * (s1>=1)) * ((l66>=1)&&(s1>=1))) * (l204>=1)) + EX(((p16>=1)&&(l0>=1)))) U (((!((s1>=1)&&(l204>=1)))&...206
=> equivalent forward existential formula: [FwdG(Init,!((E(((((E(TRUE U ((s1>=1)&&(l126>=1))) * (s1>=1)) * ((l66>=1)&&(s1>=1))) * (l204>=1)) + EX(((p16>=1)...263
Reverse transition relation is NOT exact ! Due to transitions t30, t41, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t56, t57, t58, t60, t62, Interse...245
Detected timeout of ITS tools.
[2024-05-28 06:17:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:17:44] [INFO ] Applying decomposition
[2024-05-28 06:17:44] [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/graph9720052886930914266.txt' '-o' '/tmp/graph9720052886930914266.bin' '-w' '/tmp/graph9720052886930914266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9720052886930914266.bin' '-l' '-1' '-v' '-w' '/tmp/graph9720052886930914266.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:17:44] [INFO ] Decomposing Gal with order
[2024-05-28 06:17:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:17:44] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-28 06:17:44] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:17:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 3 ms.
[2024-05-28 06:17:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3709219709508416575.gal : 2 ms
[2024-05-28 06:17:44] [INFO ] Time to serialize properties into /tmp/CTLFireability9572964200601333898.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/CTLFireability3709219709508416575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9572964200601333898.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.2797e+08,19.013,416808,2855,482,272441,54458,218,2.17068e+06,58,2.80917e+06,0


Converting to forward existential form...Done !
original formula: AF((E(((((EF(((i0.u0.s1>=1)&&(i0.u9.l126>=1))) * (i0.u0.s1>=1)) * ((u8.l66>=1)&&(i0.u0.s1>=1))) * (u14.l204>=1)) + EX(((i5.u13.p16>=1)&&(...285
=> equivalent forward existential formula: [FwdG(Init,!((E(((((E(TRUE U ((i0.u0.s1>=1)&&(i0.u9.l126>=1))) * (i0.u0.s1>=1)) * ((u8.l66>=1)&&(i0.u0.s1>=1))) ...342
Reverse transition relation is NOT exact ! Due to transitions t30, t41, t47, t48, t49, t50, t51, t53, t57, t60, t62, i0.t56, i0.t55, i0.t54, i0.t45, Inter...247
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Applied a total of 16 rules in 11 ms. Remains 62 /70 variables (removed 8) and now considering 65/73 (removed 8) transitions.
// Phase 1: matrix 65 rows 62 cols
[2024-05-28 06:18:14] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 06:18:15] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 06:18:15] [INFO ] Invariant cache hit.
[2024-05-28 06:18:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:18:15] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-28 06:18:15] [INFO ] Invariant cache hit.
[2024-05-28 06:18:15] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:18:16] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 06:18:16] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/127 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 95 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2975 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/127 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 64/159 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 159 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3428 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 2/2 constraints]
After SMT, in 6474ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6476ms
Starting structural reductions in LTL mode, iteration 1 : 62/70 places, 65/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6724 ms. Remains : 62/70 places, 65/73 transitions.
[2024-05-28 06:18:21] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:18:21] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:18:21] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-28 06:18:21] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:18:21] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:18:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14742206725957856406.gal : 2 ms
[2024-05-28 06:18:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9610220056943785840.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/CTLFireability14742206725957856406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9610220056943785840.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,4.45089e+07,1.9111,36236,2,8675,5,139696,6,0,313,122424,0


Converting to forward existential form...Done !
original formula: ((AX(AX(AG(((p11<1)||(l0<1))))) + EG(AG(((s1<1)||(l41<1))))) + A(AX(!(((s1>=1)&&(l234>=1)))) U !(E(E(((s1>=1)&&(l210>=1)) U ((p12>=1)&&(l...214
=> equivalent forward existential formula: [(FwdU(EY(EY(((Init * !(!((E(!(!(E(E(((s1>=1)&&(l210>=1)) U ((p12>=1)&&(l0>=1))) U !((((p10>=1)&&(l0>=1))||((s1>...519
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t52, t54, t55, t56, t57, t58, t59, t60, t62, t64, Interse...245
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,25.2068,429728,1,0,940,2.42611e+06,177,582,2268,1.77528e+06,1005
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Applied a total of 14 rules in 7 ms. Remains 63 /70 variables (removed 7) and now considering 66/73 (removed 7) transitions.
// Phase 1: matrix 66 rows 63 cols
[2024-05-28 06:18:47] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 06:18:47] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 06:18:47] [INFO ] Invariant cache hit.
[2024-05-28 06:18:47] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-28 06:18:47] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-28 06:18:47] [INFO ] Invariant cache hit.
[2024-05-28 06:18:47] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:18:48] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-28 06:18:48] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/129 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 97 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/129 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 162 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3283 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
After SMT, in 6520ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 6522ms
Starting structural reductions in LTL mode, iteration 1 : 63/70 places, 66/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6830 ms. Remains : 63/70 places, 66/73 transitions.
[2024-05-28 06:18:53] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:18:53] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:18:53] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-28 06:18:53] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:18:53] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:18:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9090527222857926552.gal : 1 ms
[2024-05-28 06:18:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5118682773285623737.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/CTLFireability9090527222857926552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5118682773285623737.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,4.62116e+07,1.77721,35392,2,8449,5,136997,6,0,318,115439,0


Converting to forward existential form...Done !
original formula: AX((((AF(((s1>=1)&&(l210>=1))) + (s1<1)) + ((l129<1)||((s1>=1)&&(l41>=1)))) * (E((((s1>=1)&&(l127>=1))||((s1>=1)&&(l70>=1))) U ((s2>=1)&&...242
=> equivalent forward existential formula: ([FwdG(((EY(Init) * !(((l129<1)||((s1>=1)&&(l41>=1))))) * !((s1<1))),!(((s1>=1)&&(l210>=1))))] = FALSE * [((EY(I...441
Reverse transition relation is NOT exact ! Due to transitions t43, t47, t48, t49, t50, t51, t52, t53, t54, t56, t57, t58, t59, t60, t61, t63, t65, Interse...245
(forward)formula 0,0,13.9003,270908,1,0,557,1.5583e+06,166,238,2210,980927,680
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 14 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:19:08] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:19:08] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 06:19:08] [INFO ] Invariant cache hit.
[2024-05-28 06:19:08] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:19:08] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-28 06:19:08] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:19:08] [INFO ] Invariant cache hit.
[2024-05-28 06:19:08] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:19:09] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
[2024-05-28 06:19:09] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 93 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2796 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 154 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3284 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 2/2 constraints]
After SMT, in 6126ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 6127ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/70 places, 62/73 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6437 ms. Remains : 60/70 places, 62/73 transitions.
[2024-05-28 06:19:14] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:19:14] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:19:14] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-28 06:19:14] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:19:14] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:19:14] [INFO ] Time to serialize gal into /tmp/CTLFireability16383627557227457564.gal : 3 ms
[2024-05-28 06:19:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8718130710609223976.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/CTLFireability16383627557227457564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8718130710609223976.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.2797e+08,4.08385,73036,2,8462,5,334775,6,0,302,277178,0


Converting to forward existential form...Done !
original formula: EF((((AF(((p18>=1)&&(l114>=1))) * EF(((s1>=1)&&(l234>=1)))) * ((s1>=1)&&(l79>=1))) * ((EG(E(((s2>=1)&&(l65>=1)) U ((s1>=1)&&(l235>=1)))) ...203
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * ((!(EG(!(((p18>=1)&&(l114>=1))))) * E(TRUE U ((s1>=1)&&(l234>=1)))) * ((s1>=1)&&(l79>...414
Reverse transition relation is NOT exact ! Due to transitions t30, t41, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t56, t57, t59, t61, Intersection...240
Detected timeout of ITS tools.
[2024-05-28 06:19:44] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:19:44] [INFO ] Applying decomposition
[2024-05-28 06:19:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7082337650188889459.txt' '-o' '/tmp/graph7082337650188889459.bin' '-w' '/tmp/graph7082337650188889459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7082337650188889459.bin' '-l' '-1' '-v' '-w' '/tmp/graph7082337650188889459.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:19:44] [INFO ] Decomposing Gal with order
[2024-05-28 06:19:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:19:44] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-28 06:19:44] [INFO ] Flatten gal took : 30 ms
[2024-05-28 06:19:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 4 ms.
[2024-05-28 06:19:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17451639304040016031.gal : 2 ms
[2024-05-28 06:19:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5138358266815208897.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/CTLFireability17451639304040016031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5138358266815208897.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 67
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 62 transition count 64
Applied a total of 17 rules in 5 ms. Remains 62 /70 variables (removed 8) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 62 cols
[2024-05-28 06:20:14] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 06:20:14] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 06:20:14] [INFO ] Invariant cache hit.
[2024-05-28 06:20:14] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:20:14] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-28 06:20:14] [INFO ] Invariant cache hit.
[2024-05-28 06:20:14] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-28 06:20:15] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-28 06:20:15] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/126 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-28 06:20:17] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/126 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/126 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 96 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3486 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/126 variables, 62/70 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 26/96 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 63/159 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 159 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2135 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
After SMT, in 5659ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 5660ms
Starting structural reductions in LTL mode, iteration 1 : 62/70 places, 64/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5886 ms. Remains : 62/70 places, 64/73 transitions.
[2024-05-28 06:20:20] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:20:20] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:20:20] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-28 06:20:20] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:20:20] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:20:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13821974723216829132.gal : 2 ms
[2024-05-28 06:20:20] [INFO ] Time to serialize properties into /tmp/CTLFireability4031348875104239722.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/CTLFireability13821974723216829132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4031348875104239722.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,4.33358e+07,1.86066,43120,2,7351,5,185784,6,0,312,153277,0


Converting to forward existential form...Done !
original formula: A((((s1>=1)&&(l202>=1)) + (((p12>=1)&&(l0>=1)) * (!(((p20>=1)&&(l0>=1))) + A((!(((s4>=1)&&(l0>=1))) * AX(((s1>=1)&&(l63>=1)))) U ((A(((s1...349
=> equivalent forward existential formula: [((Init * !(EG(!(((E(TRUE U EG((((s1>=1)&&(l110>=1))||((s1>=1)&&(l234>=1))))) + ((s1>=1)&&(l202>=1))) + ((s1>=1)...1062
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t21, t41, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t56, t57, t58, t60, t61, ...258
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 06:20:50] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:20:50] [INFO ] Applying decomposition
[2024-05-28 06:20:50] [INFO ] Flatten gal took : 3 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/graph8054623500755660134.txt' '-o' '/tmp/graph8054623500755660134.bin' '-w' '/tmp/graph8054623500755660134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8054623500755660134.bin' '-l' '-1' '-v' '-w' '/tmp/graph8054623500755660134.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:20:50] [INFO ] Decomposing Gal with order
[2024-05-28 06:20:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:20:50] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-28 06:20:50] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:20:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 4 ms.
[2024-05-28 06:20:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14110189475134691426.gal : 2 ms
[2024-05-28 06:20:50] [INFO ] Time to serialize properties into /tmp/CTLFireability13296841424350930535.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/CTLFireability14110189475134691426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13296841424350930535.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 6 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-05-28 06:21:20] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:21:20] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 06:21:20] [INFO ] Invariant cache hit.
[2024-05-28 06:21:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:21:20] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-28 06:21:21] [INFO ] Invariant cache hit.
[2024-05-28 06:21:21] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 06:21:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:21:21] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/124 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 94 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1790 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/124 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 62/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 156 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2687 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints]
After SMT, in 4515ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 4517ms
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4734 ms. Remains : 61/70 places, 63/73 transitions.
[2024-05-28 06:21:25] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:21:25] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:21:25] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-28 06:21:25] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:21:25] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:21:25] [INFO ] Time to serialize gal into /tmp/CTLFireability10709226539417752316.gal : 2 ms
[2024-05-28 06:21:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16517337665552538182.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/CTLFireability10709226539417752316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16517337665552538182.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.33386e+07,2.97602,58852,2,8129,5,260889,6,0,307,181816,0


Converting to forward existential form...Done !
original formula: EG(((EX(((AX(((s1>=1)&&(l24>=1))) + ((s1>=1)&&(l5>=1))) + ((s1>=1)&&(l202>=1)))) + AX(AX(((p19<1)||(l0<1))))) + (AX((EG(((s1<1)||(l112<1)...236
=> equivalent forward existential formula: [FwdG(Init,((EX(((!(EX(!(((s1>=1)&&(l24>=1))))) + ((s1>=1)&&(l5>=1))) + ((s1>=1)&&(l202>=1)))) + !(EX(!(!(EX(!((...303
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t10, t41, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t56, t57, t59, t60, t62, ...253
Detected timeout of ITS tools.
[2024-05-28 06:21:55] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:21:55] [INFO ] Applying decomposition
[2024-05-28 06:21:55] [INFO ] Flatten gal took : 3 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/graph11847423300263189814.txt' '-o' '/tmp/graph11847423300263189814.bin' '-w' '/tmp/graph11847423300263189814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11847423300263189814.bin' '-l' '-1' '-v' '-w' '/tmp/graph11847423300263189814.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:21:55] [INFO ] Decomposing Gal with order
[2024-05-28 06:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:21:55] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-28 06:21:55] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:21:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 6 ms.
[2024-05-28 06:21:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4079000085959164738.gal : 1 ms
[2024-05-28 06:21:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17902490628206541798.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/CTLFireability4079000085959164738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17902490628206541798.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.33386e+07,9.12465,155300,2049,422,215706,7363,224,466899,46,70550,0


Converting to forward existential form...Done !
original formula: EG(((EX(((AX(((i0.u0.s1>=1)&&(u3.l24>=1))) + ((i0.u0.s1>=1)&&(i1.u2.l5>=1))) + ((i0.u0.s1>=1)&&(i5.u12.l202>=1)))) + AX(AX(((i5.u11.p19<1...331
=> equivalent forward existential formula: [FwdG(Init,((EX(((!(EX(!(((i0.u0.s1>=1)&&(u3.l24>=1))))) + ((i0.u0.s1>=1)&&(i1.u2.l5>=1))) + ((i0.u0.s1>=1)&&(i5...398
Reverse transition relation is NOT exact ! Due to transitions t7, t41, t45, t46, t47, t48, t49, t51, t53, t54, t55, t56, t57, t59, t60, t62, i0.t50, i0.u0....257
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 4 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:22:25] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:22:25] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-28 06:22:25] [INFO ] Invariant cache hit.
[2024-05-28 06:22:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:22:26] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 06:22:26] [INFO ] Invariant cache hit.
[2024-05-28 06:22:26] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:22:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:22:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2288 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2529 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 2/2 constraints]
After SMT, in 4867ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4867ms
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 62/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5236 ms. Remains : 60/70 places, 62/73 transitions.
[2024-05-28 06:22:30] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:22:30] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:22:30] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-28 06:22:30] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:22:30] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:22:30] [INFO ] Time to serialize gal into /tmp/CTLFireability14936238059524753290.gal : 1 ms
[2024-05-28 06:22:30] [INFO ] Time to serialize properties into /tmp/CTLFireability9055382778257331507.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/CTLFireability14936238059524753290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9055382778257331507.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,4.33358e+07,2.15007,47020,2,8665,5,209175,6,0,302,177448,0


Converting to forward existential form...Done !
original formula: E(EG(!(((!(((s1>=1)&&(l129>=1))&&((p21>=1)&&(l67>=1))))&&((((s1>=1)&&(l234>=1))||((s1>=1)&&(l3>=1)))||(((p12>=1)&&(l0>=1))&&((p14>=1)&&(l...214
=> equivalent forward existential formula: [FwdG((FwdU(Init,EG(!(((!(((s1>=1)&&(l129>=1))&&((p21>=1)&&(l67>=1))))&&((((s1>=1)&&(l234>=1))||((s1>=1)&&(l3>=1...261
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t57, t59, t61, Intersection...240
Detected timeout of ITS tools.
[2024-05-28 06:23:01] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:23:01] [INFO ] Applying decomposition
[2024-05-28 06:23:01] [INFO ] Flatten gal took : 3 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/graph2356549935221449789.txt' '-o' '/tmp/graph2356549935221449789.bin' '-w' '/tmp/graph2356549935221449789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2356549935221449789.bin' '-l' '-1' '-v' '-w' '/tmp/graph2356549935221449789.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:23:01] [INFO ] Decomposing Gal with order
[2024-05-28 06:23:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:23:01] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-28 06:23:01] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:23:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 3 ms.
[2024-05-28 06:23:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12755219377074853024.gal : 1 ms
[2024-05-28 06:23:01] [INFO ] Time to serialize properties into /tmp/CTLFireability7842162622042266845.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/CTLFireability12755219377074853024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7842162622042266845.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.33358e+07,3.77601,94284,1595,376,63412,12801,211,565335,59,570604,0


Converting to forward existential form...Done !
original formula: E(EG(!(((!(((i5.u0.s1>=1)&&(i5.u9.l129>=1))&&((u13.p21>=1)&&(u4.l67>=1))))&&((((i5.u0.s1>=1)&&(i7.u12.l234>=1))||((i5.u0.s1>=1)&&(u1.l3>=...288
=> equivalent forward existential formula: [FwdG((FwdU(Init,EG(!(((!(((i5.u0.s1>=1)&&(i5.u9.l129>=1))&&((u13.p21>=1)&&(u4.l67>=1))))&&((((i5.u0.s1>=1)&&(i7...335
Reverse transition relation is NOT exact ! Due to transitions t40, t46, t47, t48, t49, t50, t52, t57, t59, t61, i5.t56, i5.t55, i5.t53, i5.t45, Intersecti...242
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 68
Applied a total of 10 rules in 7 ms. Remains 65 /70 variables (removed 5) and now considering 68/73 (removed 5) transitions.
// Phase 1: matrix 68 rows 65 cols
[2024-05-28 06:23:31] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:23:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 06:23:31] [INFO ] Invariant cache hit.
[2024-05-28 06:23:31] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 06:23:31] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-28 06:23:31] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2024-05-28 06:23:31] [INFO ] Invariant cache hit.
[2024-05-28 06:23:31] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 06:23:32] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:23:32] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 68/133 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 101 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2766 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 68/133 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 168 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2875 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints]
After SMT, in 5685ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 5686ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/70 places, 68/73 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6092 ms. Remains : 65/70 places, 68/73 transitions.
[2024-05-28 06:23:37] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:23:37] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:23:37] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-28 06:23:37] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:23:37] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:23:37] [INFO ] Time to serialize gal into /tmp/CTLFireability845230004982768513.gal : 4 ms
[2024-05-28 06:23:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10458159415814084851.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/CTLFireability845230004982768513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10458159415814084851.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.36673e+08,3.40344,68688,2,11260,5,280718,6,0,328,277847,0


Converting to forward existential form...Done !
original formula: (AF((((((AF(((s1>=1)&&(l204>=1))) + (s1<1)) + (l70<1)) * EG(((s8>=1)&&(l0>=1)))) * (((E(((p13>=1)&&(l0>=1)) U ((p14>=1)&&(l65>=1))) + ((s...271
=> equivalent forward existential formula: ([FwdG(Init,!((((((!(EG(!(((s1>=1)&&(l204>=1))))) + (s1<1)) + (l70<1)) * EG(((s8>=1)&&(l0>=1)))) * (((E(((p13>=1...342
Hit Full ! (commute/partial/dont) 2/0/66
(forward)formula 0,0,8.60233,138180,1,0,369,568345,20,3,1797,385898,367
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 4 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:23:45] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:23:45] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 06:23:46] [INFO ] Invariant cache hit.
[2024-05-28 06:23:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:23:46] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:23:46] [INFO ] Invariant cache hit.
[2024-05-28 06:23:46] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:23:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:23:46] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2393 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
After SMT, in 4686ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4688ms
Starting structural reductions in LTL mode, iteration 1 : 59/70 places, 61/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4886 ms. Remains : 59/70 places, 61/73 transitions.
[2024-05-28 06:23:50] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:23:50] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:23:50] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 06:23:50] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:23:50] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:23:50] [INFO ] Time to serialize gal into /tmp/CTLFireability18109238106749417242.gal : 1 ms
[2024-05-28 06:23:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10214694217388028221.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/CTLFireability18109238106749417242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10214694217388028221.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.33358e+07,2.6251,54668,2,7364,5,243041,6,0,297,149254,0


Converting to forward existential form...Done !
original formula: AX(EX(E(AG(!(((s1>=1)&&(l3>=1)))) U ((AF(((s1>=1)&&(l5>=1))) + AG(((s3>=1)&&(l0>=1)))) + ((s4>=1)&&(l0>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(!(E(TRUE U !(!(((s1>=1)&&(l3>=1)))))) U ((!(EG(!(((s1>=1)&&(l5>=1))))) + !(E(TRUE U !(((s3>=...206
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t58, t60, Intersection with...235
(forward)formula 0,0,12.3647,223900,1,0,493,1.29113e+06,157,210,2076,790629,604
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 3 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-05-28 06:24:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:24:03] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 06:24:03] [INFO ] Invariant cache hit.
[2024-05-28 06:24:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:24:03] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-28 06:24:03] [INFO ] Invariant cache hit.
[2024-05-28 06:24:03] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 06:24:04] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:24:04] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/124 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 06:24:04] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 95 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/124 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 62/157 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 157 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints]
After SMT, in 5090ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 5091ms
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5276 ms. Remains : 61/70 places, 63/73 transitions.
[2024-05-28 06:24:08] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:24:08] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:24:08] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-28 06:24:08] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:24:08] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:24:08] [INFO ] Time to serialize gal into /tmp/CTLFireability8661447822556287937.gal : 2 ms
[2024-05-28 06:24:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11465392878812762975.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/CTLFireability8661447822556287937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11465392878812762975.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,4.33358e+07,5.21469,88576,2,8012,5,383587,6,0,307,240647,0


Converting to forward existential form...Done !
original formula: AX(((AF(E(!(((p11<1)||(l0<1))) U ((s1>=1)&&(l127>=1)))) + ((p21>=1)&&(l67>=1))) + ((AG(((s1<1)||(l86<1))) * (s1>=1)) * (l21>=1))))
=> equivalent forward existential formula: (([(FwdU((EY(Init) * !((!(EG(!(E(!(((p11<1)||(l0<1))) U ((s1>=1)&&(l127>=1)))))) + ((p21>=1)&&(l67>=1))))),TRUE)...441
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t21, t41, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t56, t57, t58, t60, t62, ...253
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 06:24:38] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:24:38] [INFO ] Applying decomposition
[2024-05-28 06:24:38] [INFO ] Flatten gal took : 2 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/graph9593473058208606128.txt' '-o' '/tmp/graph9593473058208606128.bin' '-w' '/tmp/graph9593473058208606128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9593473058208606128.bin' '-l' '-1' '-v' '-w' '/tmp/graph9593473058208606128.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:24:38] [INFO ] Decomposing Gal with order
[2024-05-28 06:24:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:24:38] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-28 06:24:38] [INFO ] Flatten gal took : 24 ms
[2024-05-28 06:24:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 3 ms.
[2024-05-28 06:24:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13885153651718918688.gal : 1 ms
[2024-05-28 06:24:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10151163082392565454.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/CTLFireability13885153651718918688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10151163082392565454.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 06:25:08] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:25:08] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:25:08] [INFO ] Applying decomposition
[2024-05-28 06:25:08] [INFO ] Flatten gal took : 3 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/graph16429169418480226876.txt' '-o' '/tmp/graph16429169418480226876.bin' '-w' '/tmp/graph16429169418480226876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16429169418480226876.bin' '-l' '-1' '-v' '-w' '/tmp/graph16429169418480226876.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:25:08] [INFO ] Decomposing Gal with order
[2024-05-28 06:25:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:25:08] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-28 06:25:08] [INFO ] Flatten gal took : 11 ms
[2024-05-28 06:25:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 3 ms.
[2024-05-28 06:25:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5914062970001729948.gal : 11 ms
[2024-05-28 06:25:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8009848952942109179.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/CTLFireability5914062970001729948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8009848952942109179.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 8 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.36673e+08,549.79,2459608,2135,695,1.31992e+06,1.61443e+06,264,9.17951e+06,64,1.73582e+07,0


Converting to forward existential form...Done !
original formula: AG(((((AX(((i0.u14.p21<1)||(i3.u7.l67<1))) + (i0.u0.s2<1)) + ((i5.u8.l128<1) + (E(((AF(((i0.u0.s1>=1)&&(i3.u7.l25>=1))) * (i0.u0.s1>=1)) ...561
=> equivalent forward existential formula: ([(EY((((FwdU(Init,TRUE) * !(((!((E(!(((i0.u0.s1>=1)&&(i6.u12.l209>=1))) U (!(((i0.u0.s1>=1)&&(i5.u8.l126>=1))) ...955
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t14, t47, t51, t53, t54, t55, t56, t57, t58, t60, t62, t64, t65, t67, t72, i0.t69, i0...277
Detected timeout of ITS tools.
[2024-05-28 06:48:52] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:48:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8483555709559952443.gal : 1 ms
[2024-05-28 06:48:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1745095183002535157.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/CTLFireability8483555709559952443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1745095183002535157.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
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.36673e+08,2.91821,63572,2,9400,5,254620,6,0,353,239793,0


Converting to forward existential form...Done !
original formula: AG(((((AX(((p21<1)||(l67<1))) + (s2<1)) + ((l128<1) + (E(((AF(((s1>=1)&&(l25>=1))) * (s1>=1)) * (l70>=1)) U EF(((s8>=1)&&(l0>=1)))) * EG(...387
=> equivalent forward existential formula: ([(EY((((FwdU(Init,TRUE) * !(((!((E(!(((s1>=1)&&(l209>=1))) U (!(((s1>=1)&&(l126>=1))) * !(((s1>=1)&&(l209>=1)))...707
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t7, t8, t10, t20, t26, t36, t47, t51, t52, t53, t54, t55, t56, t57, t58, t60, t61, t6...296
Using saturation style SCC detection
(forward)formula 0,1,80.8703,1580632,1,0,3234,1.01068e+07,204,1226,2474,8.21918e+06,3836
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF((((s6>=1)&&(l0>=1)) * ((EX((((((s2<1)||(l65<1))||((s1<1)||(l202<1)))&&(s1>=1))&&(l127>=1))) + EG(EX(((s1>=1)&&(l90>=1))))) + (EF(AG(((...253
=> equivalent forward existential formula: [FwdG(Init,!((((s6>=1)&&(l0>=1)) * ((EX((((((s2<1)||(l65<1))||((s1<1)||(l202<1)))&&(s1>=1))&&(l127>=1))) + EG(EX...316
Using saturation style SCC detection
(forward)formula 1,0,146.877,2210700,1,0,4429,1.30117e+07,13,2032,1146,1.24697e+07,418
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((E(((((EF(((s1>=1)&&(l126>=1))) * (s1>=1)) * ((l66>=1)&&(s1>=1))) * (l204>=1)) + EX(((p16>=1)&&(l0>=1)))) U (((!((s1>=1)&&(l204>=1)))&...206
=> equivalent forward existential formula: [FwdG(Init,!((E(((((E(TRUE U ((s1>=1)&&(l126>=1))) * (s1>=1)) * ((l66>=1)&&(s1>=1))) * (l204>=1)) + EX(((p16>=1)...263
(forward)formula 2,0,190.17,2210700,1,0,4429,1.30117e+07,30,2032,1414,1.24697e+07,1507
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF((((AF(((p18>=1)&&(l114>=1))) * EF(((s1>=1)&&(l234>=1)))) * ((s1>=1)&&(l79>=1))) * ((EG(E(((s2>=1)&&(l65>=1)) U ((s1>=1)&&(l235>=1)))) ...203
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * ((!(EG(!(((p18>=1)&&(l114>=1))))) * E(TRUE U ((s1>=1)&&(l234>=1)))) * ((s1>=1)&&(l79>...414
(forward)formula 3,0,276.992,2434004,1,0,4429,1.34159e+07,33,2032,1297,1.39088e+07,1735
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A((((s1>=1)&&(l202>=1)) + (((p12>=1)&&(l0>=1)) * (!(((p20>=1)&&(l0>=1))) + A((!(((s4>=1)&&(l0>=1))) * AX(((s1>=1)&&(l63>=1)))) U ((A(((s1...349
=> equivalent forward existential formula: [((Init * !(EG(!(((E(TRUE U EG((((s1>=1)&&(l110>=1))||((s1>=1)&&(l234>=1))))) + ((s1>=1)&&(l202>=1))) + ((s1>=1)...1062
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 4,0,309.745,2434004,1,0,4429,1.34159e+07,66,2032,1365,1.39088e+07,3602
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EG(((EX(((AX(((s1>=1)&&(l24>=1))) + ((s1>=1)&&(l5>=1))) + ((s1>=1)&&(l202>=1)))) + AX(AX(((p19<1)||(l0<1))))) + (AX((EG(((s1<1)||(l112<1)...236
=> equivalent forward existential formula: [FwdG(Init,((EX(((!(EX(!(((s1>=1)&&(l24>=1))))) + ((s1>=1)&&(l5>=1))) + ((s1>=1)&&(l202>=1)))) + !(EX(!(!(EX(!((...303
(forward)formula 5,1,362.462,2610740,1,0,4987,1.49166e+07,84,2776,1501,1.53016e+07,5073
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E(EG(!(((!(((s1>=1)&&(l129>=1))&&((p21>=1)&&(l67>=1))))&&((((s1>=1)&&(l234>=1))||((s1>=1)&&(l3>=1)))||(((p12>=1)&&(l0>=1))&&((p14>=1)&&(l...214
=> equivalent forward existential formula: [FwdG((FwdU(Init,EG(!(((!(((s1>=1)&&(l129>=1))&&((p21>=1)&&(l67>=1))))&&((((s1>=1)&&(l234>=1))||((s1>=1)&&(l3>=1...261
(forward)formula 6,0,424.368,2666040,1,0,5219,1.5324e+07,23,2873,1360,1.56744e+07,2574
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(((AF(E(!(((p11<1)||(l0<1))) U ((s1>=1)&&(l127>=1)))) + ((p21>=1)&&(l67>=1))) + ((AG(((s1<1)||(l86<1))) * (s1>=1)) * (l21>=1))))
=> equivalent forward existential formula: (([(FwdU((EY(Init) * !((!(EG(!(E(!(((p11<1)||(l0<1))) U ((s1>=1)&&(l127>=1)))))) + ((p21>=1)&&(l67>=1))))),TRUE)...441
Using saturation style SCC detection
(forward)formula 7,0,457.258,2666040,1,0,5219,1.5324e+07,38,2873,1429,1.56744e+07,3708
FORMULA SieveSingleMsgMbox-PT-d0m18-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Total runtime 2552053 ms.

BK_STOP 1716879390432

--------------------
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="SieveSingleMsgMbox-PT-d0m18"
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 SieveSingleMsgMbox-PT-d0m18, 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 r378-smll-171683810600018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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