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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 248K 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-17-CTLFireability-2024-00
FORMULA_NAME CO4-PT-17-CTLFireability-2024-01
FORMULA_NAME CO4-PT-17-CTLFireability-2024-02
FORMULA_NAME CO4-PT-17-CTLFireability-2024-03
FORMULA_NAME CO4-PT-17-CTLFireability-2024-04
FORMULA_NAME CO4-PT-17-CTLFireability-2024-05
FORMULA_NAME CO4-PT-17-CTLFireability-2024-06
FORMULA_NAME CO4-PT-17-CTLFireability-2024-07
FORMULA_NAME CO4-PT-17-CTLFireability-2024-08
FORMULA_NAME CO4-PT-17-CTLFireability-2024-09
FORMULA_NAME CO4-PT-17-CTLFireability-2024-10
FORMULA_NAME CO4-PT-17-CTLFireability-2024-11
FORMULA_NAME CO4-PT-17-CTLFireability-2024-12
FORMULA_NAME CO4-PT-17-CTLFireability-2024-13
FORMULA_NAME CO4-PT-17-CTLFireability-2024-14
FORMULA_NAME CO4-PT-17-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717353146193

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:32:27] [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:32:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:32:27] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-02 18:32:27] [INFO ] Transformed 967 places.
[2024-06-02 18:32:27] [INFO ] Transformed 1150 transitions.
[2024-06-02 18:32:27] [INFO ] Found NUPN structural information;
[2024-06-02 18:32:27] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 198 places in 11 ms
Reduce places removed 198 places and 238 transitions.
Support contains 83 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 750 transition count 911
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 164 place count 606 transition count 767
Iterating global reduction 1 with 144 rules applied. Total rules applied 308 place count 606 transition count 767
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 315 place count 606 transition count 760
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 382 place count 539 transition count 693
Iterating global reduction 2 with 67 rules applied. Total rules applied 449 place count 539 transition count 693
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 458 place count 530 transition count 682
Iterating global reduction 2 with 9 rules applied. Total rules applied 467 place count 530 transition count 682
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 469 place count 530 transition count 680
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 471 place count 528 transition count 678
Iterating global reduction 3 with 2 rules applied. Total rules applied 473 place count 528 transition count 678
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 475 place count 526 transition count 676
Iterating global reduction 3 with 2 rules applied. Total rules applied 477 place count 526 transition count 676
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 479 place count 526 transition count 674
Applied a total of 479 rules in 185 ms. Remains 526 /769 variables (removed 243) and now considering 674/912 (removed 238) transitions.
// Phase 1: matrix 674 rows 526 cols
[2024-06-02 18:32:27] [INFO ] Computed 5 invariants in 27 ms
[2024-06-02 18:32:28] [INFO ] Implicit Places using invariants in 318 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 348 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 525/769 places, 674/912 transitions.
Applied a total of 0 rules in 17 ms. Remains 525 /525 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 566 ms. Remains : 525/769 places, 674/912 transitions.
Support contains 83 out of 525 places after structural reductions.
[2024-06-02 18:32:28] [INFO ] Flatten gal took : 70 ms
[2024-06-02 18:32:28] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CO4-PT-17-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:32:28] [INFO ] Flatten gal took : 31 ms
[2024-06-02 18:32:28] [INFO ] Input system was already deterministic with 674 transitions.
Support contains 75 out of 525 places (down from 83) after GAL structural reductions.
RANDOM walk for 40000 steps (137 resets) in 1635 ms. (24 steps per ms) remains 48/62 properties
BEST_FIRST walk for 4003 steps (16 resets) in 50 ms. (78 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (15 resets) in 78 ms. (50 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (17 resets) in 44 ms. (88 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (19 resets) in 26 ms. (148 steps per ms) remains 44/47 properties
BEST_FIRST walk for 4001 steps (14 resets) in 28 ms. (137 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (15 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (17 resets) in 20 ms. (190 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (18 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (15 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (17 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (16 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (20 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (18 resets) in 27 ms. (142 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (18 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (21 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (17 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (15 resets) in 31 ms. (125 steps per ms) remains 39/41 properties
BEST_FIRST walk for 4001 steps (20 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (17 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (16 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4002 steps (16 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (15 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (14 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (16 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (15 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
// Phase 1: matrix 674 rows 525 cols
[2024-06-02 18:32:29] [INFO ] Computed 4 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 10/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 15/73 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 212/285 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 516/801 variables, 216/293 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/801 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 323/1124 variables, 186/479 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 64/1188 variables, 43/522 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1188 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 11/1199 variables, 7/529 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1199 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (OVERLAPS) 0/1199 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1199/1199 variables, and 529 constraints, problems are : Problem set: 0 solved, 38 unsolved in 3665 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 10/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 15/73 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 212/285 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 516/801 variables, 216/296 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/801 variables, 35/331 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/801 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 323/1124 variables, 186/517 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 18:32:34] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1124 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 64/1188 variables, 43/561 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1188 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 16 (OVERLAPS) 11/1199 variables, 7/568 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1199/1199 variables, and 568 constraints, problems are : Problem set: 1 solved, 37 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
After SMT, in 8753ms problems are : Problem set: 1 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 674/674 transitions.
Graph (trivial) has 473 edges and 525 vertex of which 2 / 525 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 869 edges and 524 vertex of which 500 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 500 transition count 490
Reduce places removed 145 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 163 rules applied. Total rules applied 326 place count 355 transition count 472
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 344 place count 337 transition count 472
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 344 place count 337 transition count 430
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 428 place count 295 transition count 430
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 433 place count 290 transition count 425
Iterating global reduction 3 with 5 rules applied. Total rules applied 438 place count 290 transition count 425
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 438 place count 290 transition count 424
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 440 place count 289 transition count 424
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 442 place count 287 transition count 422
Iterating global reduction 3 with 2 rules applied. Total rules applied 444 place count 287 transition count 422
Performed 75 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 594 place count 212 transition count 338
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 602 place count 212 transition count 330
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 606 place count 208 transition count 326
Iterating global reduction 4 with 4 rules applied. Total rules applied 610 place count 208 transition count 326
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 692 place count 167 transition count 329
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 712 place count 167 transition count 309
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 737 place count 142 transition count 259
Iterating global reduction 5 with 25 rules applied. Total rules applied 762 place count 142 transition count 259
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 776 place count 142 transition count 245
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 777 place count 141 transition count 243
Iterating global reduction 6 with 1 rules applied. Total rules applied 778 place count 141 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 779 place count 141 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 789 place count 141 transition count 232
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 800 place count 141 transition count 221
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 812 place count 130 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 814 place count 130 transition count 218
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 820 place count 130 transition count 218
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 821 place count 130 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 822 place count 130 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 823 place count 129 transition count 216
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 8 with 5 rules applied. Total rules applied 828 place count 126 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 830 place count 124 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 832 place count 123 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 846 place count 123 transition count 199
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 849 place count 120 transition count 196
Iterating global reduction 10 with 3 rules applied. Total rules applied 852 place count 120 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 855 place count 120 transition count 193
Free-agglomeration rule applied 13 times.
Iterating global reduction 11 with 13 rules applied. Total rules applied 868 place count 120 transition count 180
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 881 place count 107 transition count 180
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 884 place count 107 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 885 place count 107 transition count 179
Applied a total of 885 rules in 152 ms. Remains 107 /525 variables (removed 418) and now considering 179/674 (removed 495) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 107/525 places, 179/674 transitions.
RANDOM walk for 40000 steps (2146 resets) in 558 ms. (71 steps per ms) remains 1/37 properties
BEST_FIRST walk for 34044 steps (32 resets) in 58 ms. (577 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-06-02 18:32:38] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:32:38] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:32:38] [INFO ] Input system was already deterministic with 674 transitions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 871 edges and 525 vertex of which 519 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Graph (trivial) has 559 edges and 525 vertex of which 2 / 525 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 870 edges and 524 vertex of which 518 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 197 rules applied. Total rules applied 199 place count 517 transition count 468
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 201 rules applied. Total rules applied 400 place count 321 transition count 463
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 404 place count 319 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 405 place count 318 transition count 461
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 405 place count 318 transition count 414
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 499 place count 271 transition count 414
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 510 place count 260 transition count 402
Iterating global reduction 4 with 11 rules applied. Total rules applied 521 place count 260 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 522 place count 260 transition count 401
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 522 place count 260 transition count 396
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 532 place count 255 transition count 396
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 538 place count 249 transition count 390
Iterating global reduction 5 with 6 rules applied. Total rules applied 544 place count 249 transition count 390
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 600 place count 221 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 602 place count 221 transition count 359
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 607 place count 216 transition count 354
Iterating global reduction 6 with 5 rules applied. Total rules applied 612 place count 216 transition count 354
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 613 place count 215 transition count 352
Iterating global reduction 6 with 1 rules applied. Total rules applied 614 place count 215 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 615 place count 215 transition count 351
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 617 place count 214 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 629 place count 214 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 7 rules applied. Total rules applied 636 place count 214 transition count 331
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 643 place count 207 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 645 place count 206 transition count 330
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 647 place count 204 transition count 328
Applied a total of 647 rules in 88 ms. Remains 204 /525 variables (removed 321) and now considering 328/674 (removed 346) transitions.
// Phase 1: matrix 328 rows 204 cols
[2024-06-02 18:32:38] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:32:39] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:32:39] [INFO ] Invariant cache hit.
[2024-06-02 18:32:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:32:39] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-06-02 18:32:39] [INFO ] Redundant transitions in 19 ms returned []
Running 315 sub problems to find dead transitions.
[2024-06-02 18:32:39] [INFO ] Invariant cache hit.
[2024-06-02 18:32:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 327/531 variables, 204/208 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 1/532 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 0/532 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 209 constraints, problems are : Problem set: 0 solved, 315 unsolved in 12262 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 327/531 variables, 204/208 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 315/523 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (OVERLAPS) 1/532 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 0/532 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 524 constraints, problems are : Problem set: 0 solved, 315 unsolved in 16083 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints]
After SMT, in 28574ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 28579ms
Starting structural reductions in SI_CTL mode, iteration 1 : 204/525 places, 328/674 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28968 ms. Remains : 204/525 places, 328/674 transitions.
[2024-06-02 18:33:07] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:33:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:33:07] [INFO ] Input system was already deterministic with 328 transitions.
[2024-06-02 18:33:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:33:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:33:08] [INFO ] Time to serialize gal into /tmp/CTLFireability6931436291804267149.gal : 21 ms
[2024-06-02 18:33:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2494675192066435649.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6931436291804267149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2494675192066435649.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.20121e+08,0.176952,9892,2,1320,5,27313,6,0,1132,18368,0


Converting to forward existential form...Done !
original formula: AF(EG(((p86==1) + (AF(AG((p621==1))) * A((p795==1) U (p431==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p86==1) + (!(EG(!(!(E(TRUE U !((p621==1))))))) * !((E(!((p431==1)) U (!((p795==1)) * !((p431==...195
Reverse transition relation is NOT exact ! Due to transitions t8, t45, t76, t84, t90, t112, t120, t127, t178, t194, Intersection with reachable at each st...216
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,24.8521,616360,1,0,932,3.38892e+06,701,593,7447,3.70577e+06,1363
FORMULA CO4-PT-17-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 492 transition count 641
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 492 transition count 641
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 492 transition count 639
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 84 place count 476 transition count 622
Iterating global reduction 1 with 16 rules applied. Total rules applied 100 place count 476 transition count 622
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 471 transition count 617
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 471 transition count 617
Applied a total of 110 rules in 24 ms. Remains 471 /525 variables (removed 54) and now considering 617/674 (removed 57) transitions.
// Phase 1: matrix 617 rows 471 cols
[2024-06-02 18:33:33] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:33:33] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 18:33:33] [INFO ] Invariant cache hit.
[2024-06-02 18:33:33] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-06-02 18:33:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 18:33:53] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 5 ms to minimize.
[2024-06-02 18:33:53] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 471/525 places, 617/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60556 ms. Remains : 471/525 places, 617/674 transitions.
[2024-06-02 18:34:33] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:34:33] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:34:33] [INFO ] Input system was already deterministic with 617 transitions.
[2024-06-02 18:34:33] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:34:33] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:34:33] [INFO ] Time to serialize gal into /tmp/CTLFireability14467599609991209488.gal : 5 ms
[2024-06-02 18:34:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15939197689949561067.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/CTLFireability14467599609991209488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15939197689949561067.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.87379e+10,1.3016,45148,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Detected timeout of ITS tools.
[2024-06-02 18:35:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:35:03] [INFO ] Applying decomposition
[2024-06-02 18:35:03] [INFO ] Flatten gal took : 13 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/graph16278803636612056671.txt' '-o' '/tmp/graph16278803636612056671.bin' '-w' '/tmp/graph16278803636612056671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16278803636612056671.bin' '-l' '-1' '-v' '-w' '/tmp/graph16278803636612056671.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:35:04] [INFO ] Decomposing Gal with order
[2024-06-02 18:35:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:35:04] [INFO ] Removed a total of 207 redundant transitions.
[2024-06-02 18:35:04] [INFO ] Flatten gal took : 60 ms
[2024-06-02 18:35:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 14 ms.
[2024-06-02 18:35:04] [INFO ] Time to serialize gal into /tmp/CTLFireability18158119416939666487.gal : 8 ms
[2024-06-02 18:35:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8457969626188285243.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/CTLFireability18158119416939666487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8457969626188285243.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.87379e+10,0.247383,13564,695,85,19860,1410,1018,33030,95,5030,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t125, t192, t206, t240, t247, t351, t370, t501, t539, i0.t498, i0.u7.t505, i1.i0.i1...758
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local 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
(forward)formula 0,1,13.2532,315052,1,0,509004,2402,6189,1.74504e+06,462,13556,443324
FORMULA CO4-PT-17-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 498 transition count 647
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 498 transition count 647
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 498 transition count 646
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 486 transition count 633
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 486 transition count 633
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 482 transition count 629
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 482 transition count 629
Applied a total of 87 rules in 22 ms. Remains 482 /525 variables (removed 43) and now considering 629/674 (removed 45) transitions.
// Phase 1: matrix 629 rows 482 cols
[2024-06-02 18:35:17] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:35:17] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-02 18:35:17] [INFO ] Invariant cache hit.
[2024-06-02 18:35:17] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 628 sub problems to find dead transitions.
[2024-06-02 18:35:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 1 (OVERLAPS) 1/482 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 3 (OVERLAPS) 629/1111 variables, 482/486 constraints. Problems are: Problem set: 0 solved, 628 unsolved
[2024-06-02 18:35:39] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 5 ms to minimize.
[2024-06-02 18:35:39] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 488 constraints, problems are : Problem set: 0 solved, 628 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 628/628 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 1 (OVERLAPS) 1/482 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 4 (OVERLAPS) 629/1111 variables, 482/488 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1111 variables, 628/1116 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1111 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1116 constraints, problems are : Problem set: 0 solved, 628 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 628/628 constraints, Known Traps: 2/2 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 628 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 482/525 places, 629/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60550 ms. Remains : 482/525 places, 629/674 transitions.
[2024-06-02 18:36:18] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:36:18] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:36:18] [INFO ] Input system was already deterministic with 629 transitions.
[2024-06-02 18:36:18] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:36:18] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:36:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10057224040680916671.gal : 3 ms
[2024-06-02 18:36:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10076178023523461967.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/CTLFireability10057224040680916671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10076178023523461967.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.03327e+10,1.43194,49412,2,8908,5,165606,6,0,2553,222078,0


Converting to forward existential form...Done !
original formula: AG(((((p87==0)&&(p447==0)) * (((p492==1) + AF(((p570==0)||(p878==0)))) * ((p389==0) + AX((p405==0))))) * (!(A(AG((p771==1)) U ((p437==1)&...201
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(((p87==0)&&(p447==0))))] = FALSE * ([FwdG((FwdU(Init,TRUE) * !((p492==1))),!(((p570==0)|...623
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t127, t159, t185, t...488
Detected timeout of ITS tools.
[2024-06-02 18:36:48] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:36:48] [INFO ] Applying decomposition
[2024-06-02 18:36:48] [INFO ] Flatten gal took : 11 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/graph3303246276151055681.txt' '-o' '/tmp/graph3303246276151055681.bin' '-w' '/tmp/graph3303246276151055681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3303246276151055681.bin' '-l' '-1' '-v' '-w' '/tmp/graph3303246276151055681.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:36:48] [INFO ] Decomposing Gal with order
[2024-06-02 18:36:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:36:48] [INFO ] Removed a total of 220 redundant transitions.
[2024-06-02 18:36:48] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:36:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 6 ms.
[2024-06-02 18:36:48] [INFO ] Time to serialize gal into /tmp/CTLFireability2121414061761538366.gal : 5 ms
[2024-06-02 18:36:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10692801587303052724.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/CTLFireability2121414061761538366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10692801587303052724.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.03327e+10,0.270313,13680,697,74,18592,1153,1103,31969,101,5110,0


Converting to forward existential form...Done !
original formula: AG(((((i4.u4.p87==0)&&(i8.u67.p447==0)) * (((i7.u71.p492==1) + AF(((i6.u90.p570==0)||(i10.u114.p878==0)))) * ((i5.u52.p389==0) + AX((i6.u...290
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(((i4.u4.p87==0)&&(i8.u67.p447==0))))] = FALSE * ([FwdG((FwdU(Init,TRUE) * !((i7.u71.p492...801
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t54, t195, t250, t329, t356, t377, t508, t546, i0.t462, i0.t456, i0.t324, i0.u12.t4...781
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 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,13.3283,406776,1,0,681120,3877,8903,1.93901e+06,598,21296,554958
FORMULA CO4-PT-17-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 494 transition count 643
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 494 transition count 643
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 494 transition count 641
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 79 place count 479 transition count 625
Iterating global reduction 1 with 15 rules applied. Total rules applied 94 place count 479 transition count 625
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 474 transition count 620
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 474 transition count 620
Applied a total of 104 rules in 31 ms. Remains 474 /525 variables (removed 51) and now considering 620/674 (removed 54) transitions.
// Phase 1: matrix 620 rows 474 cols
[2024-06-02 18:37:01] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 18:37:01] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 18:37:01] [INFO ] Invariant cache hit.
[2024-06-02 18:37:02] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2024-06-02 18:37:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1094 variables, 474/478 constraints. Problems are: Problem set: 0 solved, 619 unsolved
[2024-06-02 18:37:22] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 3 ms to minimize.
[2024-06-02 18:37:23] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1094 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1094 variables, and 480 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (OVERLAPS) 620/1094 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1094 variables, 619/1099 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1094 variables, and 1099 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 474/525 places, 620/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60595 ms. Remains : 474/525 places, 620/674 transitions.
[2024-06-02 18:38:02] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:38:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:38:02] [INFO ] Input system was already deterministic with 620 transitions.
[2024-06-02 18:38:02] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:38:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:38:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1714376248766098703.gal : 2 ms
[2024-06-02 18:38:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5864716093040155536.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/CTLFireability1714376248766098703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5864716093040155536.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.91942e+10,1.41211,49252,2,8811,5,165627,6,0,2512,224928,0


Converting to forward existential form...Done !
original formula: (AG(!(E(!(EF((p772==1))) U AG(((p253==1)&&(p878==1)))))) + A((p543==1) U E((EF(AX(FALSE)) * (p222!=1)) U (p437==1))))
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(!((E(!(E((E(TRUE U !(EX(!(FALSE)))) * (p222!=1)) U (p437==1))) U (!((p543==1)) * !(E((E(TR...354
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
(forward)formula 0,1,22.2497,619568,1,0,788,2.71702e+06,1262,510,13980,2.1521e+06,1250
FORMULA CO4-PT-17-CTLFireability-2024-03 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 : 525/525 places, 674/674 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 494 transition count 643
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 494 transition count 643
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 494 transition count 641
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 79 place count 479 transition count 625
Iterating global reduction 1 with 15 rules applied. Total rules applied 94 place count 479 transition count 625
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 474 transition count 620
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 474 transition count 620
Applied a total of 104 rules in 33 ms. Remains 474 /525 variables (removed 51) and now considering 620/674 (removed 54) transitions.
// Phase 1: matrix 620 rows 474 cols
[2024-06-02 18:38:25] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 18:38:25] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:38:25] [INFO ] Invariant cache hit.
[2024-06-02 18:38:25] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2024-06-02 18:38:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1094 variables, 474/478 constraints. Problems are: Problem set: 0 solved, 619 unsolved
[2024-06-02 18:38:45] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 3 ms to minimize.
[2024-06-02 18:38:45] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1094 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1094 variables, and 480 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (OVERLAPS) 620/1094 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1094 variables, 619/1099 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1094 variables, and 1099 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 474/525 places, 620/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60567 ms. Remains : 474/525 places, 620/674 transitions.
[2024-06-02 18:39:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:39:25] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:39:25] [INFO ] Input system was already deterministic with 620 transitions.
[2024-06-02 18:39:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:39:25] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:39:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3565574954122439396.gal : 4 ms
[2024-06-02 18:39:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14212305240011999699.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/CTLFireability3565574954122439396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14212305240011999699.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.9099e+10,1.4976,49924,2,8753,5,170327,6,0,2512,223591,0


Converting to forward existential form...Done !
original formula: EG(((AX(!(A((p110==1) U (p216==1)))) + (p690==1)) * (((p220==0) + EX(AX((p216==0)))) + ((p194==1) * AG((p741==1))))))
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(!(!((E(!((p216==1)) U (!((p110==1)) * !((p216==1)))) + EG(!((p216==1))))))))) + (p690==1)) *...249
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t183, t...488
Detected timeout of ITS tools.
[2024-06-02 18:39:55] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:39:55] [INFO ] Applying decomposition
[2024-06-02 18:39:55] [INFO ] Flatten gal took : 11 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/graph12769693711833225362.txt' '-o' '/tmp/graph12769693711833225362.bin' '-w' '/tmp/graph12769693711833225362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12769693711833225362.bin' '-l' '-1' '-v' '-w' '/tmp/graph12769693711833225362.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:39:55] [INFO ] Decomposing Gal with order
[2024-06-02 18:39:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:39:55] [INFO ] Removed a total of 213 redundant transitions.
[2024-06-02 18:39:55] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:39:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 7 ms.
[2024-06-02 18:39:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13447568101939584209.gal : 4 ms
[2024-06-02 18:39:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12916214437420676556.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/CTLFireability13447568101939584209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12916214437420676556.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.9099e+10,0.228987,12096,651,87,15869,1250,1038,26392,89,4679,0


Converting to forward existential form...Done !
original formula: EG(((AX(!(A((i3.u10.p110==1) U (i2.u26.p216==1)))) + (i11.u113.p690==1)) * (((i2.u26.p220==0) + EX(AX((i2.u26.p216==0)))) + ((i1.u21.p194...188
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(!(!((E(!((i2.u26.p216==1)) U (!((i3.u10.p110==1)) * !((i2.u26.p216==1)))) + EG(!((i2.u26.p21...316
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t64, t197, t248, t352, t451, t457, t503, t541, i0.t500, i0.u7.t507, i2.t444, i2.u26...783
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Graph (trivial) has 564 edges and 525 vertex of which 2 / 525 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 870 edges and 524 vertex of which 518 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 517 transition count 463
Reduce places removed 201 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 316 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 409 place count 315 transition count 460
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 409 place count 315 transition count 413
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 503 place count 268 transition count 413
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 513 place count 258 transition count 403
Iterating global reduction 3 with 10 rules applied. Total rules applied 523 place count 258 transition count 403
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 523 place count 258 transition count 398
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 533 place count 253 transition count 398
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 539 place count 247 transition count 392
Iterating global reduction 3 with 6 rules applied. Total rules applied 545 place count 247 transition count 392
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 603 place count 218 transition count 362
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 605 place count 218 transition count 360
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 611 place count 212 transition count 354
Iterating global reduction 4 with 6 rules applied. Total rules applied 617 place count 212 transition count 354
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 618 place count 211 transition count 352
Iterating global reduction 4 with 1 rules applied. Total rules applied 619 place count 211 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 620 place count 211 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 636 place count 211 transition count 335
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 10 rules applied. Total rules applied 646 place count 211 transition count 325
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 656 place count 201 transition count 325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 656 place count 201 transition count 324
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 658 place count 200 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 660 place count 199 transition count 323
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 662 place count 197 transition count 321
Applied a total of 662 rules in 78 ms. Remains 197 /525 variables (removed 328) and now considering 321/674 (removed 353) transitions.
// Phase 1: matrix 321 rows 197 cols
[2024-06-02 18:40:26] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:40:26] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 18:40:26] [INFO ] Invariant cache hit.
[2024-06-02 18:40:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:40:26] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 18:40:26] [INFO ] Redundant transitions in 4 ms returned []
Running 308 sub problems to find dead transitions.
[2024-06-02 18:40:26] [INFO ] Invariant cache hit.
[2024-06-02 18:40:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 320/517 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 1/518 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 0/518 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 202 constraints, problems are : Problem set: 0 solved, 308 unsolved in 11493 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 320/517 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 308/509 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 1/518 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/518 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Int declared 518/518 variables, and 510 constraints, problems are : Problem set: 0 solved, 308 unsolved in 15202 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints]
After SMT, in 26786ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 26790ms
Starting structural reductions in SI_CTL mode, iteration 1 : 197/525 places, 321/674 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27083 ms. Remains : 197/525 places, 321/674 transitions.
[2024-06-02 18:40:53] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:40:53] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:40:53] [INFO ] Input system was already deterministic with 321 transitions.
[2024-06-02 18:40:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:40:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:40:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10917524368884616432.gal : 2 ms
[2024-06-02 18:40:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14009254111930317846.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10917524368884616432.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14009254111930317846.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (3486 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
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 ...330
BEST_FIRST walk for 40004 steps (467 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 709 steps, run visited all 1 properties in 14 ms. (steps per millisecond=50 )
Probabilistic random walk after 709 steps, saw 483 distinct states, run finished after 22 ms. (steps per millisecond=32 ) properties seen :1
FORMULA CO4-PT-17-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 496 transition count 645
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 496 transition count 645
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 496 transition count 643
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 73 place count 483 transition count 629
Iterating global reduction 1 with 13 rules applied. Total rules applied 86 place count 483 transition count 629
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 479 transition count 625
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 479 transition count 625
Applied a total of 94 rules in 37 ms. Remains 479 /525 variables (removed 46) and now considering 625/674 (removed 49) transitions.
// Phase 1: matrix 625 rows 479 cols
[2024-06-02 18:40:53] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:40:53] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 18:40:53] [INFO ] Invariant cache hit.
[2024-06-02 18:40:53] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 624 sub problems to find dead transitions.
[2024-06-02 18:40:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 3 (OVERLAPS) 625/1104 variables, 479/483 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-06-02 18:41:14] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 4 ms to minimize.
[2024-06-02 18:41:14] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1104 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 485 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 624 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 4 (OVERLAPS) 625/1104 variables, 479/485 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1104 variables, 624/1109 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1104 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 1109 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 2/2 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 624 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 479/525 places, 625/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60605 ms. Remains : 479/525 places, 625/674 transitions.
[2024-06-02 18:41:53] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:41:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:41:53] [INFO ] Input system was already deterministic with 625 transitions.
[2024-06-02 18:41:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:41:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:41:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2808761703933858549.gal : 3 ms
[2024-06-02 18:41:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16152391493054571244.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/CTLFireability2808761703933858549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16152391493054571244.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.95705e+10,1.42565,50308,2,8763,5,165105,6,0,2537,235793,0


Converting to forward existential form...Done !
original formula: (EG(!(E(((p661==1)&&((p855==1)||(p518==1))) U EX((p797==1))))) + (EX((!(E((p520==1) U (p234==1))) + AX((p782==0)))) * (EX(AG((p668==1))) ...186
=> equivalent forward existential formula: ([((Init * !(EG(!(E(((p661==1)&&((p855==1)||(p518==1))) U EX((p797==1))))))) * !(EX((!(E((p520==1) U (p234==1)))...355
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t126, t157, t183, t...488
Detected timeout of ITS tools.
[2024-06-02 18:42:23] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:42:23] [INFO ] Applying decomposition
[2024-06-02 18:42:24] [INFO ] Flatten gal took : 10 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/graph2445615574885613105.txt' '-o' '/tmp/graph2445615574885613105.bin' '-w' '/tmp/graph2445615574885613105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2445615574885613105.bin' '-l' '-1' '-v' '-w' '/tmp/graph2445615574885613105.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:42:24] [INFO ] Decomposing Gal with order
[2024-06-02 18:42:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:42:24] [INFO ] Removed a total of 200 redundant transitions.
[2024-06-02 18:42:24] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:42:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 7 ms.
[2024-06-02 18:42:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4404236980597373243.gal : 4 ms
[2024-06-02 18:42:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6114631934252488697.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/CTLFireability4404236980597373243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6114631934252488697.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.95705e+10,0.229889,12928,692,96,16008,2295,1060,32447,99,9585,0


Converting to forward existential form...Done !
original formula: (EG(!(E(((i8.u108.p661==1)&&((i8.u154.p855==1)||(i4.i1.i1.u74.p518==1))) U EX((i16.u141.p797==1))))) + (EX((!(E((i6.u54.p520==1) U (i2.i1...281
=> equivalent forward existential formula: ([((Init * !(EG(!(E(((i8.u108.p661==1)&&((i8.u154.p855==1)||(i4.i1.i1.u74.p518==1))) U EX((i16.u141.p797==1)))))...488
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t197, t214, t232, t249, t353, t372, t483, t541, i0.t444, i0.t434, i2.t503, i2.i0.i1...785
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 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 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
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 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,23.179,632992,1,0,910370,5986,7714,3.67871e+06,544,27902,730654
FORMULA CO4-PT-17-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Graph (trivial) has 564 edges and 525 vertex of which 2 / 525 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 870 edges and 524 vertex of which 518 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 517 transition count 465
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 204 rules applied. Total rules applied 406 place count 318 transition count 460
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 410 place count 316 transition count 458
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 412 place count 315 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 413 place count 314 transition count 457
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 47 Pre rules applied. Total rules applied 413 place count 314 transition count 410
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 507 place count 267 transition count 410
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 518 place count 256 transition count 398
Iterating global reduction 5 with 11 rules applied. Total rules applied 529 place count 256 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 530 place count 256 transition count 397
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 530 place count 256 transition count 392
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 540 place count 251 transition count 392
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 546 place count 245 transition count 386
Iterating global reduction 6 with 6 rules applied. Total rules applied 552 place count 245 transition count 386
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 610 place count 216 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 612 place count 216 transition count 354
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 618 place count 210 transition count 348
Iterating global reduction 7 with 6 rules applied. Total rules applied 624 place count 210 transition count 348
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 625 place count 209 transition count 346
Iterating global reduction 7 with 1 rules applied. Total rules applied 626 place count 209 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 627 place count 209 transition count 345
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 629 place count 208 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 642 place count 208 transition count 331
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 8 with 8 rules applied. Total rules applied 650 place count 208 transition count 323
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 658 place count 200 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 660 place count 199 transition count 322
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 662 place count 197 transition count 320
Applied a total of 662 rules in 57 ms. Remains 197 /525 variables (removed 328) and now considering 320/674 (removed 354) transitions.
// Phase 1: matrix 320 rows 197 cols
[2024-06-02 18:42:47] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:42:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:42:47] [INFO ] Invariant cache hit.
[2024-06-02 18:42:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:42:47] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 18:42:47] [INFO ] Redundant transitions in 3 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 18:42:47] [INFO ] Invariant cache hit.
[2024-06-02 18:42:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 319/516 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 1/517 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 0/517 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 202 constraints, problems are : Problem set: 0 solved, 307 unsolved in 11510 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 319/516 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 307/508 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 1/517 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 0/517 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 509 constraints, problems are : Problem set: 0 solved, 307 unsolved in 15528 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints]
After SMT, in 27110ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 27113ms
Starting structural reductions in SI_CTL mode, iteration 1 : 197/525 places, 320/674 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27373 ms. Remains : 197/525 places, 320/674 transitions.
[2024-06-02 18:43:14] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:43:14] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:43:14] [INFO ] Input system was already deterministic with 320 transitions.
[2024-06-02 18:43:14] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:43:14] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:43:14] [INFO ] Time to serialize gal into /tmp/CTLFireability1251736086571666666.gal : 1 ms
[2024-06-02 18:43:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17246772580491322658.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/CTLFireability1251736086571666666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17246772580491322658.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.08211e+08,0.154836,9944,2,1260,5,26291,6,0,1096,17444,0


Converting to forward existential form...Done !
original formula: AF((p577==1))
=> equivalent forward existential formula: [FwdG(Init,!((p577==1)))] = FALSE
Hit Full ! (commute/partial/dont) 318/0/2
(forward)formula 0,0,0.750632,30912,1,0,10,161198,20,4,5197,50099,8
FORMULA CO4-PT-17-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Graph (trivial) has 537 edges and 525 vertex of which 2 / 525 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 870 edges and 524 vertex of which 518 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 185 rules applied. Total rules applied 187 place count 517 transition count 480
Reduce places removed 184 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 189 rules applied. Total rules applied 376 place count 333 transition count 475
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 380 place count 331 transition count 473
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 330 transition count 462
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 403 place count 319 transition count 462
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 45 Pre rules applied. Total rules applied 403 place count 319 transition count 417
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 493 place count 274 transition count 417
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 509 place count 258 transition count 400
Iterating global reduction 5 with 16 rules applied. Total rules applied 525 place count 258 transition count 400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 526 place count 258 transition count 399
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 526 place count 258 transition count 394
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 536 place count 253 transition count 394
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 542 place count 247 transition count 388
Iterating global reduction 6 with 6 rules applied. Total rules applied 548 place count 247 transition count 388
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 596 place count 223 transition count 364
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 599 place count 223 transition count 361
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 601 place count 222 transition count 360
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 607 place count 216 transition count 354
Iterating global reduction 8 with 6 rules applied. Total rules applied 613 place count 216 transition count 354
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 614 place count 215 transition count 352
Iterating global reduction 8 with 1 rules applied. Total rules applied 615 place count 215 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 616 place count 215 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 627 place count 215 transition count 340
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 9 with 6 rules applied. Total rules applied 633 place count 215 transition count 334
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 639 place count 209 transition count 334
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 641 place count 208 transition count 333
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 642 place count 208 transition count 333
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 644 place count 206 transition count 331
Applied a total of 644 rules in 70 ms. Remains 206 /525 variables (removed 319) and now considering 331/674 (removed 343) transitions.
// Phase 1: matrix 331 rows 206 cols
[2024-06-02 18:43:15] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:43:15] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:43:15] [INFO ] Invariant cache hit.
[2024-06-02 18:43:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:43:15] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 18:43:15] [INFO ] Redundant transitions in 1 ms returned []
Running 321 sub problems to find dead transitions.
[2024-06-02 18:43:15] [INFO ] Invariant cache hit.
[2024-06-02 18:43:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 330/533 variables, 203/207 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 3/536 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 1/537 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/537 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 211 constraints, problems are : Problem set: 0 solved, 321 unsolved in 12745 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 330/533 variables, 203/207 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 167/374 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 3/536 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 154/531 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 1/537 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 10 (OVERLAPS) 0/537 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/537 variables, and 532 constraints, problems are : Problem set: 0 solved, 321 unsolved in 21216 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 34038ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 34044ms
Starting structural reductions in SI_CTL mode, iteration 1 : 206/525 places, 331/674 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34307 ms. Remains : 206/525 places, 331/674 transitions.
[2024-06-02 18:43:49] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:43:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:43:49] [INFO ] Input system was already deterministic with 331 transitions.
[2024-06-02 18:43:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:43:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:43:49] [INFO ] Time to serialize gal into /tmp/CTLFireability85707022580015183.gal : 1 ms
[2024-06-02 18:43:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12674589463327465630.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/CTLFireability85707022580015183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12674589463327465630.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5368e+08,0.224788,11608,2,1327,5,31627,6,0,1143,32321,0


Converting to forward existential form...Done !
original formula: !(A((((EF((p851==1)) * !(AG((p295==1)))) + !(((!((p404==1)&&(p878==1)))&&(p922==1)))) + ((!((p607==1)&&(p396==1)))||(p955==1))) U (p827==...159
=> equivalent forward existential formula: (([((((FwdU(Init,!((p827==1))) * !((p827==1))) * !(((!((p607==1)&&(p396==1)))||(p955==1)))) * !(!(((!((p404==1)&...436
Reverse transition relation is NOT exact ! Due to transitions t5, t45, t75, t82, t90, t111, t120, t127, t207, t223, Intersection with reachable at each st...216
Hit Full ! (commute/partial/dont) 328/0/3
(forward)formula 0,1,2.10262,76348,1,0,404,399069,693,221,7274,249771,677
FORMULA CO4-PT-17-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 499 transition count 648
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 499 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 499 transition count 646
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 68 place count 485 transition count 631
Iterating global reduction 1 with 14 rules applied. Total rules applied 82 place count 485 transition count 631
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 480 transition count 626
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 480 transition count 626
Applied a total of 92 rules in 29 ms. Remains 480 /525 variables (removed 45) and now considering 626/674 (removed 48) transitions.
// Phase 1: matrix 626 rows 480 cols
[2024-06-02 18:43:52] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:43:52] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 18:43:52] [INFO ] Invariant cache hit.
[2024-06-02 18:43:52] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 625 sub problems to find dead transitions.
[2024-06-02 18:43:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (OVERLAPS) 626/1106 variables, 480/484 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-02 18:44:13] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 3 ms to minimize.
[2024-06-02 18:44:13] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1106/1106 variables, and 486 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (OVERLAPS) 626/1106 variables, 480/486 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1106 variables, 625/1111 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1106 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1106/1106 variables, and 1111 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 2/2 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 480/525 places, 626/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60526 ms. Remains : 480/525 places, 626/674 transitions.
[2024-06-02 18:44:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:44:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:44:52] [INFO ] Input system was already deterministic with 626 transitions.
[2024-06-02 18:44:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:44:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:44:52] [INFO ] Time to serialize gal into /tmp/CTLFireability18265252370054417746.gal : 2 ms
[2024-06-02 18:44:52] [INFO ] Time to serialize properties into /tmp/CTLFireability10542104628329282510.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/CTLFireability18265252370054417746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10542104628329282510.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.99829e+10,1.41785,49508,2,8916,5,165657,6,0,2542,220616,0


Converting to forward existential form...Done !
original formula: (AF(((AF((p387==0)) + (p197==0)) + (((p160==1)||(p552==1))&&((p582==0)||(p805==0))))) * E(((E(!(((p520==1)||(p815==1))) U EX((p211==1))) ...315
=> equivalent forward existential formula: ([FwdG(Init,!(((!(EG(!((p387==0)))) + (p197==0)) + (((p160==1)||(p552==1))&&((p582==0)||(p805==0))))))] = FALSE ...467
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t126, t157, t183, t...500
Detected timeout of ITS tools.
[2024-06-02 18:45:22] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:45:22] [INFO ] Applying decomposition
[2024-06-02 18:45:22] [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/graph16642521600341245223.txt' '-o' '/tmp/graph16642521600341245223.bin' '-w' '/tmp/graph16642521600341245223.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16642521600341245223.bin' '-l' '-1' '-v' '-w' '/tmp/graph16642521600341245223.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:45:22] [INFO ] Decomposing Gal with order
[2024-06-02 18:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:45:22] [INFO ] Removed a total of 201 redundant transitions.
[2024-06-02 18:45:22] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 5 ms.
[2024-06-02 18:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5398123618211540894.gal : 4 ms
[2024-06-02 18:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17796865124813762005.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/CTLFireability5398123618211540894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17796865124813762005.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.99829e+10,0.235245,12848,704,98,17117,1359,1029,30901,100,5343,0


Converting to forward existential form...Done !
original formula: (AF(((AF((i5.u51.p387==0)) + (i2.u25.p197==0)) + (((i2.u19.p160==1)||(i7.u78.p552==1))&&((i7.u87.p582==0)||(i17.u138.p805==0))))) * E(((E...472
=> equivalent forward existential formula: ([FwdG(Init,!(((!(EG(!((i5.u51.p387==0)))) + (i2.u25.p197==0)) + (((i2.u19.p160==1)||(i7.u78.p552==1))&&((i7.u87...650
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t197, t207, t249, t355, t374, t460, t507, t546, i0.t504, i0.u7.t511, i1.t329, i1.i0...859
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 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 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
Fast SCC detection found an SCC at level 19
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 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 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
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 495 transition count 644
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 495 transition count 644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 495 transition count 642
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 77 place count 480 transition count 626
Iterating global reduction 1 with 15 rules applied. Total rules applied 92 place count 480 transition count 626
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 475 transition count 621
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 475 transition count 621
Applied a total of 102 rules in 32 ms. Remains 475 /525 variables (removed 50) and now considering 621/674 (removed 53) transitions.
// Phase 1: matrix 621 rows 475 cols
[2024-06-02 18:45:52] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:45:52] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 18:45:52] [INFO ] Invariant cache hit.
[2024-06-02 18:45:53] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2024-06-02 18:45:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 621/1096 variables, 475/479 constraints. Problems are: Problem set: 0 solved, 620 unsolved
[2024-06-02 18:46:13] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 3 ms to minimize.
[2024-06-02 18:46:14] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1096 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 481 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (OVERLAPS) 621/1096 variables, 475/481 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1096 variables, 620/1101 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1096 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 1101 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 475/525 places, 621/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60545 ms. Remains : 475/525 places, 621/674 transitions.
[2024-06-02 18:46:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:46:53] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:46:53] [INFO ] Input system was already deterministic with 621 transitions.
[2024-06-02 18:46:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:46:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:46:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1182358888746865448.gal : 2 ms
[2024-06-02 18:46:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10333538201195577553.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/CTLFireability1182358888746865448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10333538201195577553.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.9343e+10,1.39126,47676,2,8738,5,157994,6,0,2517,216054,0


Converting to forward existential form...Done !
original formula: (E(AG(((AF((p498==1)) + EF(((p626==1)&&(p955==1)))) + (AX((p627==1)) + ((p97==1)&&(p878==1))))) U (p813==1)) + EX(((EX(((p94==1)||(((p274...225
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !(((!(EG(!((p498==1)))) + E(TRUE U ((p626==1)&&(p955==1)))) + (!(EX(!((p627==1)))) + ((p...321
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...482
Detected timeout of ITS tools.
[2024-06-02 18:47:23] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:47:23] [INFO ] Applying decomposition
[2024-06-02 18:47:23] [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/graph15821279734862055318.txt' '-o' '/tmp/graph15821279734862055318.bin' '-w' '/tmp/graph15821279734862055318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15821279734862055318.bin' '-l' '-1' '-v' '-w' '/tmp/graph15821279734862055318.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:47:23] [INFO ] Decomposing Gal with order
[2024-06-02 18:47:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:47:23] [INFO ] Removed a total of 217 redundant transitions.
[2024-06-02 18:47:23] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:47:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 19 ms.
[2024-06-02 18:47:23] [INFO ] Time to serialize gal into /tmp/CTLFireability542194272849132893.gal : 4 ms
[2024-06-02 18:47:23] [INFO ] Time to serialize properties into /tmp/CTLFireability8891888765279977698.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/CTLFireability542194272849132893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8891888765279977698.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 -...261
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.9343e+10,0.214041,12520,640,85,15895,1251,1139,29550,105,4844,0


Converting to forward existential form...Done !
original formula: (E(AG(((AF((i6.u69.p498==1)) + EF(((i14.u98.p626==1)&&(i16.u165.p955==1)))) + (AX((i14.u98.p627==1)) + ((i3.i1.i0.u7.p97==1)&&(i8.u156.p8...363
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !(((!(EG(!((i6.u69.p498==1)))) + E(TRUE U ((i14.u98.p626==1)&&(i16.u165.p955==1)))) + (!...459
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t73, t196, t247, t351, t481, t541, i0.t243, i1.t455, i1.t449, i1.i1.t617, i1.i1.i0....822
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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 an 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
(forward)formula 0,0,18.3992,524944,1,0,726874,3573,7808,3.29342e+06,549,16021,555617
FORMULA CO4-PT-17-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 493 transition count 642
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 493 transition count 642
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 493 transition count 640
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 82 place count 477 transition count 623
Iterating global reduction 1 with 16 rules applied. Total rules applied 98 place count 477 transition count 623
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 472 transition count 618
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 472 transition count 618
Applied a total of 108 rules in 22 ms. Remains 472 /525 variables (removed 53) and now considering 618/674 (removed 56) transitions.
// Phase 1: matrix 618 rows 472 cols
[2024-06-02 18:47:42] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:47:42] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 18:47:42] [INFO ] Invariant cache hit.
[2024-06-02 18:47:42] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2024-06-02 18:47:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
[2024-06-02 18:48:02] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-06-02 18:48:02] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1090 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 472/525 places, 618/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60507 ms. Remains : 472/525 places, 618/674 transitions.
[2024-06-02 18:48:42] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:48:42] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:48:42] [INFO ] Input system was already deterministic with 618 transitions.
[2024-06-02 18:48:42] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:48:42] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:48:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5931450001606525699.gal : 2 ms
[2024-06-02 18:48:42] [INFO ] Time to serialize properties into /tmp/CTLFireability13799622333418256168.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/CTLFireability5931450001606525699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13799622333418256168.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.88892e+10,1.26713,45264,2,8649,5,152630,6,0,2502,202570,0


Converting to forward existential form...Done !
original formula: EG(EX((EF(EG((p492==0))) + (p113==0))))
=> equivalent forward existential formula: [FwdG(Init,EX((E(TRUE U EG((p492==0))) + (p113==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...494
Detected timeout of ITS tools.
[2024-06-02 18:49:12] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:49:12] [INFO ] Applying decomposition
[2024-06-02 18:49:12] [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/graph2323731707137276108.txt' '-o' '/tmp/graph2323731707137276108.bin' '-w' '/tmp/graph2323731707137276108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2323731707137276108.bin' '-l' '-1' '-v' '-w' '/tmp/graph2323731707137276108.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:49:12] [INFO ] Decomposing Gal with order
[2024-06-02 18:49:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:49:12] [INFO ] Removed a total of 206 redundant transitions.
[2024-06-02 18:49:12] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:49:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 5 ms.
[2024-06-02 18:49:12] [INFO ] Time to serialize gal into /tmp/CTLFireability8647222428307888982.gal : 4 ms
[2024-06-02 18:49:12] [INFO ] Time to serialize properties into /tmp/CTLFireability12537469180810609826.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/CTLFireability8647222428307888982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12537469180810609826.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.88892e+10,0.219774,12524,721,89,16374,1368,1040,28727,100,5120,0


Converting to forward existential form...Done !
original formula: EG(EX((EF(EG((i6.u63.p492==0))) + (i1.u8.p113==0))))
=> equivalent forward existential formula: [FwdG(Init,EX((E(TRUE U EG((i6.u63.p492==0))) + (i1.u8.p113==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t192, t196, t206, t247, t320, t325, t351, t502, t540, i0.t499, i0.u6.t506, i1.t475,...795
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 492 transition count 641
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 492 transition count 641
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 492 transition count 639
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 84 place count 476 transition count 622
Iterating global reduction 1 with 16 rules applied. Total rules applied 100 place count 476 transition count 622
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 471 transition count 617
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 471 transition count 617
Applied a total of 110 rules in 21 ms. Remains 471 /525 variables (removed 54) and now considering 617/674 (removed 57) transitions.
// Phase 1: matrix 617 rows 471 cols
[2024-06-02 18:49:42] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 18:49:43] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 18:49:43] [INFO ] Invariant cache hit.
[2024-06-02 18:49:43] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-06-02 18:49:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 18:50:03] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-06-02 18:50:03] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 471/525 places, 617/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60499 ms. Remains : 471/525 places, 617/674 transitions.
[2024-06-02 18:50:43] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:50:43] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:50:43] [INFO ] Input system was already deterministic with 617 transitions.
[2024-06-02 18:50:43] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:50:43] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:50:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7536644497628162195.gal : 2 ms
[2024-06-02 18:50:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3121764671756396509.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/CTLFireability7536644497628162195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3121764671756396509.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.87379e+10,1.21825,45160,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: AX(EX((AG(EF((p435==0))) * ((p729==0)||(p955==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((!(E(TRUE U !(E(TRUE U (p435==0))))) * ((p729==0)||(p955==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
(forward)formula 0,1,20.9851,604912,1,0,789,2.72014e+06,1256,512,14722,2.23555e+06,1250
FORMULA CO4-PT-17-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 674/674 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 492 transition count 641
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 492 transition count 641
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 492 transition count 639
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 84 place count 476 transition count 622
Iterating global reduction 1 with 16 rules applied. Total rules applied 100 place count 476 transition count 622
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 471 transition count 617
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 471 transition count 617
Applied a total of 110 rules in 22 ms. Remains 471 /525 variables (removed 54) and now considering 617/674 (removed 57) transitions.
[2024-06-02 18:51:04] [INFO ] Invariant cache hit.
[2024-06-02 18:51:04] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 18:51:04] [INFO ] Invariant cache hit.
[2024-06-02 18:51:04] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-06-02 18:51:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 18:51:25] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-06-02 18:51:25] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 471/525 places, 617/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60499 ms. Remains : 471/525 places, 617/674 transitions.
[2024-06-02 18:52:05] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:52:05] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:52:05] [INFO ] Input system was already deterministic with 617 transitions.
[2024-06-02 18:52:05] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:52:05] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:52:05] [INFO ] Time to serialize gal into /tmp/CTLFireability12731834271691840348.gal : 2 ms
[2024-06-02 18:52:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16176077585626360256.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/CTLFireability12731834271691840348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16176077585626360256.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.87379e+10,1.22617,45160,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
(forward)formula 0,1,17.019,482436,1,0,785,1.7037e+06,1249,509,13540,1.7722e+06,1240
FORMULA CO4-PT-17-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-06-02 18:52:22] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:52:22] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:52:22] [INFO ] Applying decomposition
[2024-06-02 18:52:22] [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/graph13041565740228881276.txt' '-o' '/tmp/graph13041565740228881276.bin' '-w' '/tmp/graph13041565740228881276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13041565740228881276.bin' '-l' '-1' '-v' '-w' '/tmp/graph13041565740228881276.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:52:22] [INFO ] Decomposing Gal with order
[2024-06-02 18:52:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:52:22] [INFO ] Removed a total of 215 redundant transitions.
[2024-06-02 18:52:22] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:52:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2024-06-02 18:52:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10092706596033929709.gal : 5 ms
[2024-06-02 18:52:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9323574609408889109.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/CTLFireability10092706596033929709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9323574609408889109.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 3 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.09028e+10,0.321237,16492,707,101,23501,2320,1249,48111,117,10796,0


Converting to forward existential form...Done !
original formula: EG(((AX(!(A((i0.u14.p110==1) U (i1.u35.p216==1)))) + (i10.u131.p690==1)) * (((i1.u35.p220==0) + EX(AX((i1.u35.p216==0)))) + ((i6.i1.i0.u2...194
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(!(!((E(!((i1.u35.p216==1)) U (!((i0.u14.p110==1)) * !((i1.u35.p216==1)))) + EG(!((i1.u35.p21...322
Reverse transition relation is NOT exact ! Due to transitions t18, t47, t79, t205, t262, t372, t394, t484, t511, t575, t662, i0.t505, i0.u13.t523, i0.u18.t...898
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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,46.883,1066880,1,0,1.47475e+06,5144,8836,7.02086e+06,609,30185,893693
FORMULA CO4-PT-17-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(((AF((i4.u59.p387==0)) + (i2.u29.p197==0)) + (((i2.u23.p160==1)||(i5.i1.i3.u95.p552==1))&&((i6.i2.i1.u100.p582==0)||(i14.u159.p805==0...498
=> equivalent forward existential formula: ([FwdG(Init,!(((!(EG(!((i4.u59.p387==0)))) + (i2.u29.p197==0)) + (((i2.u23.p160==1)||(i5.i1.i3.u95.p552==1))&&((...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
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 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 1,1,77.9861,1866800,1,0,2.74967e+06,5974,9372,1.10114e+07,654,35430,1813420
FORMULA CO4-PT-17-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EX((EF(EG((i7.u82.p492==0))) + (i0.u13.p113==0))))
=> equivalent forward existential formula: [FwdG(Init,EX((E(TRUE U EG((i7.u82.p492==0))) + (i0.u13.p113==0))))] != FALSE
(forward)formula 2,1,124.363,2201024,1,0,3.26626e+06,6018,2624,1.21246e+07,224,35846,364147
FORMULA CO4-PT-17-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1319751 ms.

BK_STOP 1717354467144

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

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