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-171649588000346.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 IBM703-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-171649588000346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K 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 66K 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.3K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K Apr 11 22:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 234K Apr 11 22:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 11 22:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 11 22:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K 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 203K 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 IBM703-PT-none-CTLFireability-2024-00
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-01
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-02
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-03
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-04
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-05
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-06
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-07
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-08
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-09
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-10
FORMULA_NAME IBM703-PT-none-CTLFireability-2024-11
FORMULA_NAME IBM703-PT-none-CTLFireability-2023-12
FORMULA_NAME IBM703-PT-none-CTLFireability-2023-13
FORMULA_NAME IBM703-PT-none-CTLFireability-2023-14
FORMULA_NAME IBM703-PT-none-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716777125131

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-27 02:32:07] [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:32:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 02:32:08] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2024-05-27 02:32:08] [INFO ] Transformed 262 places.
[2024-05-27 02:32:08] [INFO ] Transformed 284 transitions.
[2024-05-27 02:32:08] [INFO ] Found NUPN structural information;
[2024-05-27 02:32:08] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 565 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 183 ms.
Support contains 109 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 284
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 18 place count 244 transition count 272
Iterating global reduction 1 with 12 rules applied. Total rules applied 30 place count 244 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 243 transition count 271
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 243 transition count 271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 242 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 242 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 242 transition count 269
Applied a total of 35 rules in 158 ms. Remains 242 /262 variables (removed 20) and now considering 269/284 (removed 15) transitions.
// Phase 1: matrix 269 rows 242 cols
[2024-05-27 02:32:08] [INFO ] Computed 0 invariants in 23 ms
[2024-05-27 02:32:09] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-27 02:32:09] [INFO ] Invariant cache hit.
[2024-05-27 02:32:09] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-27 02:32:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 269/510 variables, 241/241 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 1/511 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 0/511 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 242 constraints, problems are : Problem set: 0 solved, 268 unsolved in 20421 ms.
Refiners :[State Equation: 242/242 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 269/510 variables, 241/241 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 268/509 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 1/511 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/511 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 510 constraints, problems are : Problem set: 0 solved, 268 unsolved in 23759 ms.
Refiners :[State Equation: 242/242 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 44354ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 44400ms
Starting structural reductions in LTL mode, iteration 1 : 242/262 places, 269/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45552 ms. Remains : 242/262 places, 269/284 transitions.
Support contains 109 out of 242 places after structural reductions.
[2024-05-27 02:32:54] [INFO ] Flatten gal took : 98 ms
[2024-05-27 02:32:54] [INFO ] Flatten gal took : 34 ms
[2024-05-27 02:32:54] [INFO ] Input system was already deterministic with 269 transitions.
RANDOM walk for 40000 steps (728 resets) in 3483 ms. (11 steps per ms) remains 8/100 properties
BEST_FIRST walk for 40001 steps (517 resets) in 408 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (496 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (461 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (501 resets) in 390 ms. (102 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (499 resets) in 309 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (498 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (462 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (506 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
[2024-05-27 02:32:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 46/67 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 93/160 variables, 43/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 92/252 variables, 44/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 83/335 variables, 43/151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 66/401 variables, 31/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 45/446 variables, 25/207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 33/479 variables, 17/224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 15/494 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/494 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 12/506 variables, 6/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/506 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 4/510 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/510 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 21 (OVERLAPS) 1/511 variables, 1/242 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/511 variables, 0/242 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/511 variables, 0/242 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 242 constraints, problems are : Problem set: 6 solved, 2 unsolved in 1063 ms.
Refiners :[State Equation: 242/242 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/45 variables, 12/17 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 2/19 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 39/84 variables, 16/35 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/35 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 49/133 variables, 23/58 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 58/191 variables, 25/83 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/83 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 62/253 variables, 30/113 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 0/113 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/313 variables, 28/141 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 0/141 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 46/359 variables, 25/166 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/359 variables, 0/166 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 33/392 variables, 16/182 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/392 variables, 0/182 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 33/425 variables, 15/197 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 0/197 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 30/455 variables, 16/213 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/455 variables, 0/213 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
After SMT solving in domain Int declared 476/511 variables, and 225 constraints, problems are : Problem set: 8 solved, 0 unsolved in 466 ms.
Refiners :[State Equation: 223/242 constraints, PredecessorRefiner: 2/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1549ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2024-05-27 02:32:58] [INFO ] Flatten gal took : 27 ms
[2024-05-27 02:32:58] [INFO ] Flatten gal took : 32 ms
[2024-05-27 02:32:58] [INFO ] Input system was already deterministic with 269 transitions.
Support contains 89 out of 242 places (down from 90) after GAL structural reductions.
Computed a total of 242 stabilizing places and 269 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 242 transition count 269
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA IBM703-PT-none-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 221 transition count 248
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 221 transition count 248
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 208 transition count 235
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 208 transition count 235
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 78 place count 198 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 88 place count 198 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 198 transition count 223
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 193 transition count 218
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 193 transition count 218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 188 transition count 213
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 188 transition count 213
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 183 transition count 208
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 183 transition count 208
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 125 place count 178 transition count 203
Iterating global reduction 1 with 5 rules applied. Total rules applied 130 place count 178 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 175 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 175 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 173 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 173 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 172 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 171 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 171 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 145 place count 171 transition count 195
Applied a total of 145 rules in 119 ms. Remains 171 /242 variables (removed 71) and now considering 195/269 (removed 74) transitions.
// Phase 1: matrix 195 rows 171 cols
[2024-05-27 02:32:58] [INFO ] Computed 0 invariants in 5 ms
[2024-05-27 02:32:58] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-27 02:32:58] [INFO ] Invariant cache hit.
[2024-05-27 02:32:58] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-27 02:32:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 195/365 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 1/366 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 0/366 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 171 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11432 ms.
Refiners :[State Equation: 171/171 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 195/365 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 194/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 1/366 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 365 constraints, problems are : Problem set: 0 solved, 194 unsolved in 13778 ms.
Refiners :[State Equation: 171/171 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 25239ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 25244ms
Starting structural reductions in LTL mode, iteration 1 : 171/242 places, 195/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25658 ms. Remains : 171/242 places, 195/269 transitions.
[2024-05-27 02:33:24] [INFO ] Flatten gal took : 19 ms
[2024-05-27 02:33:24] [INFO ] Flatten gal took : 18 ms
[2024-05-27 02:33:24] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-27 02:33:24] [INFO ] Flatten gal took : 16 ms
[2024-05-27 02:33:24] [INFO ] Flatten gal took : 20 ms
[2024-05-27 02:33:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1291913166829978467.gal : 10 ms
[2024-05-27 02:33:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3859928916824644446.ctl : 6 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/CTLFireability1291913166829978467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3859928916824644446.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,2334,0.146171,5368,2,650,5,5428,6,0,879,7555,0


Converting to forward existential form...Done !
original formula: AF(!(E((!(((task_s00000712_inputCriterion_s00000257_used!=1) * AX((merge_s00000449_input_s00000285==1)))) * ((AX((task_s00000718_output_s...304
=> equivalent forward existential formula: [FwdG(Init,!(!(E((!(((task_s00000712_inputCriterion_s00000257_used!=1) * !(EX(!((merge_s00000449_input_s00000285...361
Reverse transition relation is NOT exact ! Due to transitions t25, t26, t27, t28, t31, t32, t33, t39, t43, t45, t50, t53, t59, t67, t75, t84, t85, t91, t12...282
dead was empty
(forward)formula 0,1,1.74865,41992,1,0,538,212219,418,339,4502,204494,701
FORMULA IBM703-PT-none-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Graph (complete) has 270 edges and 242 vertex of which 199 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.3 ms
Discarding 43 places :
Also discarding 44 output transitions
Drop transitions (Output transitions of discarded places.) removed 44 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 198 transition count 81
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 167 rules applied. Total rules applied 311 place count 55 transition count 57
Reduce places removed 16 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 2 with 19 rules applied. Total rules applied 330 place count 39 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 332 place count 37 transition count 54
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 332 place count 37 transition count 48
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 344 place count 31 transition count 48
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 347 place count 28 transition count 44
Iterating global reduction 4 with 3 rules applied. Total rules applied 350 place count 28 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 350 place count 28 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 352 place count 27 transition count 43
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 353 place count 26 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 354 place count 26 transition count 41
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 355 place count 26 transition count 40
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 357 place count 25 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 365 place count 21 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 6 with 4 rules applied. Total rules applied 369 place count 21 transition count 31
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 372 place count 19 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 376 place count 19 transition count 26
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 3 rules applied. Total rules applied 379 place count 19 transition count 23
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 382 place count 16 transition count 23
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 383 place count 16 transition count 22
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 10 with 1 rules applied. Total rules applied 384 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 385 place count 15 transition count 21
Applied a total of 385 rules in 53 ms. Remains 15 /242 variables (removed 227) and now considering 21/269 (removed 248) transitions.
// Phase 1: matrix 21 rows 15 cols
[2024-05-27 02:33:26] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 02:33:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-27 02:33:26] [INFO ] Invariant cache hit.
[2024-05-27 02:33:26] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-27 02:33:26] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-27 02:33:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 15 constraints, problems are : Problem set: 0 solved, 18 unsolved in 224 ms.
Refiners :[State Equation: 15/15 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 33 constraints, problems are : Problem set: 0 solved, 18 unsolved in 198 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 431ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 431ms
Starting structural reductions in SI_CTL mode, iteration 1 : 15/242 places, 21/269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 565 ms. Remains : 15/242 places, 21/269 transitions.
[2024-05-27 02:33:26] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:33:26] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:33:26] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-27 02:33:26] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:33:26] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:33:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17715736188018376990.gal : 2 ms
[2024-05-27 02:33:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14630129721085938058.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/CTLFireability17715736188018376990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14630129721085938058.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,30,0.006319,3400,2,39,5,171,6,0,79,167,0


Converting to forward existential form...Done !
original formula: AG(EF((((task_s00000752_output_s00000264==0) * A((task_s00000732_input_s00000263==1) U (decision_s00000773_input_s00000263==1))) * (AG((t...259
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((task_s00000752_output_s00000264==0) * !((E(!((decision_s00000773_input_s000002...438
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t9, t11, t14, t17, t19, Intersection with reachable at each step enabled. (destroyed...191
(forward)formula 0,0,0.03575,4244,1,0,111,3301,77,62,439,3976,140
FORMULA IBM703-PT-none-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 220 transition count 247
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 220 transition count 247
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 57 place count 207 transition count 234
Iterating global reduction 0 with 13 rules applied. Total rules applied 70 place count 207 transition count 234
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 198 transition count 225
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 198 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 198 transition count 223
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 194 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 194 transition count 219
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 190 transition count 215
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 190 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 186 transition count 211
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 186 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 118 place count 182 transition count 207
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 182 transition count 207
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 179 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 179 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 177 transition count 202
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 177 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 176 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 176 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 175 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 175 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 137 place count 175 transition count 199
Applied a total of 137 rules in 91 ms. Remains 175 /242 variables (removed 67) and now considering 199/269 (removed 70) transitions.
// Phase 1: matrix 199 rows 175 cols
[2024-05-27 02:33:26] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 02:33:26] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-27 02:33:26] [INFO ] Invariant cache hit.
[2024-05-27 02:33:27] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-27 02:33:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/373 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/374 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/374 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 175 constraints, problems are : Problem set: 0 solved, 198 unsolved in 11499 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/373 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 198/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/374 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 373 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14870 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 26406ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 26412ms
Starting structural reductions in LTL mode, iteration 1 : 175/242 places, 199/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26758 ms. Remains : 175/242 places, 199/269 transitions.
[2024-05-27 02:33:53] [INFO ] Flatten gal took : 14 ms
[2024-05-27 02:33:53] [INFO ] Flatten gal took : 20 ms
[2024-05-27 02:33:53] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-27 02:33:53] [INFO ] Flatten gal took : 12 ms
[2024-05-27 02:33:53] [INFO ] Flatten gal took : 11 ms
[2024-05-27 02:33:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16300990414911839381.gal : 5 ms
[2024-05-27 02:33:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7537674973323386252.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/CTLFireability16300990414911839381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7537674973323386252.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,2755,0.111609,5244,2,673,5,5234,6,0,898,6218,0


Converting to forward existential form...Done !
original formula: AX((AF((((decision_s00000764_activated==1) * A((task_s00000753_input_s00000263==1) U (task_s00000754_inputCriterion_s00000257_used==1))) ...368
=> equivalent forward existential formula: ([FwdG(EY(Init),!((((decision_s00000764_activated==1) * !((E(!((task_s00000754_inputCriterion_s00000257_used==1)...870
Reverse transition relation is NOT exact ! Due to transitions t11, t27, t32, t33, t34, t35, t39, t40, t44, t45, t46, t51, t54, t55, t60, t68, t76, t89, t12...294
(forward)formula 0,0,2.13218,64056,1,0,656,343486,451,410,5268,345972,908
FORMULA IBM703-PT-none-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 219 transition count 246
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 219 transition count 246
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 209 transition count 236
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 209 transition count 236
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 203 transition count 230
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 203 transition count 230
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 199 transition count 226
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 199 transition count 226
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 195 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 195 transition count 222
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 191 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 191 transition count 218
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 188 transition count 215
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 188 transition count 215
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 186 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 186 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 184 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 184 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 183 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 183 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 182 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 182 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 121 place count 182 transition count 208
Applied a total of 121 rules in 45 ms. Remains 182 /242 variables (removed 60) and now considering 208/269 (removed 61) transitions.
// Phase 1: matrix 208 rows 182 cols
[2024-05-27 02:33:55] [INFO ] Computed 0 invariants in 3 ms
[2024-05-27 02:33:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-27 02:33:55] [INFO ] Invariant cache hit.
[2024-05-27 02:33:55] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2024-05-27 02:33:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 208/389 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 1/390 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 0/390 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 182 constraints, problems are : Problem set: 0 solved, 207 unsolved in 13459 ms.
Refiners :[State Equation: 182/182 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 208/389 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 207/388 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/389 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 1/390 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 0/390 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 389 constraints, problems are : Problem set: 0 solved, 207 unsolved in 15481 ms.
Refiners :[State Equation: 182/182 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
After SMT, in 28981ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 28993ms
Starting structural reductions in LTL mode, iteration 1 : 182/242 places, 208/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29233 ms. Remains : 182/242 places, 208/269 transitions.
[2024-05-27 02:34:24] [INFO ] Flatten gal took : 11 ms
[2024-05-27 02:34:25] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:34:25] [INFO ] Input system was already deterministic with 208 transitions.
[2024-05-27 02:34:25] [INFO ] Flatten gal took : 12 ms
[2024-05-27 02:34:25] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:34:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11235663536059739911.gal : 4 ms
[2024-05-27 02:34:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6816848443721666283.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/CTLFireability11235663536059739911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6816848443721666283.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,2449,0.155456,5816,2,696,5,6518,6,0,936,9183,0


Converting to forward existential form...Done !
original formula: EG((((AX((merge_s00000319_activated==1)) + AX(((task_s00000705_output_s00000264==1)||(task_s00000763_inputCriterion_s00000257_used==1))))...545
=> equivalent forward existential formula: [FwdG(Init,(((!(EX(!((merge_s00000319_activated==1)))) + !(EX(!(((task_s00000705_output_s00000264==1)||(task_s00...600
Reverse transition relation is NOT exact ! Due to transitions t21, t27, t32, t35, t36, t37, t42, t43, t47, t49, t54, t58, t63, t71, t79, t89, t146, t163, t...278
(forward)formula 0,1,1.27702,31928,1,0,367,115117,440,201,5160,139522,541
FORMULA IBM703-PT-none-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Graph (complete) has 270 edges and 242 vertex of which 216 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.3 ms
Discarding 26 places :
Also discarding 26 output transitions
Drop transitions (Output transitions of discarded places.) removed 26 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 162 rules applied. Total rules applied 163 place count 215 transition count 80
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 188 rules applied. Total rules applied 351 place count 54 transition count 53
Reduce places removed 18 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 2 with 21 rules applied. Total rules applied 372 place count 36 transition count 50
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 375 place count 34 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 376 place count 33 transition count 49
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 376 place count 33 transition count 40
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 394 place count 24 transition count 40
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 397 place count 21 transition count 36
Iterating global reduction 5 with 3 rules applied. Total rules applied 400 place count 21 transition count 36
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 401 place count 20 transition count 34
Iterating global reduction 5 with 1 rules applied. Total rules applied 402 place count 20 transition count 34
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 1 rules applied. Total rules applied 403 place count 20 transition count 33
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 405 place count 19 transition count 32
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 413 place count 15 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 7 rules applied. Total rules applied 420 place count 15 transition count 21
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 426 place count 12 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 427 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 429 place count 11 transition count 16
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 10 with 1 rules applied. Total rules applied 430 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 431 place count 10 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 432 place count 10 transition count 15
Applied a total of 432 rules in 36 ms. Remains 10 /242 variables (removed 232) and now considering 15/269 (removed 254) transitions.
// Phase 1: matrix 15 rows 10 cols
[2024-05-27 02:34:26] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 02:34:26] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-27 02:34:26] [INFO ] Invariant cache hit.
[2024-05-27 02:34:26] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-27 02:34:26] [INFO ] Redundant transitions in 1 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-27 02:34:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 14/23 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 2/25 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 10 constraints, problems are : Problem set: 0 solved, 13 unsolved in 192 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 14/23 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2/25 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 23 constraints, problems are : Problem set: 0 solved, 13 unsolved in 181 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 380ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/242 places, 15/269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 480 ms. Remains : 10/242 places, 15/269 transitions.
[2024-05-27 02:34:26] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:34:26] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:34:26] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-27 02:34:26] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:34:26] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:34:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7490980308169148192.gal : 1 ms
[2024-05-27 02:34:26] [INFO ] Time to serialize properties into /tmp/CTLFireability10154719198359924755.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/CTLFireability7490980308169148192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10154719198359924755.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,15,0.004748,3360,2,24,5,100,6,0,53,73,0


Converting to forward existential form...Done !
original formula: AG(A(AF((decision_s00000774_activated==1)) U (EF((task_s00000728_input_s00000263==1)) + AF((task_s00000735_output_s00000264!=1)))))
=> equivalent forward existential formula: ([FwdG(((FwdU(FwdU(Init,TRUE),!((E(TRUE U (task_s00000728_input_s00000263==1)) + !(EG(!((task_s00000735_output_s...460
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t12, t13, t14, Intersection with reachable at each step enabled. (destroyed/...189
dead was empty
dead was empty
(forward)formula 0,1,0.014044,3940,1,0,58,706,67,31,289,872,72
FORMULA IBM703-PT-none-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Graph (complete) has 270 edges and 242 vertex of which 72 are kept as prefixes of interest. Removing 170 places using SCC suffix rule.2 ms
Discarding 170 places :
Also discarding 186 output transitions
Drop transitions (Output transitions of discarded places.) removed 186 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 71 transition count 27
Reduce places removed 54 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 57 rules applied. Total rules applied 113 place count 17 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 15 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 115 place count 15 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 11 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 11 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 10 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 128 place count 10 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 130 place count 9 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 9 transition count 12
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 5 with 2 rules applied. Total rules applied 134 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 136 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 137 place count 7 transition count 9
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 138 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 139 place count 6 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 140 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 141 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 142 place count 5 transition count 6
Applied a total of 142 rules in 13 ms. Remains 5 /242 variables (removed 237) and now considering 6/269 (removed 263) transitions.
// Phase 1: matrix 6 rows 5 cols
[2024-05-27 02:34:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 02:34:26] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-27 02:34:26] [INFO ] Invariant cache hit.
[2024-05-27 02:34:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-27 02:34:26] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-27 02:34:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 73 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/11 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 83 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 159ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/242 places, 6/269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 232 ms. Remains : 5/242 places, 6/269 transitions.
[2024-05-27 02:34:27] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:34:27] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:34:27] [INFO ] Input system was already deterministic with 6 transitions.
[2024-05-27 02:34:27] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:34:27] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:34:27] [INFO ] Time to serialize gal into /tmp/CTLFireability1892961082599363528.gal : 1 ms
[2024-05-27 02:34:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10346590692216127547.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/CTLFireability1892961082599363528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10346590692216127547.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,6,0.003067,3304,2,10,5,43,6,0,26,33,0


Converting to forward existential form...Done !
original formula: EG(!(A(EF((task_s00000708_output_s00000264==1)) U (task_s00000730_output_s00000264==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((task_s00000730_output_s00000264==1)) U (!(E(TRUE U (task_s00000708_output_s00000264==1))) *...257
Reverse transition relation is NOT exact ! Due to transitions t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,1,0.0089,3884,1,0,39,248,43,40,126,341,79
FORMULA IBM703-PT-none-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 220 transition count 247
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 220 transition count 247
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 209 transition count 236
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 209 transition count 236
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 201 transition count 228
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 201 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 83 place count 201 transition count 227
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 197 transition count 223
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 197 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 194 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 194 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 191 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 191 transition count 217
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 189 transition count 215
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 189 transition count 215
Applied a total of 107 rules in 31 ms. Remains 189 /242 variables (removed 53) and now considering 215/269 (removed 54) transitions.
// Phase 1: matrix 215 rows 189 cols
[2024-05-27 02:34:27] [INFO ] Computed 0 invariants in 3 ms
[2024-05-27 02:34:27] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 02:34:27] [INFO ] Invariant cache hit.
[2024-05-27 02:34:27] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-27 02:34:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 215/403 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/404 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 0/404 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 189 constraints, problems are : Problem set: 0 solved, 214 unsolved in 13951 ms.
Refiners :[State Equation: 189/189 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 215/403 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 214/402 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 1/404 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/404 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 403 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15134 ms.
Refiners :[State Equation: 189/189 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 29129ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 29134ms
Starting structural reductions in LTL mode, iteration 1 : 189/242 places, 215/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29447 ms. Remains : 189/242 places, 215/269 transitions.
[2024-05-27 02:34:56] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:34:56] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:34:56] [INFO ] Input system was already deterministic with 215 transitions.
[2024-05-27 02:34:56] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:34:56] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:34:56] [INFO ] Time to serialize gal into /tmp/CTLFireability891684997400260817.gal : 2 ms
[2024-05-27 02:34:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15283673653948425823.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/CTLFireability891684997400260817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15283673653948425823.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,3545,0.097789,5860,2,829,5,6670,6,0,971,9074,0


Converting to forward existential form...Done !
original formula: EF(((A((task_s00000738_output_s00000264!=1) U (task_s00000753_input_s00000263==1)) + ((fork_s00000464_activated_s00000272==0) * ((EG((tas...536
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!((E(!((task_s00000753_input_s00000263==1)) U (!((task_s00000738_output_s00000264!=1)) *...1621
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t29, t33, t36, t37, t38, t43, t44, t48, t50, t55, t58, t59, t82, t87, t133, t147, t15...288
(forward)formula 0,0,3.22968,102436,1,0,1287,641187,483,748,4987,553758,1660
FORMULA IBM703-PT-none-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 220 transition count 247
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 220 transition count 247
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 57 place count 207 transition count 234
Iterating global reduction 0 with 13 rules applied. Total rules applied 70 place count 207 transition count 234
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 80 place count 197 transition count 224
Iterating global reduction 0 with 10 rules applied. Total rules applied 90 place count 197 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 197 transition count 222
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 193 transition count 218
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 193 transition count 218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 190 transition count 215
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 190 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 187 transition count 212
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 187 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 184 transition count 209
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 184 transition count 209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 183 transition count 208
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 183 transition count 208
Applied a total of 120 rules in 19 ms. Remains 183 /242 variables (removed 59) and now considering 208/269 (removed 61) transitions.
// Phase 1: matrix 208 rows 183 cols
[2024-05-27 02:34:59] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 02:34:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-27 02:34:59] [INFO ] Invariant cache hit.
[2024-05-27 02:35:00] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2024-05-27 02:35:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 208/390 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 1/391 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 0/391 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 183 constraints, problems are : Problem set: 0 solved, 207 unsolved in 13585 ms.
Refiners :[State Equation: 183/183 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 208/390 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 207/389 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 1/391 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 0/391 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 390 constraints, problems are : Problem set: 0 solved, 207 unsolved in 16154 ms.
Refiners :[State Equation: 183/183 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
After SMT, in 29760ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 29763ms
Starting structural reductions in LTL mode, iteration 1 : 183/242 places, 208/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30002 ms. Remains : 183/242 places, 208/269 transitions.
[2024-05-27 02:35:29] [INFO ] Flatten gal took : 13 ms
[2024-05-27 02:35:29] [INFO ] Flatten gal took : 15 ms
[2024-05-27 02:35:29] [INFO ] Input system was already deterministic with 208 transitions.
[2024-05-27 02:35:29] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:35:29] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:35:29] [INFO ] Time to serialize gal into /tmp/CTLFireability13135941329479953019.gal : 2 ms
[2024-05-27 02:35:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13273901026308747537.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/CTLFireability13135941329479953019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13273901026308747537.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,3486,0.108656,5292,2,675,5,5590,6,0,940,6963,0


Converting to forward existential form...Done !
original formula: (EX(AF(!(E((task_s00000759_inputCriterion_s00000257_used==1) U AF((task_s00000733_output_s00000264==1)))))) * AF((((task_s00000710_input_...310
=> equivalent forward existential formula: ([(Init * !(EX(!(EG(!(!(E((task_s00000759_inputCriterion_s00000257_used==1) U !(EG(!((task_s00000733_output_s000...528
Reverse transition relation is NOT exact ! Due to transitions t25, t28, t33, t34, t35, t40, t41, t45, t47, t52, t55, t56, t79, t85, t129, t143, t162, t171,...268
dead was empty
(forward)formula 0,1,2.30791,64508,1,0,703,376867,463,387,5158,336816,913
FORMULA IBM703-PT-none-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Graph (complete) has 270 edges and 242 vertex of which 217 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 25 output transitions
Drop transitions (Output transitions of discarded places.) removed 25 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 149 place count 216 transition count 95
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 166 rules applied. Total rules applied 315 place count 68 transition count 77
Reduce places removed 12 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 2 with 15 rules applied. Total rules applied 330 place count 56 transition count 74
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 3 with 10 rules applied. Total rules applied 340 place count 54 transition count 66
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 10 rules applied. Total rules applied 350 place count 46 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 351 place count 45 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 351 place count 45 transition count 56
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 367 place count 37 transition count 56
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 370 place count 34 transition count 52
Iterating global reduction 6 with 3 rules applied. Total rules applied 373 place count 34 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 374 place count 34 transition count 51
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 374 place count 34 transition count 49
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 378 place count 32 transition count 49
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 379 place count 31 transition count 47
Iterating global reduction 7 with 1 rules applied. Total rules applied 380 place count 31 transition count 47
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 381 place count 31 transition count 46
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 383 place count 30 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 393 place count 25 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 9 with 3 rules applied. Total rules applied 396 place count 25 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 397 place count 24 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 400 place count 24 transition count 34
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 11 with 2 rules applied. Total rules applied 402 place count 24 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 404 place count 22 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 405 place count 22 transition count 31
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 13 with 1 rules applied. Total rules applied 406 place count 22 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 407 place count 21 transition count 30
Applied a total of 407 rules in 29 ms. Remains 21 /242 variables (removed 221) and now considering 30/269 (removed 239) transitions.
// Phase 1: matrix 30 rows 21 cols
[2024-05-27 02:35:32] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 02:35:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-27 02:35:32] [INFO ] Invariant cache hit.
[2024-05-27 02:35:32] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-27 02:35:32] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
[2024-05-27 02:35:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 30/50 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 21 constraints, problems are : Problem set: 0 solved, 29 unsolved in 364 ms.
Refiners :[State Equation: 21/21 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 30/50 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 1/51 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 50 constraints, problems are : Problem set: 0 solved, 29 unsolved in 478 ms.
Refiners :[State Equation: 21/21 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 848ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 848ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/242 places, 30/269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 965 ms. Remains : 21/242 places, 30/269 transitions.
[2024-05-27 02:35:33] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:35:33] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:35:33] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-27 02:35:33] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:35:33] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:35:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15892079865334962520.gal : 1 ms
[2024-05-27 02:35:33] [INFO ] Time to serialize properties into /tmp/CTLFireability10111351930703598461.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/CTLFireability15892079865334962520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10111351930703598461.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,30,0.008524,3452,2,55,5,252,6,0,112,229,0


Converting to forward existential form...Done !
original formula: ((AF((EF(EG((task_s00000738_output_s00000264==0))) + (E((decision_s00000768_activated==1) U (callToProcess_s00000807_input_s00000263==1))...366
=> equivalent forward existential formula: (([FwdG(Init,!((E(TRUE U EG((task_s00000738_output_s00000264==0))) + (E((decision_s00000768_activated==1) U (cal...511
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t12, t16, t22, t26, t28, t29, Intersection with reachable at each step enabled. (de...198
(forward)formula 0,0,0.033698,4032,1,0,92,2924,88,50,650,3487,129
FORMULA IBM703-PT-none-CTLFireability-2024-09 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 : 242/242 places, 269/269 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 222 transition count 249
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 222 transition count 249
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 212 transition count 239
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 212 transition count 239
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 205 transition count 232
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 205 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 76 place count 205 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 204 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 204 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 203 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 203 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 202 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 202 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 201 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 201 transition count 226
Applied a total of 84 rules in 29 ms. Remains 201 /242 variables (removed 41) and now considering 226/269 (removed 43) transitions.
// Phase 1: matrix 226 rows 201 cols
[2024-05-27 02:35:33] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 02:35:33] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-27 02:35:33] [INFO ] Invariant cache hit.
[2024-05-27 02:35:33] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-27 02:35:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 226/426 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/427 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 0/427 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 201 constraints, problems are : Problem set: 0 solved, 225 unsolved in 13690 ms.
Refiners :[State Equation: 201/201 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 226/426 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 225/425 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/427 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 0/427 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 426 constraints, problems are : Problem set: 0 solved, 225 unsolved in 17614 ms.
Refiners :[State Equation: 201/201 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints]
After SMT, in 31342ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 31347ms
Starting structural reductions in LTL mode, iteration 1 : 201/242 places, 226/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31657 ms. Remains : 201/242 places, 226/269 transitions.
[2024-05-27 02:36:05] [INFO ] Flatten gal took : 14 ms
[2024-05-27 02:36:05] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:36:05] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-27 02:36:05] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:36:05] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:36:05] [INFO ] Time to serialize gal into /tmp/CTLFireability18110323694899404125.gal : 3 ms
[2024-05-27 02:36:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14546653312935335062.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/CTLFireability18110323694899404125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14546653312935335062.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,4520,0.110257,6448,2,912,5,8312,6,0,1030,11217,0


Converting to forward existential form...Done !
original formula: E((A((AX(AX((task_s00000707_input_s00000263==1))) * !(((merge_s00000457_activated!=1)||((task_s00000708_inputCriterion_s00000257_used==1)...739
=> equivalent forward existential formula: (([(((FwdU(Init,(!((E(!((!((E(!((task_s00000721_output_s00000264==1)) U (!((task_s00000731_inputCriterion_s00000...4256
Reverse transition relation is NOT exact ! Due to transitions t21, t26, t29, t35, t36, t37, t42, t43, t47, t49, t54, t57, t58, t82, t98, t134, t135, t156, ...279
(forward)formula 0,1,2.99572,83432,1,0,694,497220,494,397,5652,424145,941
FORMULA IBM703-PT-none-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Graph (complete) has 270 edges and 242 vertex of which 206 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 36 output transitions
Drop transitions (Output transitions of discarded places.) removed 36 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 155 rules applied. Total rules applied 156 place count 205 transition count 77
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 178 rules applied. Total rules applied 334 place count 51 transition count 53
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 18 rules applied. Total rules applied 352 place count 35 transition count 51
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 356 place count 33 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 32 transition count 49
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 357 place count 32 transition count 42
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 371 place count 25 transition count 42
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 373 place count 23 transition count 39
Iterating global reduction 5 with 2 rules applied. Total rules applied 375 place count 23 transition count 39
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 376 place count 22 transition count 38
Iterating global reduction 5 with 1 rules applied. Total rules applied 377 place count 22 transition count 38
Performed 6 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 389 place count 16 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 with 6 rules applied. Total rules applied 395 place count 16 transition count 25
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 398 place count 14 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 400 place count 13 transition count 23
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 7 with 2 rules applied. Total rules applied 402 place count 13 transition count 21
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 8 with 3 rules applied. Total rules applied 405 place count 12 transition count 19
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 9 with 3 rules applied. Total rules applied 408 place count 11 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 409 place count 10 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 411 place count 10 transition count 15
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 11 with 1 rules applied. Total rules applied 412 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 413 place count 9 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 414 place count 9 transition count 13
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 13 with 1 rules applied. Total rules applied 415 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 416 place count 8 transition count 12
Applied a total of 416 rules in 29 ms. Remains 8 /242 variables (removed 234) and now considering 12/269 (removed 257) transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-05-27 02:36:08] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 02:36:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-27 02:36:08] [INFO ] Invariant cache hit.
[2024-05-27 02:36:08] [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:36:08] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-27 02:36:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 8 constraints, problems are : Problem set: 0 solved, 10 unsolved in 114 ms.
Refiners :[State Equation: 8/8 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/20 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 118 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 235ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 236ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/242 places, 12/269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 323 ms. Remains : 8/242 places, 12/269 transitions.
[2024-05-27 02:36:08] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:36:08] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:36:08] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-27 02:36:08] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:36:08] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:36:08] [INFO ] Time to serialize gal into /tmp/CTLFireability3239357032419445989.gal : 1 ms
[2024-05-27 02:36:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12345588283432288081.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/CTLFireability3239357032419445989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12345588283432288081.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,9,0.003325,3340,2,16,5,71,6,0,43,50,0


Converting to forward existential form...Done !
original formula: AF((EG((decision_s00000774_activated==1)) + (decision_s00000803_activated==1)))
=> equivalent forward existential formula: [FwdG(Init,!((EG((decision_s00000774_activated==1)) + (decision_s00000803_activated==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...170
(forward)formula 0,0,0.007368,3656,1,0,36,327,49,26,211,455,49
FORMULA IBM703-PT-none-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Graph (complete) has 270 edges and 242 vertex of which 64 are kept as prefixes of interest. Removing 178 places using SCC suffix rule.0 ms
Discarding 178 places :
Also discarding 196 output transitions
Drop transitions (Output transitions of discarded places.) removed 196 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 63 transition count 21
Reduce places removed 50 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 53 rules applied. Total rules applied 105 place count 13 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 11 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 107 place count 11 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 8 transition count 15
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 7 transition count 13
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 7 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 6 transition count 12
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 120 place count 6 transition count 9
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 5 transition count 7
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 1 rules applied. Total rules applied 124 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 125 place count 4 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 126 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 126 place count 4 transition count 4
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 128 place count 3 transition count 4
Applied a total of 128 rules in 6 ms. Remains 3 /242 variables (removed 239) and now considering 4/269 (removed 265) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-27 02:36:08] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 02:36:08] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-27 02:36:08] [INFO ] Invariant cache hit.
[2024-05-27 02:36:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-27 02:36:08] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-27 02:36:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 36 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 43 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/242 places, 4/269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 132 ms. Remains : 3/242 places, 4/269 transitions.
[2024-05-27 02:36:08] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:36:08] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:36:08] [INFO ] Input system was already deterministic with 4 transitions.
[2024-05-27 02:36:08] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:36:08] [INFO ] Flatten gal took : 0 ms
[2024-05-27 02:36:08] [INFO ] Time to serialize gal into /tmp/CTLFireability1215168991937267010.gal : 0 ms
[2024-05-27 02:36:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10264597578332609064.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/CTLFireability1215168991937267010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10264597578332609064.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.002412,3292,2,6,5,21,6,0,16,15,0


Converting to forward existential form...Done !
original formula: AF(EG((callToProcess_s00000596_output_s00000264!=1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((callToProcess_s00000596_output_s00000264!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
dead was empty
(forward)formula 0,1,0.004029,3608,1,0,21,66,29,13,70,85,28
FORMULA IBM703-PT-none-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Graph (complete) has 270 edges and 242 vertex of which 136 are kept as prefixes of interest. Removing 106 places using SCC suffix rule.1 ms
Discarding 106 places :
Also discarding 115 output transitions
Drop transitions (Output transitions of discarded places.) removed 115 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 135 transition count 66
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 99 rules applied. Total rules applied 187 place count 48 transition count 54
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 197 place count 40 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 199 place count 38 transition count 52
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 199 place count 38 transition count 46
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 211 place count 32 transition count 46
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 213 place count 30 transition count 43
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 30 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 223 place count 26 transition count 39
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 2 rules applied. Total rules applied 225 place count 26 transition count 37
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 227 place count 25 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 229 place count 25 transition count 34
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 230 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 232 place count 24 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 233 place count 23 transition count 32
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 235 place count 23 transition count 32
Applied a total of 235 rules in 10 ms. Remains 23 /242 variables (removed 219) and now considering 32/269 (removed 237) transitions.
// Phase 1: matrix 32 rows 23 cols
[2024-05-27 02:36:08] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 02:36:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-27 02:36:08] [INFO ] Invariant cache hit.
[2024-05-27 02:36:08] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-27 02:36:08] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-27 02:36:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 32/54 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 23 constraints, problems are : Problem set: 0 solved, 31 unsolved in 403 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 32/54 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 31/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 1/55 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/55 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 54 constraints, problems are : Problem set: 0 solved, 31 unsolved in 437 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 846ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 847ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/242 places, 32/269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 927 ms. Remains : 23/242 places, 32/269 transitions.
[2024-05-27 02:36:09] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:36:09] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:36:09] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-27 02:36:09] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:36:09] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:36:09] [INFO ] Time to serialize gal into /tmp/CTLFireability176234881595156858.gal : 1 ms
[2024-05-27 02:36:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6140503232327135266.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/CTLFireability176234881595156858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6140503232327135266.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,30,0.006741,3472,2,55,5,248,6,0,118,182,0


Converting to forward existential form...Done !
original formula: (AF(!(E(!(A((decision_s00000783_input_s00000263==1) U (callToProcess_s00000808_output_s00000264==1))) U (task_s00000750_output_s00000264=...561
=> equivalent forward existential formula: (([(FwdU((Init * !(!(EG(!(!(E(!(!((E(!((callToProcess_s00000808_output_s00000264==1)) U (!((decision_s00000783_i...1737
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t6, t8, t9, t12, t13, t16, t25, t27, Intersection with reachable at each step enable...205
dead was empty
(forward)formula 0,1,0.041508,4844,1,0,167,5345,120,114,665,6323,232
FORMULA IBM703-PT-none-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 218 transition count 245
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 218 transition count 245
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 62 place count 204 transition count 231
Iterating global reduction 0 with 14 rules applied. Total rules applied 76 place count 204 transition count 231
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 86 place count 194 transition count 221
Iterating global reduction 0 with 10 rules applied. Total rules applied 96 place count 194 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 194 transition count 219
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 190 transition count 215
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 190 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 186 transition count 211
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 186 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 183 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 183 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 180 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 180 transition count 205
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 178 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 178 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 177 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 177 transition count 202
Applied a total of 132 rules in 36 ms. Remains 177 /242 variables (removed 65) and now considering 202/269 (removed 67) transitions.
// Phase 1: matrix 202 rows 177 cols
[2024-05-27 02:36:09] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 02:36:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-27 02:36:09] [INFO ] Invariant cache hit.
[2024-05-27 02:36:09] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-27 02:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 202/378 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/379 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 0/379 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 177 constraints, problems are : Problem set: 0 solved, 201 unsolved in 13064 ms.
Refiners :[State Equation: 177/177 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 202/378 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 201/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 1/379 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/379 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 378 constraints, problems are : Problem set: 0 solved, 201 unsolved in 14011 ms.
Refiners :[State Equation: 177/177 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 27102ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 27106ms
Starting structural reductions in LTL mode, iteration 1 : 177/242 places, 202/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27391 ms. Remains : 177/242 places, 202/269 transitions.
[2024-05-27 02:36:36] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:36:36] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:36:36] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-27 02:36:37] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:36:37] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:36:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11559064584065817029.gal : 3 ms
[2024-05-27 02:36:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14828010558974784695.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/CTLFireability11559064584065817029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14828010558974784695.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,3658,0.145484,5792,2,696,5,6533,6,0,910,8663,0


Converting to forward existential form...Done !
original formula: AG(((EF((task_s00000723_output_s00000264==0)) + (task_s00000749_inputCriterion_s00000257_used==0)) + (AF(((EF((task_s00000726_inputCriter...394
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !((E(TRUE U (task_s00000723_output_s00000264==0)) + (task_s00000749_inputCriterion_s00...617
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t27, t28, t29, t32, t34, t39, t40, t44, t46, t54, t55, t61, t69, t78, t122, t136, t...290
dead was empty
(forward)formula 0,1,2.72867,71112,1,0,744,423479,444,399,5000,357963,939
FORMULA IBM703-PT-none-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 269/269 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 221 transition count 248
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 221 transition count 248
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 208 transition count 235
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 208 transition count 235
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 199 transition count 226
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 199 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 199 transition count 225
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 194 transition count 220
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 194 transition count 220
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 189 transition count 215
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 189 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 111 place count 185 transition count 211
Iterating global reduction 1 with 4 rules applied. Total rules applied 115 place count 185 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 182 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 182 transition count 208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 180 transition count 206
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 180 transition count 206
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 178 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 178 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 177 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 177 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 176 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 176 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 134 place count 176 transition count 201
Applied a total of 134 rules in 23 ms. Remains 176 /242 variables (removed 66) and now considering 201/269 (removed 68) transitions.
// Phase 1: matrix 201 rows 176 cols
[2024-05-27 02:36:39] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 02:36:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 02:36:39] [INFO ] Invariant cache hit.
[2024-05-27 02:36:39] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-27 02:36:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 201/376 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 1/377 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/377 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 176 constraints, problems are : Problem set: 0 solved, 200 unsolved in 13118 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 201/376 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 1/377 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 376 constraints, problems are : Problem set: 0 solved, 200 unsolved in 13768 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 26916ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 26919ms
Starting structural reductions in LTL mode, iteration 1 : 176/242 places, 201/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27103 ms. Remains : 176/242 places, 201/269 transitions.
[2024-05-27 02:37:06] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:37:06] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:37:06] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-27 02:37:06] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:37:06] [INFO ] Flatten gal took : 15 ms
[2024-05-27 02:37:06] [INFO ] Time to serialize gal into /tmp/CTLFireability12518468860381804021.gal : 7 ms
[2024-05-27 02:37:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14634450152113424585.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/CTLFireability12518468860381804021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14634450152113424585.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,2652,0.102733,6048,2,877,5,7271,6,0,905,11269,0


Converting to forward existential form...Done !
original formula: AG(EF((AX(((A((task_s00000705_inputCriterion_s00000257_used==1) U (decision_s00000776_activated==1)) + (task_s00000738_output_s00000264==...328
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(EX(!(((!((E(!((decision_s00000776_activated==1)) U (!((task_s00000705_inputCri...501
Reverse transition relation is NOT exact ! Due to transitions t12, t24, t27, t28, t29, t30, t34, t35, t36, t37, t41, t42, t46, t48, t53, t56, t57, t62, t70...309
(forward)formula 0,1,2.3604,72712,1,0,683,409241,441,368,4971,376427,878
FORMULA IBM703-PT-none-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-27 02:37:09] [INFO ] Flatten gal took : 10 ms
[2024-05-27 02:37:09] [INFO ] Flatten gal took : 10 ms
Total runtime 301755 ms.

BK_STOP 1716777429409

--------------------
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="IBM703-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 IBM703-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-171649588000346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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