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.r202-smll-171649587900330.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 IBM319-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649587900330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Apr 22 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 06:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 06:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 13 06:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 06:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 184K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716776632364

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM319-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-27 02:23:54] [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-27 02:23:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 02:23:54] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-27 02:23:54] [INFO ] Transformed 253 places.
[2024-05-27 02:23:54] [INFO ] Transformed 178 transitions.
[2024-05-27 02:23:54] [INFO ] Found NUPN structural information;
[2024-05-27 02:23:54] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Support contains 126 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 43 places
Reduce places removed 51 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 201 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 199 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 199 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 199 transition count 175
Applied a total of 57 rules in 87 ms. Remains 199 /253 variables (removed 54) and now considering 175/178 (removed 3) transitions.
// Phase 1: matrix 175 rows 199 cols
[2024-05-27 02:23:55] [INFO ] Computed 36 invariants in 30 ms
[2024-05-27 02:23:55] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-27 02:23:55] [INFO ] Invariant cache hit.
[2024-05-27 02:23:56] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-27 02:23:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 175/373 variables, 198/234 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/374 variables, 1/235 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/235 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/235 constraints. Problems are: Problem set: 8 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 235 constraints, problems are : Problem set: 8 solved, 166 unsolved in 13057 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 35/35 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/35 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 2/188 variables, 1/36 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/36 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 168/356 variables, 188/224 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 158/382 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/382 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 8/364 variables, 6/388 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 8/396 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/396 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 4/368 variables, 2/398 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/398 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 12 (OVERLAPS) 5/373 variables, 2/400 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/373 variables, 0/400 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 14 (OVERLAPS) 1/374 variables, 1/401 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/374 variables, 0/401 constraints. Problems are: Problem set: 8 solved, 166 unsolved
At refinement iteration 16 (OVERLAPS) 0/374 variables, 0/401 constraints. Problems are: Problem set: 8 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 401 constraints, problems are : Problem set: 8 solved, 166 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 166/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 43221ms problems are : Problem set: 8 solved, 166 unsolved
Search for dead transitions found 8 dead transitions in 43256ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 199/253 places, 167/178 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 167
Deduced a syphon composed of 4 places in 2 ms
Applied a total of 2 rules in 13 ms. Remains 197 /199 variables (removed 2) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 197 cols
[2024-05-27 02:24:39] [INFO ] Computed 40 invariants in 7 ms
[2024-05-27 02:24:39] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-27 02:24:39] [INFO ] Invariant cache hit.
[2024-05-27 02:24:39] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 197/253 places, 167/178 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44601 ms. Remains : 197/253 places, 167/178 transitions.
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Support contains 114 out of 193 places after structural reductions.
[2024-05-27 02:24:40] [INFO ] Flatten gal took : 100 ms
[2024-05-27 02:24:40] [INFO ] Flatten gal took : 34 ms
[2024-05-27 02:24:40] [INFO ] Input system was already deterministic with 167 transitions.
Support contains 109 out of 193 places (down from 114) after GAL structural reductions.
FORMULA IBM319-PT-none-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (848 resets) in 2517 ms. (15 steps per ms) remains 6/71 properties
BEST_FIRST walk for 40001 steps (452 resets) in 291 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (468 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (445 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (451 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (519 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (479 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
// Phase 1: matrix 167 rows 193 cols
[2024-05-27 02:24:41] [INFO ] Computed 36 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 50/76 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/80 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 79/159 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 49/208 variables, 25/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 42/250 variables, 24/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 35/285 variables, 19/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/285 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 26/311 variables, 15/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/311 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/311 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 18/329 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 13/342 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 8/350 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/350 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 8/358 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/358 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/358 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 31 (OVERLAPS) 2/360 variables, 2/229 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/360 variables, 0/229 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/360 variables, 0/229 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 229 constraints, problems are : Problem set: 4 solved, 2 unsolved in 723 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/32 variables, 4/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/34 variables, 2/8 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/66 variables, 34/42 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/42 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/86 variables, 11/53 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 4/57 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 2/59 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 0/59 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 21/107 variables, 11/70 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 2/72 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/107 variables, 0/72 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 20/127 variables, 12/84 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/127 variables, 3/87 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/127 variables, 0/87 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 23/150 variables, 10/97 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/150 variables, 1/98 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/150 variables, 0/98 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 29/179 variables, 2/100 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/179 variables, 0/100 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 3/182 variables, 3/103 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/182 variables, 0/103 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 53/235 variables, 45/148 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/235 variables, 2/150 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/235 variables, 0/150 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 18/253 variables, 10/160 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/253 variables, 1/161 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/253 variables, 0/161 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 16/269 variables, 10/171 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/269 variables, 3/174 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/269 variables, 0/174 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 16/285 variables, 8/182 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/285 variables, 2/184 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/285 variables, 0/184 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 13/298 variables, 8/192 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/298 variables, 1/193 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/298 variables, 0/193 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 11/309 variables, 6/199 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/309 variables, 1/200 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/309 variables, 0/200 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 8/317 variables, 4/204 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/317 variables, 0/204 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 5/322 variables, 3/207 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/322 variables, 0/207 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 6/328 variables, 3/210 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/328 variables, 1/211 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/328 variables, 0/211 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 7/335 variables, 4/215 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/335 variables, 1/216 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/335 variables, 0/216 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 5/340 variables, 2/218 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/340 variables, 0/218 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 5/345 variables, 3/221 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/345 variables, 0/221 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 4/349 variables, 2/223 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/349 variables, 0/223 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 7/356 variables, 4/227 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/356 variables, 1/228 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/356 variables, 0/228 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp50 is UNSAT
After SMT solving in domain Int declared 360/360 variables, and 231 constraints, problems are : Problem set: 6 solved, 0 unsolved in 901 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1645ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
[2024-05-27 02:24:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 02:24:43] [INFO ] Flatten gal took : 23 ms
FORMULA IBM319-PT-none-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 02:24:43] [INFO ] Flatten gal took : 22 ms
[2024-05-27 02:24:43] [INFO ] Input system was already deterministic with 167 transitions.
Support contains 72 out of 193 places (down from 78) after GAL structural reductions.
Computed a total of 193 stabilizing places and 167 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 193 transition count 167
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Ensure Unique test removed 30 places
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 157 transition count 167
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 149 transition count 159
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 149 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 147 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 147 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 145 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 145 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 143 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 143 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 142 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 142 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 141 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 141 transition count 151
Applied a total of 68 rules in 75 ms. Remains 141 /193 variables (removed 52) and now considering 151/167 (removed 16) transitions.
// Phase 1: matrix 151 rows 141 cols
[2024-05-27 02:24:43] [INFO ] Computed 5 invariants in 3 ms
[2024-05-27 02:24:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 02:24:43] [INFO ] Invariant cache hit.
[2024-05-27 02:24:43] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 02:24:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 151/291 variables, 140/145 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 1/292 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 146 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8880 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 151/291 variables, 140/145 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 150/295 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 1/292 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 296 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9071 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 17987ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 17993ms
Starting structural reductions in LTL mode, iteration 1 : 141/193 places, 151/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18342 ms. Remains : 141/193 places, 151/167 transitions.
[2024-05-27 02:25:01] [INFO ] Flatten gal took : 15 ms
[2024-05-27 02:25:01] [INFO ] Flatten gal took : 14 ms
[2024-05-27 02:25:01] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-27 02:25:01] [INFO ] Flatten gal took : 14 ms
[2024-05-27 02:25:01] [INFO ] Flatten gal took : 13 ms
[2024-05-27 02:25:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5069670615254812661.gal : 9 ms
[2024-05-27 02:25:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10450801881905383247.ctl : 5 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/CTLFireability5069670615254812661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10450801881905383247.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,2089,0.070404,4412,2,482,5,3220,6,0,710,2768,0


Converting to forward existential form...Done !
original formula: A((!(EG(AX(!(((callToProcess_s00002802_output_s00001054==1)&&(callToProcess_s00002802_output_s00001077==1)))))) * !(((callToTask_s0000295...576
=> equivalent forward existential formula: [((Init * !(EG(!((((callToTask_s00002952_output_s00001054==1)&&(callToTask_s00002952_output_s00001077==1)) + ((c...1409
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t122, t135, t146, Intersection with reachable at each step ena...209
(forward)formula 0,0,1.56293,51356,1,0,771,303007,343,522,3923,281349,916
FORMULA IBM319-PT-none-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Ensure Unique test removed 33 places
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 154 transition count 167
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 143 transition count 156
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 143 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 140 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 140 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 138 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 138 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 136 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 136 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 135 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 135 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 134 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 134 transition count 147
Applied a total of 79 rules in 37 ms. Remains 134 /193 variables (removed 59) and now considering 147/167 (removed 20) transitions.
// Phase 1: matrix 147 rows 134 cols
[2024-05-27 02:25:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 02:25:03] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 02:25:03] [INFO ] Invariant cache hit.
[2024-05-27 02:25:03] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-27 02:25:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7065 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9091 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 16186ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 16191ms
Starting structural reductions in LTL mode, iteration 1 : 134/193 places, 147/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16442 ms. Remains : 134/193 places, 147/167 transitions.
[2024-05-27 02:25:20] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:25:20] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:25:20] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-27 02:25:20] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:25:20] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:25:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16761619245180230843.gal : 2 ms
[2024-05-27 02:25:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5540443089805792776.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/CTLFireability16761619245180230843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5540443089805792776.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,2038,0.044847,4452,2,444,5,2664,6,0,679,2255,0


Converting to forward existential form...Done !
original formula: AX(A(AX(EF((merge_s00002240_activated!=1))) U EX((AX((callToTask_s00002870_inputCriterion_s00001053_used==1)) * EG((fork_s00001298_activa...177
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(EX((!(EX(!((callToTask_s00002870_inputCriterion_s00001053_used==1)))) * EG((fork_s00001298_a...521
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,0.438303,17652,1,0,298,56091,318,142,3614,66927,432
FORMULA IBM319-PT-none-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Ensure Unique test removed 32 places
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 155 transition count 167
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 145 transition count 157
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 145 transition count 157
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 142 transition count 154
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 142 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 141 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 141 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 140 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 140 transition count 152
Applied a total of 68 rules in 22 ms. Remains 140 /193 variables (removed 53) and now considering 152/167 (removed 15) transitions.
// Phase 1: matrix 152 rows 140 cols
[2024-05-27 02:25:20] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 02:25:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-27 02:25:20] [INFO ] Invariant cache hit.
[2024-05-27 02:25:20] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-05-27 02:25:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 152/291 variables, 139/142 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 1/292 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 143 constraints, problems are : Problem set: 0 solved, 151 unsolved in 9112 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 152/291 variables, 139/142 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 151/293 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 1/292 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 294 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7731 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints]
After SMT, in 16863ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 16865ms
Starting structural reductions in LTL mode, iteration 1 : 140/193 places, 152/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17097 ms. Remains : 140/193 places, 152/167 transitions.
[2024-05-27 02:25:37] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:25:37] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:25:37] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-27 02:25:37] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:25:37] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:25:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13598535214759518064.gal : 1 ms
[2024-05-27 02:25:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17093619753747770188.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/CTLFireability13598535214759518064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17093619753747770188.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,2092,0.047705,4484,2,470,5,2819,6,0,708,2393,0


Converting to forward existential form...Done !
original formula: EG((AF(((AX((merge_s00002241_input_s00001052==1)) + EF(((callToProcess_s00002802_output_s00001054==1)&&(callToProcess_s00002802_output_s0...338
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(((!(EX(!((merge_s00002241_input_s00001052==1)))) + E(TRUE U ((callToProcess_s00002802_output_...411
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t136, t147, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,0.685129,21444,1,0,324,81142,337,161,4154,88061,470
FORMULA IBM319-PT-none-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Graph (complete) has 240 edges and 193 vertex of which 51 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.3 ms
Discarding 142 places :
Also discarding 124 output transitions
Drop transitions (Output transitions of discarded places.) removed 124 transitions
Ensure Unique test removed 9 places
Reduce places removed 10 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 41 transition count 17
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 54 place count 16 transition count 14
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 14 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 13 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 58 place count 13 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 64 place count 10 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 69 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 70 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 70 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 72 place count 6 transition count 6
Applied a total of 72 rules in 32 ms. Remains 6 /193 variables (removed 187) and now considering 6/167 (removed 161) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-27 02:25:38] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 02:25:38] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-27 02:25:38] [INFO ] Invariant cache hit.
[2024-05-27 02:25:38] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-27 02:25:38] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-27 02:25:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/12 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 63 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/12 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 61 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/193 places, 6/167 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 222 ms. Remains : 6/193 places, 6/167 transitions.
[2024-05-27 02:25:38] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:25:38] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:25:38] [INFO ] Input system was already deterministic with 6 transitions.
[2024-05-27 02:25:38] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:25:38] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:25:38] [INFO ] Time to serialize gal into /tmp/CTLFireability7501025951734237160.gal : 1 ms
[2024-05-27 02:25:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2638151587733990953.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/CTLFireability7501025951734237160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2638151587733990953.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,6,0.002611,3312,2,13,5,49,6,0,30,39,0


Converting to forward existential form...Done !
original formula: EG(AF(E(EF((callToTask_s00002870_inputCriterion_s00001053_used==1)) U EG(((callToTask_s00002965_output_s00001054==1)&&(callToTask_s000029...183
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(E(TRUE U (callToTask_s00002870_inputCriterion_s00001053_used==1)) U EG(((callToTask_s0000296...238
Reverse transition relation is NOT exact ! Due to transitions t1, t4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
dead was empty
(forward)formula 0,0,0.005576,3892,1,0,23,145,42,15,154,203,39
FORMULA IBM319-PT-none-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Ensure Unique test removed 30 places
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 157 transition count 167
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 147 transition count 157
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 147 transition count 157
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 144 transition count 154
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 144 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 142 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 142 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 141 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 141 transition count 151
Applied a total of 68 rules in 17 ms. Remains 141 /193 variables (removed 52) and now considering 151/167 (removed 16) transitions.
// Phase 1: matrix 151 rows 141 cols
[2024-05-27 02:25:38] [INFO ] Computed 5 invariants in 2 ms
[2024-05-27 02:25:38] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-27 02:25:38] [INFO ] Invariant cache hit.
[2024-05-27 02:25:39] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 02:25:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 151/291 variables, 140/145 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 1/292 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 146 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8627 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 151/291 variables, 140/145 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 150/295 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 1/292 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 296 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6936 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 15602ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 15606ms
Starting structural reductions in LTL mode, iteration 1 : 141/193 places, 151/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15830 ms. Remains : 141/193 places, 151/167 transitions.
[2024-05-27 02:25:54] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:25:54] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:25:54] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-27 02:25:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:25:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:25:54] [INFO ] Time to serialize gal into /tmp/CTLFireability16866623560607554078.gal : 2 ms
[2024-05-27 02:25:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11627189071334850407.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/CTLFireability16866623560607554078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11627189071334850407.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,2182,0.047138,4488,2,478,5,2759,6,0,711,2350,0


Converting to forward existential form...Done !
original formula: AX((AF(((callToTask_s00002667_output_s00001054==1)&&(callToTask_s00002667_output_s00001077==1))) + A(AF(((((decision_s00001841_activated=...474
=> equivalent forward existential formula: [FwdG((EY(Init) * !(!((E(!((!(E(TRUE U !((callToTask_s00002952_inputCriterion_s00001053_used==1)))) * !(EG(!(EG(...865
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t135, t146, Intersection with reachable at each step enabled. ...203
Hit Full ! (commute/partial/dont) 149/0/2
(forward)formula 0,0,0.557679,21440,1,0,314,77985,343,155,4077,85078,457
FORMULA IBM319-PT-none-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Graph (complete) has 240 edges and 193 vertex of which 146 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.4 ms
Discarding 47 places :
Also discarding 36 output transitions
Drop transitions (Output transitions of discarded places.) removed 36 transitions
Ensure Unique test removed 23 places
Reduce places removed 24 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 122 transition count 48
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 88 rules applied. Total rules applied 171 place count 40 transition count 42
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 176 place count 36 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 35 transition count 41
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 177 place count 35 transition count 28
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 204 place count 21 transition count 28
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 206 place count 20 transition count 27
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 209 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 210 place count 18 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 210 place count 18 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 212 place count 17 transition count 24
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 213 place count 16 transition count 23
Iterating global reduction 7 with 1 rules applied. Total rules applied 214 place count 16 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 215 place count 16 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 215 place count 16 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 217 place count 15 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 222 place count 15 transition count 16
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 224 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 226 place count 13 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 227 place count 12 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 227 place count 12 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 231 place count 10 transition count 12
Applied a total of 231 rules in 17 ms. Remains 10 /193 variables (removed 183) and now considering 12/167 (removed 155) transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-05-27 02:25:55] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 02:25:55] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-27 02:25:55] [INFO ] Invariant cache hit.
[2024-05-27 02:25:55] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-27 02:25:55] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-27 02:25:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 11/20 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 11 constraints, problems are : Problem set: 0 solved, 10 unsolved in 100 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 11/20 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 90 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 194ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/193 places, 12/167 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 280 ms. Remains : 10/193 places, 12/167 transitions.
[2024-05-27 02:25:55] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:25:55] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:25:55] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-27 02:25:55] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:25:55] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:25:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13089101953312465904.gal : 1 ms
[2024-05-27 02:25:55] [INFO ] Time to serialize properties into /tmp/CTLFireability7788879570486375812.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/CTLFireability13089101953312465904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7788879570486375812.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,14,0.003543,3360,2,24,5,108,6,0,50,86,0


Converting to forward existential form...Done !
original formula: EG(A(EF(!(((callToTask_s00002951_output_s00001054==1)&&(callToTask_s00002951_output_s00001077==1)))) U EG((merge_s00001161_activated==1))...157
=> equivalent forward existential formula: [FwdG(Init,!((E(!(EG((merge_s00001161_activated==1))) U (!(E(TRUE U !(((callToTask_s00002951_output_s00001054==1...303
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t9, t11, Intersection with reachable at each step enabled. (destroyed/reverse/in...179
dead was empty
(forward)formula 0,0,0.008492,3940,1,0,44,584,52,21,269,708,53
FORMULA IBM319-PT-none-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Ensure Unique test removed 32 places
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 155 transition count 167
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 144 transition count 156
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 144 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 141 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 141 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 139 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 139 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 137 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 137 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 136 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 136 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 135 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 135 transition count 147
Applied a total of 78 rules in 12 ms. Remains 135 /193 variables (removed 58) and now considering 147/167 (removed 20) transitions.
// Phase 1: matrix 147 rows 135 cols
[2024-05-27 02:25:55] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 02:25:55] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-27 02:25:55] [INFO ] Invariant cache hit.
[2024-05-27 02:25:55] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-27 02:25:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 138 constraints, problems are : Problem set: 0 solved, 146 unsolved in 6474 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 284 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7218 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 13708ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 13710ms
Starting structural reductions in LTL mode, iteration 1 : 135/193 places, 147/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13885 ms. Remains : 135/193 places, 147/167 transitions.
[2024-05-27 02:26:09] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:26:09] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:26:09] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-27 02:26:09] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:26:09] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:26:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13149690560219224085.gal : 2 ms
[2024-05-27 02:26:09] [INFO ] Time to serialize properties into /tmp/CTLFireability11114115985278344655.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/CTLFireability13149690560219224085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11114115985278344655.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,2038,0.075363,4460,2,519,5,3020,6,0,683,2665,0


Converting to forward existential form...Done !
original formula: EX(AF(EG(((callToTask_s00002824_inputCriterion_s00001053_used==1)||((callToTask_s00001852_output_s00001054==1)&&(callToTask_s00001852_out...177
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(((callToTask_s00002824_inputCriterion_s00001053_used==1)||((callToTask_s00001852_output_s...228
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,0.804125,21428,1,0,308,80838,320,146,3642,84840,444
FORMULA IBM319-PT-none-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Ensure Unique test removed 31 places
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 156 transition count 167
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 145 transition count 156
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 145 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 142 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 142 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 141 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 141 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 140 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 140 transition count 151
Applied a total of 69 rules in 8 ms. Remains 140 /193 variables (removed 53) and now considering 151/167 (removed 16) transitions.
// Phase 1: matrix 151 rows 140 cols
[2024-05-27 02:26:10] [INFO ] Computed 4 invariants in 2 ms
[2024-05-27 02:26:10] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-27 02:26:10] [INFO ] Invariant cache hit.
[2024-05-27 02:26:10] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 02:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 151/290 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 1/291 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 144 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6788 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 151/290 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 150/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 1/291 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 294 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7273 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 14076ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 14079ms
Starting structural reductions in LTL mode, iteration 1 : 140/193 places, 151/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14251 ms. Remains : 140/193 places, 151/167 transitions.
[2024-05-27 02:26:24] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:26:24] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:26:24] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-27 02:26:24] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:26:24] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:26:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4157821423112440555.gal : 2 ms
[2024-05-27 02:26:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10032265289673179045.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/CTLFireability4157821423112440555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10032265289673179045.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,2050,0.045768,4488,2,590,5,3339,6,0,707,2679,0


Converting to forward existential form...Done !
original formula: A(!(AG(!((AG((callToTask_s00002952_inputCriterion_s00001053_used==1)) + !(EX(((callToTask_s00002964_output_s00001054==1)&&(callToTask_s00...659
=> equivalent forward existential formula: [((Init * !(EG(!((EX(!((!(!(EG(!((callToTask_s00002964_inputCriterion_s00001053_used==1))))) * ((merge_s00001160...2067
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t135, t146, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,1.59809,54272,1,0,818,329038,350,479,3901,278299,1045
FORMULA IBM319-PT-none-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Ensure Unique test removed 33 places
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 154 transition count 167
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 143 transition count 156
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 143 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 140 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 140 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 138 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 138 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 136 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 136 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 135 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 135 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 134 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 134 transition count 147
Applied a total of 79 rules in 17 ms. Remains 134 /193 variables (removed 59) and now considering 147/167 (removed 20) transitions.
// Phase 1: matrix 147 rows 134 cols
[2024-05-27 02:26:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 02:26:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-27 02:26:26] [INFO ] Invariant cache hit.
[2024-05-27 02:26:26] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-27 02:26:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 6576 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7820 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 14434ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 14439ms
Starting structural reductions in LTL mode, iteration 1 : 134/193 places, 147/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14656 ms. Remains : 134/193 places, 147/167 transitions.
[2024-05-27 02:26:40] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:26:40] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:26:40] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-27 02:26:40] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:26:40] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:26:40] [INFO ] Time to serialize gal into /tmp/CTLFireability13784530638629935135.gal : 1 ms
[2024-05-27 02:26:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1431036990956541709.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/CTLFireability13784530638629935135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1431036990956541709.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,2038,0.043663,4440,2,444,5,2664,6,0,679,2255,0


Converting to forward existential form...Done !
original formula: EX(EG(AF(((decision_s00003021_activated==1) + E((decision_s00003020_activated==1) U (decision_s00001159_activated==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG(!(((decision_s00003021_activated==1) + E((decision_s00003020_activated==1) U (decision_s0000...189
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
dead was empty
(forward)formula 0,0,0.835661,30224,1,0,500,155355,320,295,3485,152703,630
FORMULA IBM319-PT-none-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Ensure Unique test removed 32 places
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 155 transition count 167
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 144 transition count 156
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 144 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 141 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 141 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 139 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 139 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 137 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 137 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 136 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 136 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 135 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 135 transition count 147
Applied a total of 78 rules in 8 ms. Remains 135 /193 variables (removed 58) and now considering 147/167 (removed 20) transitions.
// Phase 1: matrix 147 rows 135 cols
[2024-05-27 02:26:41] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 02:26:41] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-27 02:26:41] [INFO ] Invariant cache hit.
[2024-05-27 02:26:41] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-27 02:26:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 138 constraints, problems are : Problem set: 0 solved, 146 unsolved in 8202 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 284 constraints, problems are : Problem set: 0 solved, 146 unsolved in 8486 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 16733ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 16735ms
Starting structural reductions in LTL mode, iteration 1 : 135/193 places, 147/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16915 ms. Remains : 135/193 places, 147/167 transitions.
[2024-05-27 02:26:58] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:26:58] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:26:58] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-27 02:26:58] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:26:58] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:26:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14686686165437962823.gal : 2 ms
[2024-05-27 02:26:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16917414772698814265.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/CTLFireability14686686165437962823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16917414772698814265.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,2038,0.061107,4448,2,439,5,2663,6,0,683,2171,0


Converting to forward existential form...Done !
original formula: A(((callToTask_s00002954_inputCriterion_s00001053_used==1) + ((merge_s00001061_activated==1) * !(((AF((fork_s00001403_activated_s00001073...423
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(EG(!((EX((decision_s00001126_activated==1)) * !(EX(!((merge_s00002238_activated==1))))...1425
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,1.18529,33392,1,0,527,180137,330,282,3754,164556,708
FORMULA IBM319-PT-none-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Ensure Unique test removed 29 places
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 158 transition count 167
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 147 transition count 156
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 147 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 144 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 144 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 142 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 142 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 140 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 140 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 139 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 139 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 138 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 138 transition count 147
Applied a total of 75 rules in 16 ms. Remains 138 /193 variables (removed 55) and now considering 147/167 (removed 20) transitions.
// Phase 1: matrix 147 rows 138 cols
[2024-05-27 02:26:59] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 02:27:00] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 02:27:00] [INFO ] Invariant cache hit.
[2024-05-27 02:27:00] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-27 02:27:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/284 variables, 137/143 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/285 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 144 constraints, problems are : Problem set: 0 solved, 146 unsolved in 8826 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/284 variables, 137/143 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 146/289 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/285 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 290 constraints, problems are : Problem set: 0 solved, 146 unsolved in 8892 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 17744ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 17747ms
Starting structural reductions in LTL mode, iteration 1 : 138/193 places, 147/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18030 ms. Remains : 138/193 places, 147/167 transitions.
[2024-05-27 02:27:17] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:27:17] [INFO ] Flatten gal took : 11 ms
[2024-05-27 02:27:18] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-27 02:27:18] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:27:18] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:27:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12863947438754565989.gal : 2 ms
[2024-05-27 02:27:18] [INFO ] Time to serialize properties into /tmp/CTLFireability15515781182514111705.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/CTLFireability12863947438754565989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15515781182514111705.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,2038,0.056575,4472,2,430,5,2603,6,0,695,2137,0


Converting to forward existential form...Done !
original formula: (EG(AF(((((callToTask_s00002965_input_s00001052==0)||(callToTask_s00002965_input_s00001066==0)) * A((callToTask_s00002965_inputCriterion_...864
=> equivalent forward existential formula: [(EY((((FwdU((Init * !(EG(!(EG(!(((((callToTask_s00002965_input_s00001052==0)||(callToTask_s00002965_input_s0000...1300
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,0.78234,19824,1,0,319,72677,341,156,4109,78299,457
FORMULA IBM319-PT-none-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Ensure Unique test removed 33 places
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 154 transition count 167
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 143 transition count 156
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 143 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 140 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 140 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 138 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 138 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 136 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 136 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 135 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 135 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 134 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 134 transition count 147
Applied a total of 79 rules in 14 ms. Remains 134 /193 variables (removed 59) and now considering 147/167 (removed 20) transitions.
// Phase 1: matrix 147 rows 134 cols
[2024-05-27 02:27:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 02:27:18] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 02:27:18] [INFO ] Invariant cache hit.
[2024-05-27 02:27:19] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-27 02:27:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 8279 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7595 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 15903ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 15907ms
Starting structural reductions in LTL mode, iteration 1 : 134/193 places, 147/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16196 ms. Remains : 134/193 places, 147/167 transitions.
[2024-05-27 02:27:35] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:27:35] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:27:35] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-27 02:27:35] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:27:35] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:27:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14725166306696459585.gal : 2 ms
[2024-05-27 02:27:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4582205754130178460.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/CTLFireability14725166306696459585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4582205754130178460.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,2038,0.074038,4444,2,444,5,2664,6,0,679,2255,0


Converting to forward existential form...Done !
original formula: EF((AX((decision_s00002948_activated==0)) * EG((fork_s00001298_activated_s00001075==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX(!((decision_s00002948_activated==0))))),(fork_s00001298_activated_s00001075==1))] ...163
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
dead was empty
(forward)formula 0,0,0.630436,17380,1,0,301,55493,314,142,3484,65382,434
FORMULA IBM319-PT-none-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Graph (complete) has 240 edges and 193 vertex of which 152 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 31 output transitions
Drop transitions (Output transitions of discarded places.) removed 31 transitions
Ensure Unique test removed 25 places
Reduce places removed 26 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 126 transition count 46
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 98 rules applied. Total rules applied 188 place count 37 transition count 37
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 194 place count 31 transition count 37
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 194 place count 31 transition count 24
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 222 place count 16 transition count 24
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 224 place count 15 transition count 23
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 227 place count 14 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 13 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 228 place count 13 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 12 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 235 place count 12 transition count 15
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 237 place count 12 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 239 place count 10 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 239 place count 10 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 243 place count 8 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 244 place count 8 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 244 place count 8 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 246 place count 7 transition count 9
Applied a total of 246 rules in 16 ms. Remains 7 /193 variables (removed 186) and now considering 9/167 (removed 158) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-27 02:27:35] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 02:27:35] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-27 02:27:35] [INFO ] Invariant cache hit.
[2024-05-27 02:27:35] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-27 02:27:35] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-27 02:27:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/14 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 7 unsolved in 103 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/14 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 92 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 202ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/193 places, 9/167 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 274 ms. Remains : 7/193 places, 9/167 transitions.
[2024-05-27 02:27:35] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:27:35] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:27:35] [INFO ] Input system was already deterministic with 9 transitions.
[2024-05-27 02:27:35] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:27:35] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 173 steps (54 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
FORMULA IBM319-PT-none-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-27 02:27:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14832583472321900689.gal : 0 ms
[2024-05-27 02:27:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11396474314889567255.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14832583472321900689.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11396474314889567255.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 167/167 transitions.
Graph (complete) has 240 edges and 193 vertex of which 163 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Ensure Unique test removed 27 places
Reduce places removed 28 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 135 transition count 60
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 92 rules applied. Total rules applied 180 place count 49 transition count 54
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 188 place count 45 transition count 50
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 192 place count 41 transition count 50
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 192 place count 41 transition count 36
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 222 place count 25 transition count 36
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 224 place count 24 transition count 35
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 227 place count 23 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 228 place count 22 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 228 place count 22 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 230 place count 21 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 236 place count 21 transition count 26
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 237 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 239 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 240 place count 19 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 240 place count 19 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 246 place count 16 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 247 place count 16 transition count 20
Applied a total of 247 rules in 18 ms. Remains 16 /193 variables (removed 177) and now considering 20/167 (removed 147) transitions.
// Phase 1: matrix 20 rows 16 cols
[2024-05-27 02:27:36] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 02:27:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-27 02:27:36] [INFO ] Invariant cache hit.
[2024-05-27 02:27:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-27 02:27:36] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-27 02:27:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 19/34 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 17 constraints, problems are : Problem set: 0 solved, 18 unsolved in 302 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 19/34 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/36 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 265 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 574ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 575ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/193 places, 20/167 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 650 ms. Remains : 16/193 places, 20/167 transitions.
[2024-05-27 02:27:36] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:27:36] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:27:36] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-27 02:27:36] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:27:36] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:27:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10257902771504165932.gal : 1 ms
[2024-05-27 02:27:36] [INFO ] Time to serialize properties into /tmp/CTLFireability2647052235563143488.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/CTLFireability10257902771504165932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2647052235563143488.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,20,0.006364,3404,2,35,5,170,6,0,81,126,0


Converting to forward existential form...Done !
original formula: AG((AF(((AG((callToProcess_s00002499_inputCriterion_s00001053_used==1)) + (callToTask_s00002896_output_s00001054==0)) + (callToTask_s0000...285
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(E((decision_s00001840_activated==1) U (callToTask_s00002966_inputCriterion_s000010...352
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t12, t15, t17, t19, Intersection with reachable at each step enabled. (destroyed/rev...187
dead was empty
(forward)formula 0,1,0.01864,4132,1,0,58,924,74,27,448,1094,77
FORMULA IBM319-PT-none-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-27 02:27:36] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:27:36] [INFO ] Flatten gal took : 9 ms
Total runtime 222198 ms.

BK_STOP 1716776856794

--------------------
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="IBM319-PT-none"
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 IBM319-PT-none, 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 r202-smll-171649587900330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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