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.r550-tall-171734898500098.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 CO4-PT-13, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898500098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 191K Jun 2 16:33 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 CO4-PT-13-CTLFireability-2024-00
FORMULA_NAME CO4-PT-13-CTLFireability-2024-01
FORMULA_NAME CO4-PT-13-CTLFireability-2024-02
FORMULA_NAME CO4-PT-13-CTLFireability-2024-03
FORMULA_NAME CO4-PT-13-CTLFireability-2024-04
FORMULA_NAME CO4-PT-13-CTLFireability-2024-05
FORMULA_NAME CO4-PT-13-CTLFireability-2024-06
FORMULA_NAME CO4-PT-13-CTLFireability-2024-07
FORMULA_NAME CO4-PT-13-CTLFireability-2024-08
FORMULA_NAME CO4-PT-13-CTLFireability-2024-09
FORMULA_NAME CO4-PT-13-CTLFireability-2024-10
FORMULA_NAME CO4-PT-13-CTLFireability-2024-11
FORMULA_NAME CO4-PT-13-CTLFireability-2024-12
FORMULA_NAME CO4-PT-13-CTLFireability-2024-13
FORMULA_NAME CO4-PT-13-CTLFireability-2024-14
FORMULA_NAME CO4-PT-13-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717352057180

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:14:18] [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-06-02 18:14:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:14:18] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-06-02 18:14:18] [INFO ] Transformed 649 places.
[2024-06-02 18:14:18] [INFO ] Transformed 816 transitions.
[2024-06-02 18:14:18] [INFO ] Found NUPN structural information;
[2024-06-02 18:14:18] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 172 places in 11 ms
Reduce places removed 172 places and 227 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-13-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 589/589 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 585
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 97 place count 384 transition count 506
Iterating global reduction 1 with 77 rules applied. Total rules applied 174 place count 384 transition count 506
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 226 place count 332 transition count 444
Iterating global reduction 1 with 52 rules applied. Total rules applied 278 place count 332 transition count 444
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 281 place count 332 transition count 441
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 302 place count 311 transition count 417
Iterating global reduction 2 with 21 rules applied. Total rules applied 323 place count 311 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 324 place count 311 transition count 416
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 333 place count 302 transition count 406
Iterating global reduction 3 with 9 rules applied. Total rules applied 342 place count 302 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 343 place count 302 transition count 405
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 346 place count 299 transition count 402
Iterating global reduction 4 with 3 rules applied. Total rules applied 349 place count 299 transition count 402
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 350 place count 298 transition count 401
Iterating global reduction 4 with 1 rules applied. Total rules applied 351 place count 298 transition count 401
Applied a total of 351 rules in 112 ms. Remains 298 /477 variables (removed 179) and now considering 401/589 (removed 188) transitions.
// Phase 1: matrix 401 rows 298 cols
[2024-06-02 18:14:18] [INFO ] Computed 6 invariants in 24 ms
[2024-06-02 18:14:19] [INFO ] Implicit Places using invariants in 258 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 294 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/477 places, 401/589 transitions.
Applied a total of 0 rules in 5 ms. Remains 297 /297 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 427 ms. Remains : 297/477 places, 401/589 transitions.
Support contains 64 out of 297 places after structural reductions.
[2024-06-02 18:14:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:14:19] [INFO ] Flatten gal took : 59 ms
FORMULA CO4-PT-13-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:14:19] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:14:19] [INFO ] Input system was already deterministic with 401 transitions.
Support contains 52 out of 297 places (down from 64) after GAL structural reductions.
RANDOM walk for 40000 steps (530 resets) in 1794 ms. (22 steps per ms) remains 22/44 properties
BEST_FIRST walk for 4002 steps (23 resets) in 61 ms. (64 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (26 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (26 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (26 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (26 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (27 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (27 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (26 resets) in 29 ms. (133 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (21 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (27 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (24 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (31 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (24 resets) in 15 ms. (250 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4001 steps (26 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
// Phase 1: matrix 401 rows 297 cols
[2024-06-02 18:14:20] [INFO ] Computed 5 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 20/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 10/57 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 151/208 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 215/423 variables, 91/153 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 164/587 variables, 87/240 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 77/664 variables, 40/280 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 27/691 variables, 17/297 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/691 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 6/697 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/697 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 1/698 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/698 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 0/698 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/698 variables, and 302 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1625 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 20/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 18:14:22] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 9 ms to minimize.
Problem AtomicPropp10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 10/57 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 151/208 variables, 57/63 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 2/65 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 215/423 variables, 91/156 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 17/173 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 164/587 variables, 87/260 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 77/664 variables, 40/300 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/664 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 27/691 variables, 17/317 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/691 variables, 0/317 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 6/697 variables, 4/321 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/697 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 1/698 variables, 1/322 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/698 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 22 (OVERLAPS) 0/698 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 698/698 variables, and 322 constraints, problems are : Problem set: 1 solved, 19 unsolved in 2694 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 19/20 constraints, Known Traps: 1/1 constraints]
After SMT, in 4372ms problems are : Problem set: 1 solved, 19 unsolved
Parikh walk visited 14 properties in 6927 ms.
Support contains 7 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 401/401 transitions.
Graph (trivial) has 294 edges and 297 vertex of which 3 / 297 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 606 edges and 295 vertex of which 286 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 286 transition count 248
Reduce places removed 131 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 1 with 133 rules applied. Total rules applied 273 place count 155 transition count 246
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 2 with 3 rules applied. Total rules applied 276 place count 154 transition count 244
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 279 place count 153 transition count 242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 281 place count 151 transition count 242
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 281 place count 151 transition count 225
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 315 place count 134 transition count 225
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 322 place count 127 transition count 211
Iterating global reduction 5 with 7 rules applied. Total rules applied 329 place count 127 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 329 place count 127 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 126 transition count 210
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 333 place count 124 transition count 207
Iterating global reduction 5 with 2 rules applied. Total rules applied 335 place count 124 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 336 place count 124 transition count 206
Performed 43 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 422 place count 81 transition count 152
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 429 place count 81 transition count 145
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 434 place count 76 transition count 138
Iterating global reduction 7 with 5 rules applied. Total rules applied 439 place count 76 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 440 place count 76 transition count 137
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 441 place count 75 transition count 136
Iterating global reduction 8 with 1 rules applied. Total rules applied 442 place count 75 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 443 place count 75 transition count 135
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 9 with 2 rules applied. Total rules applied 445 place count 74 transition count 134
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 479 place count 57 transition count 155
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 487 place count 57 transition count 147
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 497 place count 47 transition count 107
Iterating global reduction 10 with 10 rules applied. Total rules applied 507 place count 47 transition count 107
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 514 place count 47 transition count 100
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 517 place count 44 transition count 82
Iterating global reduction 11 with 3 rules applied. Total rules applied 520 place count 44 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 522 place count 44 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 526 place count 44 transition count 76
Free-agglomeration rule applied 10 times.
Iterating global reduction 12 with 10 rules applied. Total rules applied 536 place count 44 transition count 66
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 11 rules applied. Total rules applied 547 place count 34 transition count 65
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 550 place count 34 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 551 place count 33 transition count 64
Applied a total of 551 rules in 70 ms. Remains 33 /297 variables (removed 264) and now considering 64/401 (removed 337) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 33/297 places, 64/401 transitions.
RANDOM walk for 40000 steps (8 resets) in 376 ms. (106 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
[2024-06-02 18:14:31] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
// Phase 1: matrix 60 rows 33 cols
[2024-06-02 18:14:31] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 18:14:31] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/24 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/81 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/87 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/89 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/89 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/93 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/93 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 52 constraints, problems are : Problem set: 0 solved, 1 unsolved in 55 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/24 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 57/81 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/87 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/89 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/93 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/93 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 53 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 27 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-06-02 18:14:32] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:14:32] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:14:32] [INFO ] Input system was already deterministic with 401 transitions.
Computed a total of 18 stabilizing places and 30 stable transitions
Graph (complete) has 609 edges and 297 vertex of which 289 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Graph (trivial) has 294 edges and 297 vertex of which 3 / 297 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 607 edges and 295 vertex of which 288 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 127 place count 287 transition count 265
Reduce places removed 125 places and 0 transitions.
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 1 with 128 rules applied. Total rules applied 255 place count 162 transition count 262
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 257 place count 161 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 160 transition count 261
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 258 place count 160 transition count 245
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 290 place count 144 transition count 245
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 297 place count 137 transition count 230
Iterating global reduction 4 with 7 rules applied. Total rules applied 304 place count 137 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 304 place count 137 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 308 place count 135 transition count 228
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 309 place count 134 transition count 226
Iterating global reduction 4 with 1 rules applied. Total rules applied 310 place count 134 transition count 226
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 354 place count 112 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 9 rules applied. Total rules applied 363 place count 112 transition count 195
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 368 place count 109 transition count 193
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 373 place count 104 transition count 186
Iterating global reduction 6 with 5 rules applied. Total rules applied 378 place count 104 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 379 place count 104 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 391 place count 104 transition count 173
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 7 with 6 rules applied. Total rules applied 397 place count 104 transition count 167
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 403 place count 98 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 403 place count 98 transition count 166
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 405 place count 97 transition count 166
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 9 with 2 rules applied. Total rules applied 407 place count 96 transition count 165
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 410 place count 96 transition count 165
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 411 place count 96 transition count 164
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 413 place count 94 transition count 162
Applied a total of 413 rules in 67 ms. Remains 94 /297 variables (removed 203) and now considering 162/401 (removed 239) transitions.
// Phase 1: matrix 162 rows 94 cols
[2024-06-02 18:14:32] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:14:32] [INFO ] Implicit Places using invariants in 61 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 93/297 places, 162/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 134 ms. Remains : 93/297 places, 162/401 transitions.
[2024-06-02 18:14:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:14:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:14:32] [INFO ] Input system was already deterministic with 162 transitions.
[2024-06-02 18:14:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:14:32] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5939232452000395979.gal : 3 ms
[2024-06-02 18:14:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13622135430947366055.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/CTLFireability5939232452000395979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13622135430947366055.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,203065,0.051295,5180,2,637,5,5492,6,0,522,4554,0


Converting to forward existential form...Done !
original formula: EF(AG(((!(A((p545==1) U (p553==1))) * (p250==0)) * ((p380==1) * (!(E((p378==1) U (p580==1))) + (p334!=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(!((E(!((p553==1)) U (!((p545==1)) * !((p553==1)))) + EG(!((p553==1)))))) * ...238
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t8, t18, t33, t47, t52, t57, t71, t76, t78, t88, t96, t101, t105, t106, t149, t15...258
(forward)formula 0,0,2.4135,82660,1,0,482,447267,363,241,3769,513084,607
FORMULA CO4-PT-13-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 269 transition count 365
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 269 transition count 365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 269 transition count 360
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 78 place count 252 transition count 342
Iterating global reduction 1 with 17 rules applied. Total rules applied 95 place count 252 transition count 342
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 105 place count 242 transition count 332
Iterating global reduction 1 with 10 rules applied. Total rules applied 115 place count 242 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 119 place count 242 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 238 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 238 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 237 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 237 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 236 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 236 transition count 322
Applied a total of 131 rules in 19 ms. Remains 236 /297 variables (removed 61) and now considering 322/401 (removed 79) transitions.
// Phase 1: matrix 322 rows 236 cols
[2024-06-02 18:14:34] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:14:34] [INFO ] Implicit Places using invariants in 80 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/297 places, 322/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 235 /235 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 235/297 places, 322/401 transitions.
[2024-06-02 18:14:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:14:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:14:34] [INFO ] Input system was already deterministic with 322 transitions.
[2024-06-02 18:14:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:14:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:14:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6790830581671444184.gal : 4 ms
[2024-06-02 18:14:34] [INFO ] Time to serialize properties into /tmp/CTLFireability16484989866952396128.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/CTLFireability6790830581671444184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16484989866952396128.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,2.47073e+07,0.521504,23676,2,3881,5,65849,6,0,1258,90534,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.539455,23676,1,0,6,65849,7,1,1544,90534,1
FORMULA CO4-PT-13-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Graph (trivial) has 307 edges and 297 vertex of which 3 / 297 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 607 edges and 295 vertex of which 287 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 286 transition count 258
Reduce places removed 131 places and 0 transitions.
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 1 with 134 rules applied. Total rules applied 267 place count 155 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 268 place count 154 transition count 255
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 268 place count 154 transition count 239
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 300 place count 138 transition count 239
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 310 place count 128 transition count 220
Iterating global reduction 3 with 10 rules applied. Total rules applied 320 place count 128 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 321 place count 128 transition count 219
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 321 place count 128 transition count 217
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 325 place count 126 transition count 217
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 326 place count 125 transition count 215
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 125 transition count 215
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 373 place count 102 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 9 rules applied. Total rules applied 382 place count 102 transition count 183
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 387 place count 99 transition count 181
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 392 place count 94 transition count 174
Iterating global reduction 6 with 5 rules applied. Total rules applied 397 place count 94 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 398 place count 94 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 412 place count 94 transition count 159
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 7 rules applied. Total rules applied 419 place count 94 transition count 152
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 426 place count 87 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 426 place count 87 transition count 150
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 430 place count 85 transition count 150
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 9 with 2 rules applied. Total rules applied 432 place count 84 transition count 149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 434 place count 82 transition count 147
Applied a total of 434 rules in 37 ms. Remains 82 /297 variables (removed 215) and now considering 147/401 (removed 254) transitions.
// Phase 1: matrix 147 rows 82 cols
[2024-06-02 18:14:35] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:14:35] [INFO ] Implicit Places using invariants in 42 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 81/297 places, 147/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 85 ms. Remains : 81/297 places, 147/401 transitions.
[2024-06-02 18:14:35] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:14:35] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:14:35] [INFO ] Input system was already deterministic with 147 transitions.
[2024-06-02 18:14:35] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:14:35] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:14:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8530358563571240494.gal : 2 ms
[2024-06-02 18:14:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11526508988682056363.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/CTLFireability8530358563571240494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11526508988682056363.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,105601,0.036868,4924,2,482,5,4818,6,0,461,3697,0


Converting to forward existential form...Done !
original formula: EG(EF((p146==0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p146==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t10, t22, t40, t45, t63, t139, t142, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,0.324227,15748,1,0,214,56780,318,112,3468,46913,308
FORMULA CO4-PT-13-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 270 transition count 366
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 270 transition count 366
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 270 transition count 361
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 76 place count 253 transition count 343
Iterating global reduction 1 with 17 rules applied. Total rules applied 93 place count 253 transition count 343
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 103 place count 243 transition count 333
Iterating global reduction 1 with 10 rules applied. Total rules applied 113 place count 243 transition count 333
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 117 place count 243 transition count 329
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 239 transition count 325
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 239 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 238 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 238 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 237 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 237 transition count 323
Applied a total of 129 rules in 13 ms. Remains 237 /297 variables (removed 60) and now considering 323/401 (removed 78) transitions.
// Phase 1: matrix 323 rows 237 cols
[2024-06-02 18:14:35] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:14:36] [INFO ] Implicit Places using invariants in 82 ms returned [173]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/297 places, 323/401 transitions.
Applied a total of 0 rules in 1 ms. Remains 236 /236 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 236/297 places, 323/401 transitions.
[2024-06-02 18:14:36] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:14:36] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:14:36] [INFO ] Input system was already deterministic with 323 transitions.
[2024-06-02 18:14:36] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:14:36] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:14:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15835960944165878171.gal : 2 ms
[2024-06-02 18:14:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3484435589991158408.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/CTLFireability15835960944165878171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3484435589991158408.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,2.48648e+07,0.565839,23864,2,3803,5,65298,6,0,1263,90946,0


Converting to forward existential form...Done !
original formula: EG(EF((EF(EX((p426==1))) + (p315==0))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (E(TRUE U EX((p426==1))) + (p315==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55, t63...404
(forward)formula 0,1,13.678,395392,1,0,527,2.37439e+06,672,304,8507,1.69474e+06,733
FORMULA CO4-PT-13-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 272 transition count 369
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 272 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 272 transition count 366
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 68 place count 257 transition count 350
Iterating global reduction 1 with 15 rules applied. Total rules applied 83 place count 257 transition count 350
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 91 place count 249 transition count 342
Iterating global reduction 1 with 8 rules applied. Total rules applied 99 place count 249 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 249 transition count 340
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 245 transition count 336
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 245 transition count 336
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 244 transition count 335
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 244 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 243 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 243 transition count 334
Applied a total of 113 rules in 24 ms. Remains 243 /297 variables (removed 54) and now considering 334/401 (removed 67) transitions.
// Phase 1: matrix 334 rows 243 cols
[2024-06-02 18:14:49] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:14:50] [INFO ] Implicit Places using invariants in 66 ms returned [173]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/297 places, 334/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 242 /242 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 242/297 places, 334/401 transitions.
[2024-06-02 18:14:50] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:14:50] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:14:50] [INFO ] Input system was already deterministic with 334 transitions.
[2024-06-02 18:14:50] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:14:50] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:14:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4408311561319515538.gal : 2 ms
[2024-06-02 18:14:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10122575145570511965.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4408311561319515538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10122575145570511965.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,3.05378e+07,0.405235,18656,2,4154,5,56621,6,0,1298,62393,0


Converting to forward existential form...Done !
original formula: (E(AG(!(AX(AG((p549==1))))) U ((p463==1)||(p125==1))) * EG(EF(AG((((p330==1)&&(p442==1))&&(p634==1))))))
=> equivalent forward existential formula: [FwdG((Init * E(!(E(TRUE U !(!(!(EX(!(!(E(TRUE U !((p549==1))))))))))) U ((p463==1)||(p125==1)))),E(TRUE U !(E(T...213
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t53, t54...424
(forward)formula 0,0,7.42851,232428,1,0,543,1.11842e+06,702,314,8353,1.03006e+06,757
FORMULA CO4-PT-13-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 271 transition count 367
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 271 transition count 367
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 271 transition count 362
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 72 place count 256 transition count 346
Iterating global reduction 1 with 15 rules applied. Total rules applied 87 place count 256 transition count 346
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 95 place count 248 transition count 338
Iterating global reduction 1 with 8 rules applied. Total rules applied 103 place count 248 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 248 transition count 335
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 245 transition count 332
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 245 transition count 332
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 244 transition count 331
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 244 transition count 331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 243 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 243 transition count 330
Applied a total of 116 rules in 18 ms. Remains 243 /297 variables (removed 54) and now considering 330/401 (removed 71) transitions.
// Phase 1: matrix 330 rows 243 cols
[2024-06-02 18:14:57] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:14:57] [INFO ] Implicit Places using invariants in 61 ms returned [176]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/297 places, 330/401 transitions.
Applied a total of 0 rules in 1 ms. Remains 242 /242 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 242/297 places, 330/401 transitions.
[2024-06-02 18:14:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:14:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:14:57] [INFO ] Input system was already deterministic with 330 transitions.
[2024-06-02 18:14:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:14:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:14:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2127037983535963.gal : 18 ms
[2024-06-02 18:14:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10533219480291822753.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/CTLFireability2127037983535963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10533219480291822753.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AG(((p597!=1)&&(((p435!=1)||(p442!=1))||((p518!=1)||(p639!=1))))) * AX((p117==0)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((p597!=1)&&(((p435!=1)||(p442!=1))||((p518!=1)||(p639!=1))))))] = FALSE * [(EY(Init) * !...177
(forward)formula 0,0,0.454552,18632,1,0,12,54945,11,4,1602,59523,3
FORMULA CO4-PT-13-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 269 transition count 365
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 269 transition count 365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 269 transition count 360
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 78 place count 252 transition count 342
Iterating global reduction 1 with 17 rules applied. Total rules applied 95 place count 252 transition count 342
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 105 place count 242 transition count 332
Iterating global reduction 1 with 10 rules applied. Total rules applied 115 place count 242 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 119 place count 242 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 238 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 238 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 237 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 237 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 236 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 236 transition count 322
Applied a total of 131 rules in 21 ms. Remains 236 /297 variables (removed 61) and now considering 322/401 (removed 79) transitions.
// Phase 1: matrix 322 rows 236 cols
[2024-06-02 18:14:58] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:14:58] [INFO ] Implicit Places using invariants in 57 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/297 places, 322/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 235 /235 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 235/297 places, 322/401 transitions.
[2024-06-02 18:14:58] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:14:58] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:14:58] [INFO ] Input system was already deterministic with 322 transitions.
[2024-06-02 18:14:58] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:14:58] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:14:58] [INFO ] Time to serialize gal into /tmp/CTLFireability10821777503613627807.gal : 2 ms
[2024-06-02 18:14:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13780595273284915336.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/CTLFireability10821777503613627807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13780595273284915336.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,2.47073e+07,0.53129,23640,2,3881,5,65849,6,0,1258,90534,0


Converting to forward existential form...Done !
original formula: AG((A(AG((p491==1)) U (p393==1)) + EX(AF((p392==1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,TRUE) * !(EX(!(EG(!((p392==1))))))),!((p393==1))) * !((p393==1))),TRUE) * !((p491==1)))...243
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55, t63...404
Detected timeout of ITS tools.
[2024-06-02 18:15:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:15:28] [INFO ] Applying decomposition
[2024-06-02 18:15:28] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph997085943560132816.txt' '-o' '/tmp/graph997085943560132816.bin' '-w' '/tmp/graph997085943560132816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph997085943560132816.bin' '-l' '-1' '-v' '-w' '/tmp/graph997085943560132816.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:15:28] [INFO ] Decomposing Gal with order
[2024-06-02 18:15:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:15:28] [INFO ] Removed a total of 197 redundant transitions.
[2024-06-02 18:15:28] [INFO ] Flatten gal took : 88 ms
[2024-06-02 18:15:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 24 ms.
[2024-06-02 18:15:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9039937788896281769.gal : 25 ms
[2024-06-02 18:15:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17309230197506484940.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/CTLFireability9039937788896281769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17309230197506484940.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.47073e+07,0.163254,9568,727,121,9939,659,673,23517,79,3407,0


Converting to forward existential form...Done !
original formula: AG((A(AG((i13.u72.p491==1)) U (i9.i2.u61.p393==1)) + EX(AF((i9.i2.u61.p392==1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,TRUE) * !(EX(!(EG(!((i9.i2.u61.p392==1))))))),!((i9.i2.u61.p393==1))) * !((i9.i2.u61.p3...301
Reverse transition relation is NOT exact ! Due to transitions t19, t43, t84, t128, t162, t174, t185, t205, t273, t274, t297, t298, i0.t11, i0.u88.t15, i0.u...646
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,13.2068,445368,1,0,646993,2866,4595,2.35142e+06,393,20436,631741
FORMULA CO4-PT-13-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Graph (trivial) has 308 edges and 297 vertex of which 3 / 297 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 607 edges and 295 vertex of which 287 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 286 transition count 257
Reduce places removed 132 places and 0 transitions.
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 1 with 135 rules applied. Total rules applied 269 place count 154 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 153 transition count 254
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 270 place count 153 transition count 238
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 302 place count 137 transition count 238
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 311 place count 128 transition count 220
Iterating global reduction 3 with 9 rules applied. Total rules applied 320 place count 128 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 321 place count 128 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 321 place count 128 transition count 218
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 323 place count 127 transition count 218
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 371 place count 103 transition count 194
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 9 rules applied. Total rules applied 380 place count 103 transition count 185
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 385 place count 100 transition count 183
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 390 place count 95 transition count 176
Iterating global reduction 6 with 5 rules applied. Total rules applied 395 place count 95 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 396 place count 95 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 410 place count 95 transition count 161
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 7 rules applied. Total rules applied 417 place count 95 transition count 154
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 424 place count 88 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 424 place count 88 transition count 152
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 428 place count 86 transition count 152
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 9 with 2 rules applied. Total rules applied 430 place count 85 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 432 place count 83 transition count 149
Applied a total of 432 rules in 28 ms. Remains 83 /297 variables (removed 214) and now considering 149/401 (removed 252) transitions.
// Phase 1: matrix 149 rows 83 cols
[2024-06-02 18:15:42] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:15:42] [INFO ] Implicit Places using invariants in 61 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/297 places, 149/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 92 ms. Remains : 82/297 places, 149/401 transitions.
[2024-06-02 18:15:42] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:15:42] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:15:42] [INFO ] Input system was already deterministic with 149 transitions.
[2024-06-02 18:15:42] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:15:42] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:15:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5077727008996645821.gal : 7 ms
[2024-06-02 18:15:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10464240321856875163.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/CTLFireability5077727008996645821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10464240321856875163.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,107521,0.04282,4972,2,469,5,4956,6,0,467,4115,0


Converting to forward existential form...Done !
original formula: EG(EF((p136==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p136==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t10, t22, t40, t45, t65, t141, t144, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,0.762557,32556,1,0,265,117887,324,158,3370,171634,357
FORMULA CO4-PT-13-CTLFireability-2024-08 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 : 297/297 places, 401/401 transitions.
Graph (trivial) has 294 edges and 297 vertex of which 3 / 297 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 607 edges and 295 vertex of which 287 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 286 transition count 265
Reduce places removed 124 places and 0 transitions.
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 1 with 127 rules applied. Total rules applied 253 place count 162 transition count 262
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 257 place count 161 transition count 259
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 260 place count 158 transition count 259
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 260 place count 158 transition count 243
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 292 place count 142 transition count 243
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 303 place count 131 transition count 223
Iterating global reduction 4 with 11 rules applied. Total rules applied 314 place count 131 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 315 place count 131 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 315 place count 131 transition count 220
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 319 place count 129 transition count 220
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 320 place count 128 transition count 218
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 128 transition count 218
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 361 place count 108 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 5 with 9 rules applied. Total rules applied 370 place count 108 transition count 189
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 375 place count 105 transition count 187
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 380 place count 100 transition count 180
Iterating global reduction 7 with 5 rules applied. Total rules applied 385 place count 100 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 386 place count 100 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 399 place count 100 transition count 166
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 8 with 7 rules applied. Total rules applied 406 place count 100 transition count 159
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 413 place count 93 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 413 place count 93 transition count 157
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 417 place count 91 transition count 157
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 10 with 2 rules applied. Total rules applied 419 place count 90 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 420 place count 89 transition count 155
Applied a total of 420 rules in 25 ms. Remains 89 /297 variables (removed 208) and now considering 155/401 (removed 246) transitions.
// Phase 1: matrix 155 rows 89 cols
[2024-06-02 18:15:43] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:15:43] [INFO ] Implicit Places using invariants in 36 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 88/297 places, 155/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 64 ms. Remains : 88/297 places, 155/401 transitions.
[2024-06-02 18:15:43] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:15:43] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:15:43] [INFO ] Input system was already deterministic with 155 transitions.
[2024-06-02 18:15:43] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:15:43] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:15:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10895658184894235257.gal : 1 ms
[2024-06-02 18:15:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17878003423648098375.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/CTLFireability10895658184894235257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17878003423648098375.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,249874,0.04944,5292,2,714,5,6823,6,0,496,5402,0


Converting to forward existential form...Done !
original formula: !(A((EG((p279!=1)) + A((p202!=1) U !(AG((((p416==1)&&(p442==1))&&(p542==1)))))) U EF((((p442==1)&&(p540==1))&&(p644==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U (((p442==1)&&(p540==1))&&(p644==1))))) * !((EG((p279!=1)) + !((E(!(!(!(E(TRUE U !((((p4...473
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t9, t24, t37, t38, t46, t51, t81, t87, t96, t98, t121, t127, t135, t136, t143...275
(forward)formula 0,0,2.28319,90844,1,0,479,507216,350,230,3860,543342,596
FORMULA CO4-PT-13-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 269 transition count 365
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 269 transition count 365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 269 transition count 360
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 78 place count 252 transition count 342
Iterating global reduction 1 with 17 rules applied. Total rules applied 95 place count 252 transition count 342
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 105 place count 242 transition count 332
Iterating global reduction 1 with 10 rules applied. Total rules applied 115 place count 242 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 119 place count 242 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 238 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 238 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 237 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 237 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 236 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 236 transition count 322
Applied a total of 131 rules in 18 ms. Remains 236 /297 variables (removed 61) and now considering 322/401 (removed 79) transitions.
// Phase 1: matrix 322 rows 236 cols
[2024-06-02 18:15:45] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:15:45] [INFO ] Implicit Places using invariants in 62 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/297 places, 322/401 transitions.
Applied a total of 0 rules in 1 ms. Remains 235 /235 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 235/297 places, 322/401 transitions.
[2024-06-02 18:15:45] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:15:45] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:15:45] [INFO ] Input system was already deterministic with 322 transitions.
[2024-06-02 18:15:45] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:15:45] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:15:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2026610081625347286.gal : 2 ms
[2024-06-02 18:15:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5029509608124213915.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/CTLFireability2026610081625347286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5029509608124213915.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,2.47073e+07,0.470017,23688,2,3881,5,65849,6,0,1258,90534,0


Converting to forward existential form...Done !
original formula: (AG(AF(AX(FALSE))) + EG(AG(EX((((p442==1)&&(p518==1))&&(p639==1))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(EG(!(E(TRUE U !(EX((((p442==1)&&(p518==1))&&(p639==1))))))))),TRUE),!(!(EX(!(FALSE)))))] = ...160
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55, t63...404
(forward)formula 0,0,6.8865,214856,1,0,501,997609,677,292,8542,892633,698
FORMULA CO4-PT-13-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 274 transition count 370
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 274 transition count 370
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 274 transition count 365
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 63 place count 262 transition count 352
Iterating global reduction 1 with 12 rules applied. Total rules applied 75 place count 262 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 255 transition count 345
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 255 transition count 345
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 93 place count 255 transition count 341
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 253 transition count 339
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 253 transition count 339
Applied a total of 97 rules in 22 ms. Remains 253 /297 variables (removed 44) and now considering 339/401 (removed 62) transitions.
// Phase 1: matrix 339 rows 253 cols
[2024-06-02 18:15:52] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:15:52] [INFO ] Implicit Places using invariants in 90 ms returned [184]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 252/297 places, 339/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 252/297 places, 339/401 transitions.
[2024-06-02 18:15:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:15:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:15:52] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-02 18:15:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:15:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:15:52] [INFO ] Time to serialize gal into /tmp/CTLFireability18114423630900314399.gal : 1 ms
[2024-06-02 18:15:52] [INFO ] Time to serialize properties into /tmp/CTLFireability17384826956069532675.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/CTLFireability18114423630900314399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17384826956069532675.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,2.95973e+07,0.34425,18168,2,3948,5,50450,6,0,1342,60933,0


Converting to forward existential form...Done !
original formula: (EX((A(((p580==1) + AG((p410==1))) U ((p202==1)||(p483==1))) + EX(EG((p452==0))))) + A((p196==1) U (p417==1)))
=> equivalent forward existential formula: (([((EY(Init) * !(EG(!(((p202==1)||(p483==1)))))) * !(E(!(((p202==1)||(p483==1))) U (!(((p580==1) + !(E(TRUE U !...353
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t21, t26, t34, t44, t47, t50, t51, t52, t54, t60, t68, t77...394
Detected timeout of ITS tools.
[2024-06-02 18:16:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:16:22] [INFO ] Applying decomposition
[2024-06-02 18:16:22] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5352554934883655386.txt' '-o' '/tmp/graph5352554934883655386.bin' '-w' '/tmp/graph5352554934883655386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5352554934883655386.bin' '-l' '-1' '-v' '-w' '/tmp/graph5352554934883655386.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:16:22] [INFO ] Decomposing Gal with order
[2024-06-02 18:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:16:22] [INFO ] Removed a total of 199 redundant transitions.
[2024-06-02 18:16:22] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2024-06-02 18:16:22] [INFO ] Time to serialize gal into /tmp/CTLFireability11781454107231751410.gal : 5 ms
[2024-06-02 18:16:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11353415169553996486.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/CTLFireability11781454107231751410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11353415169553996486.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.95973e+07,0.108051,8188,580,97,7266,517,703,14273,87,2243,0


Converting to forward existential form...Done !
original formula: (EX((A(((i15.i0.u88.p580==1) + AG((i10.i1.u68.p410==1))) U ((i10.i0.u22.p202==1)||(i14.u79.p483==1))) + EX(EG((i15.i1.u78.p452==0))))) + ...202
=> equivalent forward existential formula: (([((EY(Init) * !(EG(!(((i10.i0.u22.p202==1)||(i14.u79.p483==1)))))) * !(E(!(((i10.i0.u22.p202==1)||(i14.u79.p48...487
Reverse transition relation is NOT exact ! Due to transitions t21, t47, t90, t216, t227, t230, t258, t286, t287, t310, t311, t317, u84.t68, i0.t13, i0.u96....633
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,10.3501,333448,1,0,482930,2672,4933,1.74342e+06,424,18230,469554
FORMULA CO4-PT-13-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 271 transition count 372
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 271 transition count 372
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 271 transition count 367
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 74 place count 254 transition count 349
Iterating global reduction 1 with 17 rules applied. Total rules applied 91 place count 254 transition count 349
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 100 place count 245 transition count 340
Iterating global reduction 1 with 9 rules applied. Total rules applied 109 place count 245 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 112 place count 245 transition count 337
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 241 transition count 333
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 241 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 240 transition count 332
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 240 transition count 332
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 239 transition count 331
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 239 transition count 331
Applied a total of 124 rules in 24 ms. Remains 239 /297 variables (removed 58) and now considering 331/401 (removed 70) transitions.
// Phase 1: matrix 331 rows 239 cols
[2024-06-02 18:16:33] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:16:33] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 18:16:33] [INFO ] Invariant cache hit.
[2024-06-02 18:16:33] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-06-02 18:16:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 18:16:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:16:36] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
[2024-06-02 18:16:36] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:16:37] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
[2024-06-02 18:16:37] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
Problem TDEAD278 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 5/10 constraints. Problems are: Problem set: 6 solved, 324 unsolved
[2024-06-02 18:16:38] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 1/11 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 331/570 variables, 239/250 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/250 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/250 constraints. Problems are: Problem set: 6 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 250 constraints, problems are : Problem set: 6 solved, 324 unsolved in 14963 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 6 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 6/11 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 331/570 variables, 239/250 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 324/574 constraints. Problems are: Problem set: 6 solved, 324 unsolved
[2024-06-02 18:16:56] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 1/575 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 0/575 constraints. Problems are: Problem set: 6 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/570 variables, 0/575 constraints. Problems are: Problem set: 6 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 575 constraints, problems are : Problem set: 6 solved, 324 unsolved in 26341 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 324/330 constraints, Known Traps: 7/7 constraints]
After SMT, in 41494ms problems are : Problem set: 6 solved, 324 unsolved
Search for dead transitions found 6 dead transitions in 41499ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 239/297 places, 325/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 239 /239 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41785 ms. Remains : 239/297 places, 325/401 transitions.
[2024-06-02 18:17:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:17:15] [INFO ] Input system was already deterministic with 325 transitions.
[2024-06-02 18:17:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:17:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:17:15] [INFO ] Time to serialize gal into /tmp/CTLFireability17521675242927531575.gal : 1 ms
[2024-06-02 18:17:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1374227255487182100.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/CTLFireability17521675242927531575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1374227255487182100.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,2.55211e+07,0.397661,18144,2,3937,5,53418,6,0,1277,60379,0


Converting to forward existential form...Done !
original formula: AX((EX(AG((p380==0))) + (E((p639==1) U (((p439==1)&&(p447==1))&&(p599==1))) * EX((((p439==1)&&(p447==1))&&(p517==1))))))
=> equivalent forward existential formula: [((EY(Init) * !((E((p639==1) U (((p439==1)&&(p447==1))&&(p599==1))) * EX((((p439==1)&&(p447==1))&&(p517==1))))))...200
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55, t63...416
(forward)formula 0,0,20.0216,601732,1,0,878,3.5885e+06,678,492,8300,3.33929e+06,1078
FORMULA CO4-PT-13-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 271 transition count 367
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 271 transition count 367
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 271 transition count 362
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 72 place count 256 transition count 346
Iterating global reduction 1 with 15 rules applied. Total rules applied 87 place count 256 transition count 346
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 97 place count 246 transition count 336
Iterating global reduction 1 with 10 rules applied. Total rules applied 107 place count 246 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 111 place count 246 transition count 332
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 242 transition count 328
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 242 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 241 transition count 327
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 241 transition count 327
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 240 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 240 transition count 326
Applied a total of 123 rules in 12 ms. Remains 240 /297 variables (removed 57) and now considering 326/401 (removed 75) transitions.
// Phase 1: matrix 326 rows 240 cols
[2024-06-02 18:17:35] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:17:35] [INFO ] Implicit Places using invariants in 65 ms returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 239/297 places, 326/401 transitions.
Applied a total of 0 rules in 1 ms. Remains 239 /239 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 239/297 places, 326/401 transitions.
[2024-06-02 18:17:35] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:35] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:35] [INFO ] Input system was already deterministic with 326 transitions.
[2024-06-02 18:17:35] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:35] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:17:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1812882694028907344.gal : 2 ms
[2024-06-02 18:17:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10615911758063152927.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/CTLFireability1812882694028907344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10615911758063152927.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,2.6828e+07,0.386953,18896,2,4067,5,56435,6,0,1278,64213,0


Converting to forward existential form...Done !
original formula: AF(!(A((AG((p394==1)) * EX(EF((p477==1)))) U AF(AX((p435==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!(!(EX(!((p435==1)))))))) U (!((!(E(TRUE U !((p394==1)))) * EX(E(TRUE U (p477==1)))))...245
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55, t63...410
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 18:18:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:18:05] [INFO ] Applying decomposition
[2024-06-02 18:18:05] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3292880395228101219.txt' '-o' '/tmp/graph3292880395228101219.bin' '-w' '/tmp/graph3292880395228101219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3292880395228101219.bin' '-l' '-1' '-v' '-w' '/tmp/graph3292880395228101219.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:18:05] [INFO ] Decomposing Gal with order
[2024-06-02 18:18:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:18:05] [INFO ] Removed a total of 200 redundant transitions.
[2024-06-02 18:18:05] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:18:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-06-02 18:18:05] [INFO ] Time to serialize gal into /tmp/CTLFireability18125266203421460849.gal : 3 ms
[2024-06-02 18:18:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16170540710672437038.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/CTLFireability18125266203421460849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16170540710672437038.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.6828e+07,0.144301,9748,569,110,10141,556,653,24934,83,3343,0


Converting to forward existential form...Done !
original formula: AF(!(A((AG((i8.u59.p394==1)) * EX(EF((i12.u73.p477==1)))) U AF(AX((i10.u69.p435==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!(!(EX(!((i10.u69.p435==1)))))))) U (!((!(E(TRUE U !((i8.u59.p394==1)))) * EX(E(TRUE ...284
Reverse transition relation is NOT exact ! Due to transitions t19, t43, t74, t78, t85, t131, t165, t177, t220, t276, t277, t300, t301, i0.t11, i0.u89.t15, ...629
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,9.91857,333800,1,0,422472,2841,4318,2.21326e+06,434,18864,354822
FORMULA CO4-PT-13-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 401/401 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 273 transition count 369
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 273 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 273 transition count 366
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 257 transition count 349
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 257 transition count 349
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 247 transition count 339
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 247 transition count 339
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 107 place count 247 transition count 335
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 243 transition count 331
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 243 transition count 331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 242 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 242 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 241 transition count 329
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 241 transition count 329
Applied a total of 119 rules in 17 ms. Remains 241 /297 variables (removed 56) and now considering 329/401 (removed 72) transitions.
// Phase 1: matrix 329 rows 241 cols
[2024-06-02 18:18:15] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:18:15] [INFO ] Implicit Places using invariants in 64 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/297 places, 329/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 240/297 places, 329/401 transitions.
[2024-06-02 18:18:15] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:18:15] [INFO ] Input system was already deterministic with 329 transitions.
[2024-06-02 18:18:15] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:18:15] [INFO ] Time to serialize gal into /tmp/CTLFireability7546360310867588084.gal : 2 ms
[2024-06-02 18:18:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16068559748832475632.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/CTLFireability7546360310867588084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16068559748832475632.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,2.70296e+07,0.37366,18648,2,4096,5,56227,6,0,1284,62287,0


Converting to forward existential form...Done !
original formula: ((AF((p459==0)) * EF(((p354==1)||(p274==1)))) * EF((((AX((p398==0)) + (((p160==1)&&(p442==1))&&(p634==1))) * (p250==0)) * !(A(AG((p5==1))...176
=> equivalent forward existential formula: (([FwdG(Init,!((p459==0)))] = FALSE * [(Init * !(E(TRUE U ((p354==1)||(p274==1)))))] = FALSE) * [(Init * !(E(TRU...350
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t48, t49, t51, t57...420
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 18:18:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:18:45] [INFO ] Applying decomposition
[2024-06-02 18:18:45] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12434187396373298946.txt' '-o' '/tmp/graph12434187396373298946.bin' '-w' '/tmp/graph12434187396373298946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12434187396373298946.bin' '-l' '-1' '-v' '-w' '/tmp/graph12434187396373298946.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:18:45] [INFO ] Decomposing Gal with order
[2024-06-02 18:18:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:18:45] [INFO ] Removed a total of 187 redundant transitions.
[2024-06-02 18:18:45] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:18:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2024-06-02 18:18:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4778772076398756906.gal : 3 ms
[2024-06-02 18:18:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13810124039590032635.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/CTLFireability4778772076398756906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13810124039590032635.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.70296e+07,0.133805,9368,442,88,10558,752,697,21086,90,2913,0


Converting to forward existential form...Done !
original formula: ((AF((i11.u68.p459==0)) * EF(((i6.i1.u47.p354==1)||(i3.i2.u25.p274==1)))) * EF((((AX((i6.i2.u56.p398==0)) + (((i0.i0.u11.p160==1)&&(i10.i...274
=> equivalent forward existential formula: (([FwdG(Init,!((i11.u68.p459==0)))] = FALSE * [(Init * !(E(TRUE U ((i6.i1.u47.p354==1)||(i3.i2.u25.p274==1)))))]...464
Reverse transition relation is NOT exact ! Due to transitions t19, t43, t76, t88, t168, t180, t212, t280, t281, t304, t305, i0.i1.t189, i0.i1.u12.t224, i0....743
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,12.5491,392732,1,0,518123,2691,4593,2.55574e+06,466,13852,375104
FORMULA CO4-PT-13-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-06-02 18:18:58] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:18:58] [INFO ] Flatten gal took : 8 ms
Total runtime 280197 ms.

BK_STOP 1717352338581

--------------------
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="CO4-PT-13"
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 CO4-PT-13, 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 r550-tall-171734898500098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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