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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 174K 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-14-CTLFireability-2024-00
FORMULA_NAME CO4-PT-14-CTLFireability-2024-01
FORMULA_NAME CO4-PT-14-CTLFireability-2024-02
FORMULA_NAME CO4-PT-14-CTLFireability-2024-03
FORMULA_NAME CO4-PT-14-CTLFireability-2024-04
FORMULA_NAME CO4-PT-14-CTLFireability-2024-05
FORMULA_NAME CO4-PT-14-CTLFireability-2024-06
FORMULA_NAME CO4-PT-14-CTLFireability-2024-07
FORMULA_NAME CO4-PT-14-CTLFireability-2024-08
FORMULA_NAME CO4-PT-14-CTLFireability-2024-09
FORMULA_NAME CO4-PT-14-CTLFireability-2024-10
FORMULA_NAME CO4-PT-14-CTLFireability-2024-11
FORMULA_NAME CO4-PT-14-CTLFireability-2024-12
FORMULA_NAME CO4-PT-14-CTLFireability-2024-13
FORMULA_NAME CO4-PT-14-CTLFireability-2024-14
FORMULA_NAME CO4-PT-14-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717352180219

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:16:21] [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:16:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:16:21] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-02 18:16:21] [INFO ] Transformed 680 places.
[2024-06-02 18:16:21] [INFO ] Transformed 812 transitions.
[2024-06-02 18:16:21] [INFO ] Found NUPN structural information;
[2024-06-02 18:16:21] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 100 places in 9 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 81 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 692/692 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 569 transition count 691
Discarding 108 places :
Symmetric choice reduction at 1 with 108 rule applications. Total rules 120 place count 461 transition count 581
Iterating global reduction 1 with 108 rules applied. Total rules applied 228 place count 461 transition count 581
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 233 place count 461 transition count 576
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 284 place count 410 transition count 525
Iterating global reduction 2 with 51 rules applied. Total rules applied 335 place count 410 transition count 525
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 342 place count 403 transition count 517
Iterating global reduction 2 with 7 rules applied. Total rules applied 349 place count 403 transition count 517
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 351 place count 403 transition count 515
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 352 place count 402 transition count 514
Iterating global reduction 3 with 1 rules applied. Total rules applied 353 place count 402 transition count 514
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 354 place count 401 transition count 513
Iterating global reduction 3 with 1 rules applied. Total rules applied 355 place count 401 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 356 place count 401 transition count 512
Applied a total of 356 rules in 135 ms. Remains 401 /580 variables (removed 179) and now considering 512/692 (removed 180) transitions.
// Phase 1: matrix 512 rows 401 cols
[2024-06-02 18:16:21] [INFO ] Computed 5 invariants in 22 ms
[2024-06-02 18:16:22] [INFO ] Implicit Places using invariants in 293 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/580 places, 512/692 transitions.
Applied a total of 0 rules in 9 ms. Remains 400 /400 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 484 ms. Remains : 400/580 places, 512/692 transitions.
Support contains 81 out of 400 places after structural reductions.
[2024-06-02 18:16:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:16:22] [INFO ] Flatten gal took : 62 ms
FORMULA CO4-PT-14-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:16:22] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:16:22] [INFO ] Input system was already deterministic with 512 transitions.
Support contains 63 out of 400 places (down from 81) after GAL structural reductions.
RANDOM walk for 40000 steps (82 resets) in 2269 ms. (17 steps per ms) remains 36/52 properties
BEST_FIRST walk for 4002 steps (17 resets) in 43 ms. (90 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4002 steps (17 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (22 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (25 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (25 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (24 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 32/35 properties
BEST_FIRST walk for 4004 steps (27 resets) in 25 ms. (154 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (23 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (19 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (22 resets) in 24 ms. (160 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (24 resets) in 58 ms. (67 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (19 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (18 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (22 resets) in 12 ms. (307 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (24 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (19 resets) in 30 ms. (129 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4002 steps (23 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (22 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (22 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (25 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (20 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (23 resets) in 17 ms. (222 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4002 steps (21 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (18 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
// Phase 1: matrix 512 rows 400 cols
[2024-06-02 18:16:23] [INFO ] Computed 4 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 19/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 6/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 171/229 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 384/613 variables, 166/228 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 247/860 variables, 140/368 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 43/903 variables, 30/398 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/903 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 9/912 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/912 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 0/912 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 404 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2102 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 19/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 6/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 171/229 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 384/613 variables, 166/229 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 26/255 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 247/860 variables, 140/395 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/860 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 43/903 variables, 30/425 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/903 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 9/912 variables, 6/431 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/912 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 0/912 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 431 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3433 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 5594ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 25 properties in 10130 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 512/512 transitions.
Graph (trivial) has 426 edges and 400 vertex of which 2 / 400 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 659 edges and 399 vertex of which 381 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 381 transition count 324
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 332 place count 223 transition count 323
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 332 place count 223 transition count 288
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 402 place count 188 transition count 288
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 412 place count 178 transition count 277
Iterating global reduction 2 with 10 rules applied. Total rules applied 422 place count 178 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 424 place count 178 transition count 275
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 424 place count 178 transition count 273
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 428 place count 176 transition count 273
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 431 place count 173 transition count 270
Iterating global reduction 3 with 3 rules applied. Total rules applied 434 place count 173 transition count 270
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 3 with 2 rules applied. Total rules applied 436 place count 173 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 437 place count 172 transition count 268
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 438 place count 171 transition count 267
Iterating global reduction 5 with 1 rules applied. Total rules applied 439 place count 171 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 440 place count 171 transition count 266
Performed 64 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 128 rules applied. Total rules applied 568 place count 107 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 574 place count 107 transition count 183
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 578 place count 103 transition count 179
Iterating global reduction 7 with 4 rules applied. Total rules applied 582 place count 103 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 583 place count 103 transition count 178
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 8 with 2 rules applied. Total rules applied 585 place count 102 transition count 177
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 8 with 62 rules applied. Total rules applied 647 place count 71 transition count 179
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 667 place count 71 transition count 159
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 695 place count 43 transition count 103
Iterating global reduction 9 with 28 rules applied. Total rules applied 723 place count 43 transition count 103
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 742 place count 43 transition count 84
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 748 place count 37 transition count 67
Iterating global reduction 10 with 6 rules applied. Total rules applied 754 place count 37 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 758 place count 37 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 762 place count 35 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 768 place count 35 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 12 with 16 rules applied. Total rules applied 784 place count 35 transition count 65
Free-agglomeration rule applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 789 place count 35 transition count 60
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 796 place count 30 transition count 58
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 798 place count 30 transition count 58
Graph (complete) has 99 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 799 place count 29 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 800 place count 29 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 801 place count 29 transition count 57
Graph (complete) has 96 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 802 place count 28 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 803 place count 28 transition count 56
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 804 place count 28 transition count 56
Graph (complete) has 93 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 805 place count 27 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 806 place count 27 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 807 place count 26 transition count 54
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t55.t445.t52 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 18 edges and 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 19 with 3 rules applied. Total rules applied 810 place count 20 transition count 52
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 815 place count 20 transition count 47
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 816 place count 19 transition count 45
Iterating global reduction 21 with 1 rules applied. Total rules applied 817 place count 19 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 818 place count 19 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 22 with 16 rules applied. Total rules applied 834 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 42 edges and 18 vertex of which 12 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Iterating post reduction 22 with 3 rules applied. Total rules applied 837 place count 12 transition count 22
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 842 place count 12 transition count 17
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 844 place count 10 transition count 15
Iterating global reduction 24 with 2 rules applied. Total rules applied 846 place count 10 transition count 15
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 848 place count 10 transition count 13
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 849 place count 9 transition count 12
Iterating global reduction 25 with 1 rules applied. Total rules applied 850 place count 9 transition count 12
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 851 place count 9 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 26 with 2 rules applied. Total rules applied 853 place count 9 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 855 place count 7 transition count 9
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 856 place count 7 transition count 9
Applied a total of 856 rules in 123 ms. Remains 7 /400 variables (removed 393) and now considering 9/512 (removed 503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 7/400 places, 9/512 transitions.
RANDOM walk for 33 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/2 properties
[2024-06-02 18:16:39] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:16:39] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:16:39] [INFO ] Input system was already deterministic with 512 transitions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 661 edges and 400 vertex of which 397 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Graph (trivial) has 422 edges and 400 vertex of which 2 / 400 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 660 edges and 399 vertex of which 396 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 395 transition count 354
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 160 rules applied. Total rules applied 315 place count 242 transition count 347
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 321 place count 236 transition count 347
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 321 place count 236 transition count 311
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 393 place count 200 transition count 311
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 403 place count 190 transition count 300
Iterating global reduction 3 with 10 rules applied. Total rules applied 413 place count 190 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 415 place count 190 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 415 place count 190 transition count 296
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 419 place count 188 transition count 296
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 422 place count 185 transition count 293
Iterating global reduction 4 with 3 rules applied. Total rules applied 425 place count 185 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 427 place count 185 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 428 place count 184 transition count 291
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 468 place count 164 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 4 rules applied. Total rules applied 472 place count 164 transition count 266
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 7 with 3 rules applied. Total rules applied 475 place count 163 transition count 264
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 478 place count 162 transition count 262
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 480 place count 161 transition count 261
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 483 place count 158 transition count 258
Iterating global reduction 10 with 3 rules applied. Total rules applied 486 place count 158 transition count 258
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 490 place count 156 transition count 256
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 491 place count 155 transition count 255
Iterating global reduction 10 with 1 rules applied. Total rules applied 492 place count 155 transition count 255
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 493 place count 154 transition count 253
Iterating global reduction 10 with 1 rules applied. Total rules applied 494 place count 154 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 495 place count 154 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 506 place count 154 transition count 241
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 11 with 6 rules applied. Total rules applied 512 place count 154 transition count 235
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 7 rules applied. Total rules applied 519 place count 148 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 520 place count 147 transition count 234
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 14 with 2 rules applied. Total rules applied 522 place count 146 transition count 233
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 524 place count 144 transition count 231
Applied a total of 524 rules in 85 ms. Remains 144 /400 variables (removed 256) and now considering 231/512 (removed 281) transitions.
// Phase 1: matrix 231 rows 144 cols
[2024-06-02 18:16:39] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:16:39] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 18:16:39] [INFO ] Invariant cache hit.
[2024-06-02 18:16:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:16:39] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-02 18:16:39] [INFO ] Redundant transitions in 8 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-02 18:16:39] [INFO ] Invariant cache hit.
[2024-06-02 18:16:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 230/374 variables, 144/148 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 1/375 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/375 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 149 constraints, problems are : Problem set: 0 solved, 218 unsolved in 6163 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 144/144 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 230/374 variables, 144/148 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 218/366 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 1/375 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/375 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 367 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8048 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 144/144 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 14272ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 14275ms
Starting structural reductions in SI_CTL mode, iteration 1 : 144/400 places, 231/512 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14550 ms. Remains : 144/400 places, 231/512 transitions.
[2024-06-02 18:16:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:16:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:16:54] [INFO ] Input system was already deterministic with 231 transitions.
[2024-06-02 18:16:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:16:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:16:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11381428579359911037.gal : 5 ms
[2024-06-02 18:16:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3231580599025968854.ctl : 3 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/CTLFireability11381428579359911037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3231580599025968854.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.48443e+06,0.07685,5636,2,744,5,8256,6,0,799,6882,0


Converting to forward existential form...Done !
original formula: AG(EF(((p665==0)&&(p290==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p665==0)&&(p290==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t47, t72, t81, t86, t122, Intersection with reachable at each step enabled. (destroyed/...192
(forward)formula 0,1,0.646086,26144,1,0,281,114217,482,148,4674,75562,471
FORMULA CO4-PT-14-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Graph (trivial) has 428 edges and 400 vertex of which 2 / 400 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 660 edges and 399 vertex of which 396 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 395 transition count 348
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 321 place count 236 transition count 347
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 321 place count 236 transition count 311
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 393 place count 200 transition count 311
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 403 place count 190 transition count 300
Iterating global reduction 2 with 10 rules applied. Total rules applied 413 place count 190 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 415 place count 190 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 415 place count 190 transition count 296
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 419 place count 188 transition count 296
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 422 place count 185 transition count 293
Iterating global reduction 3 with 3 rules applied. Total rules applied 425 place count 185 transition count 293
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 3 with 2 rules applied. Total rules applied 427 place count 185 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 428 place count 184 transition count 291
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 468 place count 164 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 472 place count 164 transition count 266
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 6 with 3 rules applied. Total rules applied 475 place count 163 transition count 264
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 7 with 3 rules applied. Total rules applied 478 place count 162 transition count 262
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 480 place count 161 transition count 261
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 483 place count 158 transition count 258
Iterating global reduction 9 with 3 rules applied. Total rules applied 486 place count 158 transition count 258
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 490 place count 156 transition count 256
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 491 place count 155 transition count 255
Iterating global reduction 9 with 1 rules applied. Total rules applied 492 place count 155 transition count 255
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 493 place count 154 transition count 253
Iterating global reduction 9 with 1 rules applied. Total rules applied 494 place count 154 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 495 place count 154 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 506 place count 154 transition count 241
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 10 with 7 rules applied. Total rules applied 513 place count 154 transition count 234
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 520 place count 147 transition count 234
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 12 with 2 rules applied. Total rules applied 522 place count 146 transition count 233
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 523 place count 146 transition count 233
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 525 place count 144 transition count 231
Applied a total of 525 rules in 96 ms. Remains 144 /400 variables (removed 256) and now considering 231/512 (removed 281) transitions.
// Phase 1: matrix 231 rows 144 cols
[2024-06-02 18:16:55] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:16:55] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:16:55] [INFO ] Invariant cache hit.
[2024-06-02 18:16:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:16:55] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-02 18:16:55] [INFO ] Redundant transitions in 8 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-02 18:16:55] [INFO ] Invariant cache hit.
[2024-06-02 18:16:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 230/374 variables, 144/148 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 1/375 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/375 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 149 constraints, problems are : Problem set: 0 solved, 218 unsolved in 6282 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 144/144 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 230/374 variables, 144/148 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 218/366 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 1/375 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/375 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 367 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8203 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 144/144 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 14533ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 14544ms
Starting structural reductions in SI_CTL mode, iteration 1 : 144/400 places, 231/512 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14854 ms. Remains : 144/400 places, 231/512 transitions.
[2024-06-02 18:17:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:10] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:17:10] [INFO ] Input system was already deterministic with 231 transitions.
[2024-06-02 18:17:10] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:17:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:17:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1415577104245438586.gal : 2 ms
[2024-06-02 18:17:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality318041642063888963.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1415577104245438586.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality318041642063888963.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality318041642063888963.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 163
RANDOM walk for 40000 steps (3998 resets) in 534 ms. (74 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :163 after 15278
BEST_FIRST walk for 40003 steps (579 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Reachability property CO4-PT-14-CTLFireability-2024-02 is true.
FORMULA CO4-PT-14-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,23004,0.064285,5556,2,791,13,6718,6,0,799,4531,0
Total reachable state count : 23004

Verifying 1 reachability properties.
Reachability property CO4-PT-14-CTLFireability-2024-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-14-CTLFireability-2024-02,106,0.064917,5556,2,217,13,6718,7,0,802,4531,0
Finished probabilistic random walk after 919 steps, run visited all 1 properties in 12 ms. (steps per millisecond=76 )
Probabilistic random walk after 919 steps, saw 461 distinct states, run finished after 20 ms. (steps per millisecond=45 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 373 transition count 485
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 373 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 373 transition count 484
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 69 place count 359 transition count 469
Iterating global reduction 1 with 14 rules applied. Total rules applied 83 place count 359 transition count 469
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 356 transition count 466
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 356 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 356 transition count 465
Applied a total of 90 rules in 18 ms. Remains 356 /400 variables (removed 44) and now considering 465/512 (removed 47) transitions.
// Phase 1: matrix 465 rows 356 cols
[2024-06-02 18:17:10] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:17:10] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-02 18:17:10] [INFO ] Invariant cache hit.
[2024-06-02 18:17:10] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-06-02 18:17:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (OVERLAPS) 465/821 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 18:17:22] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 19 ms to minimize.
[2024-06-02 18:17:22] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/821 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 0/821 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 362 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 465/821 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 464/826 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (OVERLAPS) 0/821 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Int declared 821/821 variables, and 826 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 356/400 places, 465/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60505 ms. Remains : 356/400 places, 465/512 transitions.
[2024-06-02 18:18:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:18:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:18:10] [INFO ] Input system was already deterministic with 465 transitions.
[2024-06-02 18:18:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:18:10] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:18:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13593828280914060678.gal : 3 ms
[2024-06-02 18:18:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1046293550157929901.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/CTLFireability13593828280914060678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1046293550157929901.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76253e+08,0.325204,15620,2,3277,5,40238,6,0,1886,50411,0


Converting to forward existential form...Done !
original formula: EF(EX(((p443==1) + AF((p613==1)))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * (p443==1))] != FALSE + [(EY(FwdU(Init,TRUE)) * !(EG(!((p613==1)))))] != FALSE)
(forward)formula 0,1,0.422236,15884,1,0,8,40238,8,1,3030,50411,2
FORMULA CO4-PT-14-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Graph (trivial) has 413 edges and 400 vertex of which 2 / 400 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 660 edges and 399 vertex of which 396 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 157 place count 395 transition count 352
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 159 rules applied. Total rules applied 316 place count 240 transition count 348
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 319 place count 237 transition count 348
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 319 place count 237 transition count 313
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 389 place count 202 transition count 313
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 398 place count 193 transition count 303
Iterating global reduction 3 with 9 rules applied. Total rules applied 407 place count 193 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 409 place count 193 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 409 place count 193 transition count 300
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 411 place count 192 transition count 300
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 414 place count 189 transition count 297
Iterating global reduction 4 with 3 rules applied. Total rules applied 417 place count 189 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 419 place count 189 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 420 place count 188 transition count 295
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 458 place count 169 transition count 275
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 462 place count 169 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 463 place count 168 transition count 271
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 466 place count 165 transition count 268
Iterating global reduction 8 with 3 rules applied. Total rules applied 469 place count 165 transition count 268
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 8 with 2 rules applied. Total rules applied 471 place count 164 transition count 267
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 472 place count 163 transition count 266
Iterating global reduction 8 with 1 rules applied. Total rules applied 473 place count 163 transition count 266
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 474 place count 162 transition count 264
Iterating global reduction 8 with 1 rules applied. Total rules applied 475 place count 162 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 476 place count 162 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 488 place count 162 transition count 251
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 9 with 7 rules applied. Total rules applied 495 place count 162 transition count 244
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 502 place count 155 transition count 244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 502 place count 155 transition count 243
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 504 place count 154 transition count 243
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 11 with 2 rules applied. Total rules applied 506 place count 153 transition count 242
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 508 place count 153 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 509 place count 153 transition count 241
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 510 place count 153 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 511 place count 152 transition count 240
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 513 place count 150 transition count 238
Applied a total of 513 rules in 59 ms. Remains 150 /400 variables (removed 250) and now considering 238/512 (removed 274) transitions.
// Phase 1: matrix 238 rows 150 cols
[2024-06-02 18:18:11] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:18:11] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:18:11] [INFO ] Invariant cache hit.
[2024-06-02 18:18:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:18:11] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-06-02 18:18:11] [INFO ] Redundant transitions in 2 ms returned []
Running 226 sub problems to find dead transitions.
[2024-06-02 18:18:11] [INFO ] Invariant cache hit.
[2024-06-02 18:18:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 237/387 variables, 150/154 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 1/388 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/388 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 155 constraints, problems are : Problem set: 0 solved, 226 unsolved in 6053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 237/387 variables, 150/154 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 226/380 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 1/388 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 381 constraints, problems are : Problem set: 0 solved, 226 unsolved in 9369 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints]
After SMT, in 15478ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 15482ms
Starting structural reductions in SI_CTL mode, iteration 1 : 150/400 places, 238/512 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15695 ms. Remains : 150/400 places, 238/512 transitions.
[2024-06-02 18:18:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:18:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:18:27] [INFO ] Input system was already deterministic with 238 transitions.
[2024-06-02 18:18:27] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:18:27] [INFO ] Time to serialize gal into /tmp/CTLFireability312556255003124265.gal : 2 ms
[2024-06-02 18:18:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5487762790212334167.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/CTLFireability312556255003124265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5487762790212334167.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.04712e+06,0.068233,6044,2,735,5,9515,6,0,830,8847,0


Converting to forward existential form...Done !
original formula: EG(A(!(AF((((p538==1)||(p280==1)) + AF((p424==1))))) U A(AG(E((p524==1) U (p629==1))) U !(((p596==1)&&(p661==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!((E(!(!(((p596==1)&&(p661==1)))) U (!(!(E(TRUE U !(E((p524==1) U (p629==1)))))) * !(!(((p596=...609
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t9, t49, t79, t88, t93, t151, t229, Intersection with reachable at each step enabled...205
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.57907,288464,1,0,980,1.57416e+06,527,639,5607,1.96146e+06,1298
FORMULA CO4-PT-14-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Graph (trivial) has 417 edges and 400 vertex of which 2 / 400 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 660 edges and 399 vertex of which 396 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 395 transition count 356
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 156 rules applied. Total rules applied 309 place count 244 transition count 351
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 313 place count 240 transition count 351
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 313 place count 240 transition count 315
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 385 place count 204 transition count 315
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 397 place count 192 transition count 302
Iterating global reduction 3 with 12 rules applied. Total rules applied 409 place count 192 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 411 place count 192 transition count 300
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 411 place count 192 transition count 298
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 415 place count 190 transition count 298
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 419 place count 186 transition count 293
Iterating global reduction 4 with 4 rules applied. Total rules applied 423 place count 186 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 425 place count 186 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 426 place count 185 transition count 291
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 462 place count 167 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 464 place count 167 transition count 271
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 467 place count 164 transition count 268
Iterating global reduction 7 with 3 rules applied. Total rules applied 470 place count 164 transition count 268
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 474 place count 162 transition count 266
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 7 with 3 rules applied. Total rules applied 477 place count 162 transition count 263
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 480 place count 161 transition count 261
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 482 place count 160 transition count 260
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 483 place count 159 transition count 259
Iterating global reduction 10 with 1 rules applied. Total rules applied 484 place count 159 transition count 259
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 485 place count 158 transition count 257
Iterating global reduction 10 with 1 rules applied. Total rules applied 486 place count 158 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 487 place count 158 transition count 256
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 11 with 2 rules applied. Total rules applied 489 place count 157 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 500 place count 157 transition count 244
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 11 with 7 rules applied. Total rules applied 507 place count 157 transition count 237
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 514 place count 150 transition count 237
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 13 with 2 rules applied. Total rules applied 516 place count 149 transition count 236
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 518 place count 147 transition count 234
Applied a total of 518 rules in 39 ms. Remains 147 /400 variables (removed 253) and now considering 234/512 (removed 278) transitions.
// Phase 1: matrix 234 rows 147 cols
[2024-06-02 18:18:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:18:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 18:18:35] [INFO ] Invariant cache hit.
[2024-06-02 18:18:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:18:35] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-06-02 18:18:35] [INFO ] Redundant transitions in 2 ms returned []
Running 225 sub problems to find dead transitions.
[2024-06-02 18:18:35] [INFO ] Invariant cache hit.
[2024-06-02 18:18:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 233/379 variables, 146/150 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/380 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 1/381 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 0/381 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 152 constraints, problems are : Problem set: 0 solved, 225 unsolved in 6643 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 233/379 variables, 146/150 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 126/276 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 1/380 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 99/376 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 1/381 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 0/381 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 377 constraints, problems are : Problem set: 0 solved, 225 unsolved in 10581 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints]
After SMT, in 17285ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 17287ms
Starting structural reductions in SI_CTL mode, iteration 1 : 147/400 places, 234/512 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17474 ms. Remains : 147/400 places, 234/512 transitions.
[2024-06-02 18:18:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:18:53] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:53] [INFO ] Input system was already deterministic with 234 transitions.
[2024-06-02 18:18:53] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:18:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15818030047265986577.gal : 2 ms
[2024-06-02 18:18:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10215297588461064732.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/CTLFireability15818030047265986577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10215297588461064732.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.58941e+06,0.061133,5756,2,747,5,8131,6,0,814,6729,0


Converting to forward existential form...Done !
original formula: AG((AF(!(E((p666==1) U EF((p437==1))))) + (p338==0)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((p338==0))),!(!(E((p666==1) U E(TRUE U (p437==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t44, t75, t84, t89, t126, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,0,1.18249,45464,1,0,330,202306,500,197,5222,213866,528
FORMULA CO4-PT-14-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 373 transition count 484
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 373 transition count 484
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 69 place count 358 transition count 468
Iterating global reduction 0 with 15 rules applied. Total rules applied 84 place count 358 transition count 468
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 354 transition count 464
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 354 transition count 464
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 354 transition count 462
Applied a total of 94 rules in 20 ms. Remains 354 /400 variables (removed 46) and now considering 462/512 (removed 50) transitions.
// Phase 1: matrix 462 rows 354 cols
[2024-06-02 18:18:54] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:18:54] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 18:18:54] [INFO ] Invariant cache hit.
[2024-06-02 18:18:54] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-02 18:18:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/816 variables, 354/358 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 18:19:06] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-06-02 18:19:06] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/816 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (OVERLAPS) 0/816 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/816 variables, and 360 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 462/816 variables, 354/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 461/821 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 0/816 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/816 variables, and 821 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 2/2 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 354/400 places, 462/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60388 ms. Remains : 354/400 places, 462/512 transitions.
[2024-06-02 18:19:54] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:19:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:19:54] [INFO ] Input system was already deterministic with 462 transitions.
[2024-06-02 18:19:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:19:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:19:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12495046443350574952.gal : 2 ms
[2024-06-02 18:19:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16655897399904978702.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/CTLFireability12495046443350574952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16655897399904978702.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E((p456==1) U E(AF(!(((p498==1)||(!((p277==1)&&(p589==1)))))) U A(EG(AX(((p90==1)&&(p589==1)))) U ((!((p410==1)&&(p666==1)))&&(((p160==1)...196
=> equivalent forward existential formula: [((FwdU(FwdU(Init,(p456==1)),!(EG(!(!(((p498==1)||(!((p277==1)&&(p589==1))))))))) * !(EG(!(((!((p410==1)&&(p666=...441
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t26, t31, t32, t34, t35, t39, t40, t43, t127, t158, t184, t191, ...399
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 18:20:24] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:20:24] [INFO ] Applying decomposition
[2024-06-02 18:20:24] [INFO ] Flatten gal took : 14 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/graph9342393154899702229.txt' '-o' '/tmp/graph9342393154899702229.bin' '-w' '/tmp/graph9342393154899702229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9342393154899702229.bin' '-l' '-1' '-v' '-w' '/tmp/graph9342393154899702229.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:20:25] [INFO ] Decomposing Gal with order
[2024-06-02 18:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:20:25] [INFO ] Removed a total of 172 redundant transitions.
[2024-06-02 18:20:25] [INFO ] Flatten gal took : 52 ms
[2024-06-02 18:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 10 ms.
[2024-06-02 18:20:25] [INFO ] Time to serialize gal into /tmp/CTLFireability5173002616201180901.gal : 7 ms
[2024-06-02 18:20:25] [INFO ] Time to serialize properties into /tmp/CTLFireability7666908159802949609.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/CTLFireability5173002616201180901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7666908159802949609.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6372e+08,0.144687,9024,494,70,9516,1445,824,14331,93,6343,0


Converting to forward existential form...Done !
original formula: E((i12.u88.p456==1) U E(AF(!(((i14.u100.p498==1)||(!((i6.u69.p277==1)&&(i6.u69.p589==1)))))) U A(EG(AX(((i3.u4.p90==1)&&(i6.u69.p589==1))...288
=> equivalent forward existential formula: [((FwdU(FwdU(Init,(i12.u88.p456==1)),!(EG(!(!(((i14.u100.p498==1)||(!((i6.u69.p277==1)&&(i6.u69.p589==1)))))))))...629
Reverse transition relation is NOT exact ! Due to transitions t43, t127, t194, t198, t220, t242, t245, t304, t412, i1.t314, i2.u21.t354, i3.t373, i3.t370, ...566
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,14.6579,469184,1,0,645065,5308,5740,2.88825e+06,507,23328,653279
FORMULA CO4-PT-14-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 376 transition count 487
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 376 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 376 transition count 486
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 364 transition count 473
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 364 transition count 473
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 360 transition count 469
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 360 transition count 469
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 360 transition count 467
Applied a total of 83 rules in 26 ms. Remains 360 /400 variables (removed 40) and now considering 467/512 (removed 45) transitions.
// Phase 1: matrix 467 rows 360 cols
[2024-06-02 18:20:39] [INFO ] Computed 4 invariants in 8 ms
[2024-06-02 18:20:40] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:20:40] [INFO ] Invariant cache hit.
[2024-06-02 18:20:40] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-06-02 18:20:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (OVERLAPS) 467/827 variables, 360/364 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-02 18:20:52] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 13 ms to minimize.
[2024-06-02 18:20:52] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/827 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 0/827 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 466 unsolved
No progress, stopping.
After SMT solving in domain Real declared 827/827 variables, and 366 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 467/827 variables, 360/366 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/827 variables, 466/832 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (OVERLAPS) 0/827 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 466 unsolved
No progress, stopping.
After SMT solving in domain Int declared 827/827 variables, and 832 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 2/2 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 360/400 places, 467/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60406 ms. Remains : 360/400 places, 467/512 transitions.
[2024-06-02 18:21:40] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:21:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:21:40] [INFO ] Input system was already deterministic with 467 transitions.
[2024-06-02 18:21:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:21:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:21:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5763638751260936668.gal : 3 ms
[2024-06-02 18:21:40] [INFO ] Time to serialize properties into /tmp/CTLFireability5958197526866529990.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/CTLFireability5763638751260936668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5958197526866529990.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.75873e+08,0.466569,18308,2,3710,5,49691,6,0,1904,63106,0


Converting to forward existential form...Done !
original formula: E(EX(A((A((p154==1) U (p415==1)) + AG((p457==1))) U EX(AF((p644==1))))) U (!(AX((EF((p646==1)) + (p158==1)))) + ((p101==1)&&(p589==1))))
=> equivalent forward existential formula: ([((EY(FwdU(Init,EX(!((E(!(EX(!(EG(!((p644==1)))))) U (!((!((E(!((p415==1)) U (!((p154==1)) * !((p415==1)))) + E...585
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t21, t27, t32, t33, t35, t36, t40, t41, t44, t128, t159, t185, t...392
Detected timeout of ITS tools.
[2024-06-02 18:22:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:22:10] [INFO ] Applying decomposition
[2024-06-02 18:22:10] [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/graph1304663082442173875.txt' '-o' '/tmp/graph1304663082442173875.bin' '-w' '/tmp/graph1304663082442173875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1304663082442173875.bin' '-l' '-1' '-v' '-w' '/tmp/graph1304663082442173875.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:22:10] [INFO ] Decomposing Gal with order
[2024-06-02 18:22:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:22:10] [INFO ] Removed a total of 160 redundant transitions.
[2024-06-02 18:22:10] [INFO ] Flatten gal took : 29 ms
[2024-06-02 18:22:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 5 ms.
[2024-06-02 18:22:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5303516870101590722.gal : 19 ms
[2024-06-02 18:22:10] [INFO ] Time to serialize properties into /tmp/CTLFireability18092465457817198395.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/CTLFireability5303516870101590722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18092465457817198395.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.75873e+08,0.131533,9036,448,74,9664,1361,830,14318,104,5346,0


Converting to forward existential form...Done !
original formula: E(EX(A((A((i2.u14.p154==1) U (i13.u67.p415==1)) + AG((i9.u79.p457==1))) U EX(AF((i17.u119.p644==1))))) U (!(AX((EF((i17.u117.p646==1)) + ...226
=> equivalent forward existential formula: ([((EY(FwdU(Init,EX(!((E(!(EX(!(EG(!((i17.u119.p644==1)))))) U (!((!((E(!((i13.u67.p415==1)) U (!((i2.u14.p154==...756
Reverse transition relation is NOT exact ! Due to transitions t44, t159, t195, t199, t246, t376, t414, i3.i0.i1.u21.t356, i3.i1.i0.u7.t380, i4.t305, i4.u25...586
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 an SCC at level 4
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
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
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
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
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,0,14.5253,479940,1,0,601238,4981,5895,3.52712e+06,574,21303,484001
FORMULA CO4-PT-14-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Graph (trivial) has 417 edges and 400 vertex of which 2 / 400 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 660 edges and 399 vertex of which 396 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 395 transition count 356
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 158 rules applied. Total rules applied 311 place count 244 transition count 349
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 317 place count 238 transition count 349
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 317 place count 238 transition count 314
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 387 place count 203 transition count 314
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 399 place count 191 transition count 301
Iterating global reduction 3 with 12 rules applied. Total rules applied 411 place count 191 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 413 place count 191 transition count 299
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 413 place count 191 transition count 297
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 417 place count 189 transition count 297
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 421 place count 185 transition count 292
Iterating global reduction 4 with 4 rules applied. Total rules applied 425 place count 185 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 427 place count 185 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 428 place count 184 transition count 290
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 464 place count 166 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 466 place count 166 transition count 270
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 469 place count 163 transition count 267
Iterating global reduction 7 with 3 rules applied. Total rules applied 472 place count 163 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 476 place count 161 transition count 265
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 7 with 3 rules applied. Total rules applied 479 place count 161 transition count 262
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 482 place count 160 transition count 260
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 484 place count 159 transition count 259
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 485 place count 158 transition count 258
Iterating global reduction 10 with 1 rules applied. Total rules applied 486 place count 158 transition count 258
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 487 place count 157 transition count 256
Iterating global reduction 10 with 1 rules applied. Total rules applied 488 place count 157 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 489 place count 157 transition count 255
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 11 with 2 rules applied. Total rules applied 491 place count 156 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 501 place count 156 transition count 244
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 11 with 6 rules applied. Total rules applied 507 place count 156 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 513 place count 150 transition count 238
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 13 with 2 rules applied. Total rules applied 515 place count 149 transition count 237
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 517 place count 147 transition count 235
Applied a total of 517 rules in 61 ms. Remains 147 /400 variables (removed 253) and now considering 235/512 (removed 277) transitions.
// Phase 1: matrix 235 rows 147 cols
[2024-06-02 18:22:25] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:22:25] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:22:25] [INFO ] Invariant cache hit.
[2024-06-02 18:22:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:22:25] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-06-02 18:22:25] [INFO ] Redundant transitions in 2 ms returned []
Running 226 sub problems to find dead transitions.
[2024-06-02 18:22:25] [INFO ] Invariant cache hit.
[2024-06-02 18:22:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 234/380 variables, 146/150 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 1/381 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 1/382 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/382 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 152 constraints, problems are : Problem set: 0 solved, 226 unsolved in 6660 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 234/380 variables, 146/150 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 128/278 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 1/381 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 98/377 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 378 constraints, problems are : Problem set: 0 solved, 226 unsolved in 10716 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints]
After SMT, in 17430ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 17432ms
Starting structural reductions in SI_CTL mode, iteration 1 : 147/400 places, 235/512 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17652 ms. Remains : 147/400 places, 235/512 transitions.
[2024-06-02 18:22:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:22:42] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:22:42] [INFO ] Input system was already deterministic with 235 transitions.
[2024-06-02 18:22:42] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:22:42] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:22:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9430923091744005680.gal : 2 ms
[2024-06-02 18:22:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8382531976497752465.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/CTLFireability9430923091744005680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8382531976497752465.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.58941e+06,0.057598,5524,2,712,5,7548,6,0,815,5829,0


Converting to forward existential form...Done !
original formula: AG(!(E((p538==1) U ((p440==1)&&(p666==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),(p538==1)) * ((p440==1)&&(p666==1)))] = FALSE
Hit Full ! (commute/partial/dont) 232/0/3
(forward)formula 0,0,0.070134,5788,1,0,8,7548,15,1,1314,5829,4
FORMULA CO4-PT-14-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 375 transition count 486
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 375 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 375 transition count 485
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 362 transition count 471
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 362 transition count 471
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 358 transition count 467
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 358 transition count 467
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 358 transition count 465
Applied a total of 87 rules in 18 ms. Remains 358 /400 variables (removed 42) and now considering 465/512 (removed 47) transitions.
// Phase 1: matrix 465 rows 358 cols
[2024-06-02 18:22:43] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:22:43] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:22:43] [INFO ] Invariant cache hit.
[2024-06-02 18:22:43] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-06-02 18:22:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (OVERLAPS) 465/823 variables, 358/362 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 18:22:55] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:22:55] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 0/823 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 364 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 465/823 variables, 358/364 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 464/828 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (OVERLAPS) 0/823 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 828 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 358/400 places, 465/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60404 ms. Remains : 358/400 places, 465/512 transitions.
[2024-06-02 18:23:43] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:23:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:23:43] [INFO ] Input system was already deterministic with 465 transitions.
[2024-06-02 18:23:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:23:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:23:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4842519950863962132.gal : 1 ms
[2024-06-02 18:23:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13304105461881721956.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/CTLFireability4842519950863962132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13304105461881721956.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62379e+08,0.468631,18028,2,3247,5,45285,6,0,1894,64925,0


Converting to forward existential form...Done !
original formula: EG(AX((EF((p380==0)) * ((EF((p633==0)) + (p551==1)) + ((p91==1)&&((p533==1)||((p641==1)&&(p670==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((E(TRUE U (p380==0)) * ((E(TRUE U (p633==0)) + (p551==1)) + ((p91==1)&&((p533==1)||((p641==1)&...184
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t26, t31, t32, t34, t35, t39, t40, t43, t129, t160, t186, t194, ...393
(forward)formula 0,1,7.84364,202040,1,0,604,868757,958,387,11506,776801,968
FORMULA CO4-PT-14-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 372 transition count 483
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 372 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 372 transition count 482
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 358 transition count 467
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 358 transition count 467
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 354 transition count 463
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 354 transition count 463
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 354 transition count 461
Applied a total of 95 rules in 25 ms. Remains 354 /400 variables (removed 46) and now considering 461/512 (removed 51) transitions.
// Phase 1: matrix 461 rows 354 cols
[2024-06-02 18:23:51] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:23:51] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 18:23:51] [INFO ] Invariant cache hit.
[2024-06-02 18:23:51] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-02 18:23:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/815 variables, 354/358 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-02 18:24:03] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:24:03] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 360 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/815 variables, 354/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 460/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (OVERLAPS) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 820 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 354/400 places, 461/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60427 ms. Remains : 354/400 places, 461/512 transitions.
[2024-06-02 18:24:51] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:51] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:51] [INFO ] Input system was already deterministic with 461 transitions.
[2024-06-02 18:24:51] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:24:51] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3845689304117004423.gal : 17 ms
[2024-06-02 18:24:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7857240984510937902.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/CTLFireability3845689304117004423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7857240984510937902.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.59257e+08,0.347351,16160,2,3127,5,40908,6,0,1874,53604,0


Converting to forward existential form...Done !
original formula: EF((EG(EX(AF((p290==0)))) * ((p276==0) + EX((((p276==1)&&(p648==1))&&(p670==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * EG(EX(!(EG(!((p290==0))))))) * (p276==0))] != FALSE + [(EY((FwdU(Init,TRUE) * EG(EX(!(EG(!...222
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t26, t31, t32, t34, t35, t39, t40, t43, t127, t158, t184, t191, ...399
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 18:25:22] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:25:22] [INFO ] Applying decomposition
[2024-06-02 18:25:22] [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/graph18313486490394746394.txt' '-o' '/tmp/graph18313486490394746394.bin' '-w' '/tmp/graph18313486490394746394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18313486490394746394.bin' '-l' '-1' '-v' '-w' '/tmp/graph18313486490394746394.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:25:22] [INFO ] Decomposing Gal with order
[2024-06-02 18:25:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:25:22] [INFO ] Removed a total of 155 redundant transitions.
[2024-06-02 18:25:22] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:25:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 6 ms.
[2024-06-02 18:25:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9181889140367515776.gal : 5 ms
[2024-06-02 18:25:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5362946654426019318.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/CTLFireability9181889140367515776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5362946654426019318.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.59257e+08,0.123916,8180,377,69,6664,1747,852,11169,86,7021,0


Converting to forward existential form...Done !
original formula: EF((EG(EX(AF((i6.i0.u31.p290==0)))) * ((i5.i4.u4.p276==0) + EX((((i5.i4.u4.p276==1)&&(i18.i0.u119.p648==1))&&(i18.i2.u122.p670==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * EG(EX(!(EG(!((i6.i0.u31.p290==0))))))) * (i5.i4.u4.p276==0))] != FALSE + [(EY((FwdU(Init,T...284
Reverse transition relation is NOT exact ! Due to transitions t43, t194, t208, t219, t227, t231, t232, t245, t314, t373, t411, i1.t370, i1.u8.t377, i2.u22....632
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
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
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
Fast SCC detection found an SCC at level 18
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
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
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
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,6.7857,195884,1,0,256127,2673,4798,1.1995e+06,434,12661,213486
FORMULA CO4-PT-14-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 373 transition count 484
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 373 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 373 transition count 483
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 69 place count 359 transition count 468
Iterating global reduction 1 with 14 rules applied. Total rules applied 83 place count 359 transition count 468
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 355 transition count 464
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 355 transition count 464
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 355 transition count 462
Applied a total of 93 rules in 14 ms. Remains 355 /400 variables (removed 45) and now considering 462/512 (removed 50) transitions.
// Phase 1: matrix 462 rows 355 cols
[2024-06-02 18:25:29] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:25:29] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 18:25:29] [INFO ] Invariant cache hit.
[2024-06-02 18:25:29] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-02 18:25:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/817 variables, 355/359 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 18:25:41] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-06-02 18:25:41] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (OVERLAPS) 0/817 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 361 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 462/817 variables, 355/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 461/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 0/817 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Int declared 817/817 variables, and 822 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 2/2 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 355/400 places, 462/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60448 ms. Remains : 355/400 places, 462/512 transitions.
[2024-06-02 18:26:29] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:26:29] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:26:29] [INFO ] Input system was already deterministic with 462 transitions.
[2024-06-02 18:26:29] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:26:29] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:26:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17109515610735481151.gal : 1 ms
[2024-06-02 18:26:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5276059346021229544.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/CTLFireability17109515610735481151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5276059346021229544.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.60527e+08,0.343284,16168,2,3171,5,41669,6,0,1879,54092,0


Converting to forward existential form...Done !
original formula: EF(((AX(AG((p577==0))) * !(A((A((p111==1) U (p116==1)) * (p564==1)) U !(EG((p225==1)))))) * ((p435==1) * EG(((p137==1)||(p275==1))))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * (!(EX(!(!(E(TRUE U !((p577==0))))))) * !(!((E(!(!(EG((p225==1)))) U (!((!((E(!((p116==...328
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t26, t31, t32, t34, t35, t39, t40, t43, t127, t158, t184, t191, ...399
Detected timeout of ITS tools.
[2024-06-02 18:26:59] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:26:59] [INFO ] Applying decomposition
[2024-06-02 18:26:59] [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/graph9837420069544017792.txt' '-o' '/tmp/graph9837420069544017792.bin' '-w' '/tmp/graph9837420069544017792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9837420069544017792.bin' '-l' '-1' '-v' '-w' '/tmp/graph9837420069544017792.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:26:59] [INFO ] Decomposing Gal with order
[2024-06-02 18:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:26:59] [INFO ] Removed a total of 159 redundant transitions.
[2024-06-02 18:26:59] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:26:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 6 ms.
[2024-06-02 18:26:59] [INFO ] Time to serialize gal into /tmp/CTLFireability13198688159282994991.gal : 4 ms
[2024-06-02 18:26:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17874687620767119573.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/CTLFireability13198688159282994991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17874687620767119573.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,1.60527e+08,0.122336,8224,377,67,6889,1826,862,11233,85,6996,0


Converting to forward existential form...Done !
original formula: EF(((AX(AG((i17.i4.u108.p577==0))) * !(A((A((i4.i0.u8.p111==1) U (i1.i2.u10.p116==1)) * (i17.i3.u103.p564==1)) U !(EG((i2.i2.u28.p225==1)...236
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * (!(EX(!(!(E(TRUE U !((i17.i4.u108.p577==0))))))) * !(!((E(!(!(EG((i2.i2.u28.p225==1)))...452
Reverse transition relation is NOT exact ! Due to transitions t43, t75, t127, t158, t194, t198, t245, t379, t412, i1.i2.u23.t355, i2.t315, i2.i1.t305, i3.i...664
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 an SCC at level 4
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
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
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
Fast SCC detection found an SCC at level 18
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 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
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,7.19918,233152,1,0,326782,4025,6036,1.40264e+06,474,20911,295650
FORMULA CO4-PT-14-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Graph (trivial) has 417 edges and 400 vertex of which 2 / 400 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 660 edges and 399 vertex of which 396 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 154 place count 395 transition count 355
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 156 rules applied. Total rules applied 310 place count 243 transition count 351
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 313 place count 240 transition count 351
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 313 place count 240 transition count 315
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 385 place count 204 transition count 315
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 394 place count 195 transition count 305
Iterating global reduction 3 with 9 rules applied. Total rules applied 403 place count 195 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 405 place count 195 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 405 place count 195 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 407 place count 194 transition count 302
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 410 place count 191 transition count 299
Iterating global reduction 4 with 3 rules applied. Total rules applied 413 place count 191 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 415 place count 191 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 416 place count 190 transition count 297
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 456 place count 170 transition count 276
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 460 place count 170 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 461 place count 169 transition count 272
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 464 place count 166 transition count 269
Iterating global reduction 8 with 3 rules applied. Total rules applied 467 place count 166 transition count 269
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 8 with 2 rules applied. Total rules applied 469 place count 165 transition count 268
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 470 place count 164 transition count 267
Iterating global reduction 8 with 1 rules applied. Total rules applied 471 place count 164 transition count 267
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 472 place count 163 transition count 265
Iterating global reduction 8 with 1 rules applied. Total rules applied 473 place count 163 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 474 place count 163 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 487 place count 163 transition count 251
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 9 with 8 rules applied. Total rules applied 495 place count 163 transition count 243
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 503 place count 155 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 503 place count 155 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 505 place count 154 transition count 242
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 11 with 2 rules applied. Total rules applied 507 place count 153 transition count 241
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 512 place count 153 transition count 241
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 514 place count 151 transition count 239
Applied a total of 514 rules in 56 ms. Remains 151 /400 variables (removed 249) and now considering 239/512 (removed 273) transitions.
// Phase 1: matrix 239 rows 151 cols
[2024-06-02 18:27:06] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:27:07] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:27:07] [INFO ] Invariant cache hit.
[2024-06-02 18:27:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:27:07] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-02 18:27:07] [INFO ] Redundant transitions in 1 ms returned []
Running 228 sub problems to find dead transitions.
[2024-06-02 18:27:07] [INFO ] Invariant cache hit.
[2024-06-02 18:27:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/151 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 238/389 variables, 151/155 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-02 18:27:09] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/390 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/390 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 158 constraints, problems are : Problem set: 0 solved, 228 unsolved in 8221 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 238/389 variables, 151/156 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 228/385 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 1/390 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 386 constraints, problems are : Problem set: 0 solved, 228 unsolved in 10213 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 1/1 constraints]
After SMT, in 18488ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 18492ms
Starting structural reductions in SI_CTL mode, iteration 1 : 151/400 places, 239/512 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18713 ms. Remains : 151/400 places, 239/512 transitions.
[2024-06-02 18:27:25] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:27:25] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:27:25] [INFO ] Input system was already deterministic with 239 transitions.
[2024-06-02 18:27:25] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:27:25] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:27:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16431642477006098672.gal : 1 ms
[2024-06-02 18:27:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13676851603826814959.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/CTLFireability16431642477006098672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13676851603826814959.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,3.02498e+06,0.085141,6344,2,1090,5,9956,6,0,834,9905,0


Converting to forward existential form...Done !
original formula: EF((((p389==0) * AG(A(EF((p591==1)) U ((p130==1)||(p629==1))))) * EF(((AG((p584==1)) * (p162==1)) * (p677==0)))))
=> equivalent forward existential formula: [(((FwdU((FwdU(Init,TRUE) * ((p389==0) * !(E(TRUE U !(!((E(!(((p130==1)||(p629==1))) U (!(E(TRUE U (p591==1))) *...293
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t9, t10, t18, t21, t44, t46, t47, t76, t85, t88, t110, t138, t141, t145, t148, t165, ...399
(forward)formula 0,0,0.955165,34880,1,0,365,149290,499,179,5120,114277,487
FORMULA CO4-PT-14-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 375 transition count 486
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 375 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 375 transition count 485
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 362 transition count 471
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 362 transition count 471
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 358 transition count 467
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 358 transition count 467
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 358 transition count 465
Applied a total of 87 rules in 21 ms. Remains 358 /400 variables (removed 42) and now considering 465/512 (removed 47) transitions.
// Phase 1: matrix 465 rows 358 cols
[2024-06-02 18:27:26] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:27:26] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:27:26] [INFO ] Invariant cache hit.
[2024-06-02 18:27:26] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-06-02 18:27:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (OVERLAPS) 465/823 variables, 358/362 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 18:27:39] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:27:39] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 0/823 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 364 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 465/823 variables, 358/364 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 464/828 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (OVERLAPS) 0/823 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 828 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 358/400 places, 465/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60398 ms. Remains : 358/400 places, 465/512 transitions.
[2024-06-02 18:28:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:28:27] [INFO ] Input system was already deterministic with 465 transitions.
[2024-06-02 18:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:28:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4252223879856292088.gal : 1 ms
[2024-06-02 18:28:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1121990762413941401.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/CTLFireability4252223879856292088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1121990762413941401.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62379e+08,0.432299,19348,2,3358,5,47754,6,0,1894,73518,0


Converting to forward existential form...Done !
original formula: AX(((p503==0) * ((A((p557==1) U (p381==1)) + EG((p469==1))) + (AG(EX((p532!=1))) + ((AG((p157==1)) * EG((p459==1))) * AX((p289==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !((p503==0)))] = FALSE * (([(FwdU(((EY(Init) * !((!((E(!((p381==1)) U (!((p557==1)) * !((p381==1))...619
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t26, t31, t32, t34, t35, t39, t40, t43, t128, t160, t186, t193, ...393
Detected timeout of ITS tools.
[2024-06-02 18:28:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:28:57] [INFO ] Applying decomposition
[2024-06-02 18:28:57] [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/graph9356341286725089171.txt' '-o' '/tmp/graph9356341286725089171.bin' '-w' '/tmp/graph9356341286725089171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9356341286725089171.bin' '-l' '-1' '-v' '-w' '/tmp/graph9356341286725089171.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:28:57] [INFO ] Decomposing Gal with order
[2024-06-02 18:28:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:28:57] [INFO ] Removed a total of 149 redundant transitions.
[2024-06-02 18:28:57] [INFO ] Flatten gal took : 32 ms
[2024-06-02 18:28:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 2 ms.
[2024-06-02 18:28:57] [INFO ] Time to serialize gal into /tmp/CTLFireability7056028310516776088.gal : 10 ms
[2024-06-02 18:28:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4800520977133709701.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/CTLFireability7056028310516776088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4800520977133709701.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62379e+08,0.114627,7704,414,74,6913,967,789,9750,100,3262,0


Converting to forward existential form...Done !
original formula: AX(((i12.u90.p503==0) * ((A((i15.u105.p557==1) U (i16.u62.p381==1)) + EG((i10.i0.i1.u84.p469==1))) + (AG(EX((i16.u100.p532!=1))) + ((AG((...230
=> equivalent forward existential formula: ([(EY(Init) * !((i12.u90.p503==0)))] = FALSE * (([(FwdU(((EY(Init) * !((!((E(!((i16.u62.p381==1)) U (!((i15.u105...823
Reverse transition relation is NOT exact ! Due to transitions t43, t200, t210, t221, t247, t375, t413, i1.t349, i1.u11.t351, i3.u18.t356, i4.t306, i4.u23.t...577
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 an SCC at level 4
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
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
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
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,6.3054,239808,1,0,322553,3259,5229,1.68697e+06,531,13206,296226
FORMULA CO4-PT-14-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 512/512 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 373 transition count 484
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 373 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 373 transition count 483
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 70 place count 358 transition count 467
Iterating global reduction 1 with 15 rules applied. Total rules applied 85 place count 358 transition count 467
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 354 transition count 463
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 354 transition count 463
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 354 transition count 461
Applied a total of 95 rules in 15 ms. Remains 354 /400 variables (removed 46) and now considering 461/512 (removed 51) transitions.
// Phase 1: matrix 461 rows 354 cols
[2024-06-02 18:29:03] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:29:03] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-02 18:29:03] [INFO ] Invariant cache hit.
[2024-06-02 18:29:04] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-02 18:29:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/815 variables, 354/358 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-02 18:29:15] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:29:15] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 360 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29729 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/815 variables, 354/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 460/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (OVERLAPS) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 820 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
After SMT, in 59830ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 59835ms
Starting structural reductions in LTL mode, iteration 1 : 354/400 places, 461/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60255 ms. Remains : 354/400 places, 461/512 transitions.
[2024-06-02 18:30:03] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:30:03] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:30:03] [INFO ] Input system was already deterministic with 461 transitions.
[2024-06-02 18:30:03] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:30:03] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:30:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8735893196102752337.gal : 2 ms
[2024-06-02 18:30:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11423391262001819309.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/CTLFireability8735893196102752337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11423391262001819309.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93978e+08,0.390341,18000,2,3730,5,47599,6,0,1874,60722,0


Converting to forward existential form...Done !
original formula: AX(AG((EG((p299==1)) + EX(TRUE))))
=> equivalent forward existential formula: [((FwdU(EY(Init),TRUE) * !(EX(TRUE))) * !(EG((p299==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t26, t31, t32, t34, t35, t39, t40, t43, t127, t158, t184, t191, ...501
Detected timeout of ITS tools.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:30:34] [INFO ] Applying decomposition
[2024-06-02 18:30:34] [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/graph10951958547107676953.txt' '-o' '/tmp/graph10951958547107676953.bin' '-w' '/tmp/graph10951958547107676953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10951958547107676953.bin' '-l' '-1' '-v' '-w' '/tmp/graph10951958547107676953.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:30:34] [INFO ] Decomposing Gal with order
[2024-06-02 18:30:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:30:34] [INFO ] Removed a total of 151 redundant transitions.
[2024-06-02 18:30:34] [INFO ] Flatten gal took : 31 ms
[2024-06-02 18:30:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 5 ms.
[2024-06-02 18:30:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15849962563089506617.gal : 4 ms
[2024-06-02 18:30:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2529826673390790694.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/CTLFireability15849962563089506617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2529826673390790694.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93978e+08,0.122447,8408,435,75,7307,1758,848,12344,91,7025,0


Converting to forward existential form...Done !
original formula: AX(AG((EG((i0.u43.p299==1)) + EX(TRUE))))
=> equivalent forward existential formula: [((FwdU(EY(Init),TRUE) * !(EX(TRUE))) * !(EG((i0.u43.p299==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t198, t208, t238, t245, t315, t336, t354, t374, t412, i0.u43.t246, i0.u43.t248, i1.t371,...846
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
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
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
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,3.04354,119024,1,0,173593,3484,5752,723937,494,15735,187328
FORMULA CO4-PT-14-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-06-02 18:30:37] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:30:37] [INFO ] Flatten gal took : 8 ms
Total runtime 855826 ms.

BK_STOP 1717353037253

--------------------
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-14"
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-14, 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-171734898600106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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