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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 10:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 205K May 18 16:43 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 UtahNoC-PT-none-CTLFireability-2024-00
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-01
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-02
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-03
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-04
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-05
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-06
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-07
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-08
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-09
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-10
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2024-11
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2023-12
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2023-13
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2023-14
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717070199550

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 11:56:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 11:56:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 11:56:42] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2024-05-30 11:56:42] [INFO ] Transformed 216 places.
[2024-05-30 11:56:42] [INFO ] Transformed 977 transitions.
[2024-05-30 11:56:42] [INFO ] Found NUPN structural information;
[2024-05-30 11:56:42] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 601 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Support contains 95 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 829/829 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 197 transition count 768
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 197 transition count 768
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 51 place count 197 transition count 755
Applied a total of 51 rules in 115 ms. Remains 197 /216 variables (removed 19) and now considering 755/829 (removed 74) transitions.
[2024-05-30 11:56:43] [INFO ] Flow matrix only has 389 transitions (discarded 366 similar events)
// Phase 1: matrix 389 rows 197 cols
[2024-05-30 11:56:43] [INFO ] Computed 8 invariants in 43 ms
[2024-05-30 11:56:43] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-05-30 11:56:43] [INFO ] Flow matrix only has 389 transitions (discarded 366 similar events)
[2024-05-30 11:56:43] [INFO ] Invariant cache hit.
[2024-05-30 11:56:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-30 11:56:44] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2024-05-30 11:56:44] [INFO ] Flow matrix only has 389 transitions (discarded 366 similar events)
[2024-05-30 11:56:44] [INFO ] Invariant cache hit.
[2024-05-30 11:56:44] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 388/585 variables, 197/205 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 41/246 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/586 variables, and 246 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 197/197 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 388/585 variables, 197/205 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 41/246 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 754/1000 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/586 variables, and 1000 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 197/197 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 0/0 constraints]
After SMT, in 61019ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 61088ms
Starting structural reductions in LTL mode, iteration 1 : 197/216 places, 755/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62464 ms. Remains : 197/216 places, 755/829 transitions.
Support contains 95 out of 197 places after structural reductions.
[2024-05-30 11:57:46] [INFO ] Flatten gal took : 143 ms
[2024-05-30 11:57:46] [INFO ] Flatten gal took : 83 ms
[2024-05-30 11:57:46] [INFO ] Input system was already deterministic with 755 transitions.
Support contains 91 out of 197 places (down from 95) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3332 ms. (12 steps per ms) remains 11/85 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 128 ms. (310 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 9/9 properties
[2024-05-30 11:57:47] [INFO ] Flow matrix only has 389 transitions (discarded 366 similar events)
[2024-05-30 11:57:47] [INFO ] Invariant cache hit.
[2024-05-30 11:57:47] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp54 is UNSAT
At refinement iteration 1 (OVERLAPS) 173/193 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/197 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 388/585 variables, 197/205 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 41/246 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/586 variables, 1/247 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/586 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 247 constraints, problems are : Problem set: 1 solved, 8 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 197/197 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 177/193 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/197 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 388/585 variables, 197/205 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 41/246 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 8/254 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/586 variables, 1/255 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/586 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 586/586 variables, and 255 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 197/197 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1969ms problems are : Problem set: 1 solved, 8 unsolved
Parikh walk visited 4 properties in 2654 ms.
Support contains 7 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 755/755 transitions.
Graph (trivial) has 296 edges and 197 vertex of which 69 / 197 are part of one of the 13 SCC in 5 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 203 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 266 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 0 with 2 rules applied. Total rules applied 3 place count 141 transition count 487
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 139 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 138 transition count 486
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 138 transition count 485
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 9 place count 137 transition count 485
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 35 place count 111 transition count 386
Iterating global reduction 3 with 26 rules applied. Total rules applied 61 place count 111 transition count 386
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 92 place count 111 transition count 355
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 100 place count 103 transition count 333
Iterating global reduction 4 with 8 rules applied. Total rules applied 108 place count 103 transition count 333
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 118 place count 103 transition count 323
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 124 place count 100 transition count 318
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 16 rules applied. Total rules applied 140 place count 100 transition count 302
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 143 place count 98 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 144 place count 97 transition count 301
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 145 place count 96 transition count 299
Iterating global reduction 8 with 1 rules applied. Total rules applied 146 place count 96 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 147 place count 96 transition count 298
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 161 place count 89 transition count 325
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 163 place count 89 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 172 place count 89 transition count 314
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 174 place count 87 transition count 312
Iterating global reduction 10 with 2 rules applied. Total rules applied 176 place count 87 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 177 place count 87 transition count 311
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 179 place count 87 transition count 309
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 182 place count 85 transition count 308
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 183 place count 85 transition count 307
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 184 place count 85 transition count 311
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 186 place count 84 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 189 place count 84 transition count 307
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 192 place count 84 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 193 place count 83 transition count 306
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 70 edges and 81 vertex of which 19 / 81 are part of one of the 4 SCC in 1 ms
Free SCC test removed 15 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 196 place count 66 transition count 306
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 14 with 56 rules applied. Total rules applied 252 place count 66 transition count 250
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 255 place count 63 transition count 238
Iterating global reduction 15 with 3 rules applied. Total rules applied 258 place count 63 transition count 238
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 264 place count 60 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 265 place count 60 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 270 place count 60 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 272 place count 59 transition count 248
Applied a total of 272 rules in 219 ms. Remains 59 /197 variables (removed 138) and now considering 248/755 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 59/197 places, 248/755 transitions.
RANDOM walk for 11695 steps (1 resets) in 537 ms. (21 steps per ms) remains 0/4 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-30 11:57:53] [INFO ] Flatten gal took : 39 ms
[2024-05-30 11:57:53] [INFO ] Flatten gal took : 40 ms
[2024-05-30 11:57:53] [INFO ] Input system was already deterministic with 755 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Graph (trivial) has 303 edges and 197 vertex of which 70 / 197 are part of one of the 13 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 204 edges and 138 vertex of which 26 / 138 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 116 transition count 587
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 89 place count 116 transition count 501
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 117 place count 88 transition count 369
Iterating global reduction 2 with 28 rules applied. Total rules applied 145 place count 88 transition count 369
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 187 place count 88 transition count 327
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 196 place count 79 transition count 306
Iterating global reduction 3 with 9 rules applied. Total rules applied 205 place count 79 transition count 306
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 217 place count 79 transition count 294
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 77 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 225 place count 77 transition count 288
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 227 place count 75 transition count 282
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 75 transition count 282
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 230 place count 74 transition count 280
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 74 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 74 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 247 place count 74 transition count 264
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 248 place count 74 transition count 264
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 73 transition count 263
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 73 transition count 263
Applied a total of 250 rules in 52 ms. Remains 73 /197 variables (removed 124) and now considering 263/755 (removed 492) transitions.
[2024-05-30 11:57:53] [INFO ] Flow matrix only has 120 transitions (discarded 143 similar events)
// Phase 1: matrix 120 rows 73 cols
[2024-05-30 11:57:53] [INFO ] Computed 7 invariants in 2 ms
[2024-05-30 11:57:53] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 11:57:53] [INFO ] Flow matrix only has 120 transitions (discarded 143 similar events)
[2024-05-30 11:57:53] [INFO ] Invariant cache hit.
[2024-05-30 11:57:53] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-30 11:57:53] [INFO ] Redundant transitions in 16 ms returned []
Running 248 sub problems to find dead transitions.
[2024-05-30 11:57:53] [INFO ] Flow matrix only has 120 transitions (discarded 143 similar events)
[2024-05-30 11:57:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-30 11:57:54] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 1/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 119/192 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/193 variables, and 81 constraints, problems are : Problem set: 0 solved, 248 unsolved in 7822 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 1/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 119/192 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 248/329 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-30 11:58:05] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 5 ms to minimize.
[2024-05-30 11:58:05] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-05-30 11:58:05] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-30 11:58:11] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/192 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/193 variables, and 333 constraints, problems are : Problem set: 0 solved, 248 unsolved in 16147 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 5/5 constraints]
After SMT, in 24054ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 24059ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/197 places, 263/755 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24272 ms. Remains : 73/197 places, 263/755 transitions.
[2024-05-30 11:58:17] [INFO ] Flatten gal took : 12 ms
[2024-05-30 11:58:17] [INFO ] Flatten gal took : 12 ms
[2024-05-30 11:58:17] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-30 11:58:17] [INFO ] Flatten gal took : 12 ms
[2024-05-30 11:58:17] [INFO ] Flatten gal took : 12 ms
[2024-05-30 11:58:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3557873270539240647.gal : 10 ms
[2024-05-30 11:58:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3423442961284543495.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3557873270539240647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3423442961284543495.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,4.84111e+06,0.500029,14124,2,2421,5,47209,6,0,514,45567,0


Converting to forward existential form...Done !
original formula: EG(AG(((EG((((p74==0)||(p213==0))||(p114==0))) + (p11==0)) + (p14==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((EG((((p74==0)||(p213==0))||(p114==0))) + (p11==0)) + (p14==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t12, t14, t18, t20, t22, t24, t26, t28, t30, t31, t32, t33, t34, t36, t37, t38, t39, In...252
(forward)formula 0,0,4.68809,103184,1,0,424,507965,515,249,3619,480834,541
FORMULA UtahNoC-PT-none-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Graph (trivial) has 319 edges and 197 vertex of which 81 / 197 are part of one of the 14 SCC in 1 ms
Free SCC test removed 67 places
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 198 edges and 128 vertex of which 23 / 128 are part of one of the 3 SCC in 1 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 108 transition count 552
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 86 place count 108 transition count 469
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 114 place count 80 transition count 337
Iterating global reduction 2 with 28 rules applied. Total rules applied 142 place count 80 transition count 337
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 184 place count 80 transition count 295
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 193 place count 71 transition count 274
Iterating global reduction 3 with 9 rules applied. Total rules applied 202 place count 71 transition count 274
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 214 place count 71 transition count 262
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 220 place count 68 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 224 place count 68 transition count 255
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 226 place count 66 transition count 249
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 66 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 230 place count 66 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 243 place count 66 transition count 234
Applied a total of 243 rules in 31 ms. Remains 66 /197 variables (removed 131) and now considering 234/755 (removed 521) transitions.
[2024-05-30 11:58:22] [INFO ] Flow matrix only has 110 transitions (discarded 124 similar events)
// Phase 1: matrix 110 rows 66 cols
[2024-05-30 11:58:22] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 11:58:22] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 11:58:22] [INFO ] Flow matrix only has 110 transitions (discarded 124 similar events)
[2024-05-30 11:58:22] [INFO ] Invariant cache hit.
[2024-05-30 11:58:22] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-30 11:58:22] [INFO ] Redundant transitions in 3 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-30 11:58:22] [INFO ] Flow matrix only has 110 transitions (discarded 124 similar events)
[2024-05-30 11:58:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-30 11:58:23] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-30 11:58:23] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 109/175 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/176 variables, and 75 constraints, problems are : Problem set: 0 solved, 221 unsolved in 7448 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 109/175 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 221/296 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-30 11:58:33] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-30 11:58:35] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/176 variables, and 298 constraints, problems are : Problem set: 0 solved, 221 unsolved in 11105 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 18621ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 18624ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/197 places, 234/755 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18798 ms. Remains : 66/197 places, 234/755 transitions.
[2024-05-30 11:58:41] [INFO ] Flatten gal took : 10 ms
[2024-05-30 11:58:41] [INFO ] Flatten gal took : 9 ms
[2024-05-30 11:58:41] [INFO ] Input system was already deterministic with 234 transitions.
RANDOM walk for 3776 steps (0 resets) in 17 ms. (209 steps per ms) remains 0/1 properties
FORMULA UtahNoC-PT-none-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 11:58:41] [INFO ] Flatten gal took : 12 ms
[2024-05-30 11:58:41] [INFO ] Flatten gal took : 10 ms
[2024-05-30 11:58:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14758069092169024218.gal : 4 ms
[2024-05-30 11:58:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10337683581061547658.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/ReachabilityCardinality14758069092169024218.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10337683581061547658.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Graph (trivial) has 311 edges and 197 vertex of which 74 / 197 are part of one of the 15 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 181 transitions
Reduce isomorphic transitions removed 181 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 211 edges and 136 vertex of which 26 / 136 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 114 transition count 573
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 89 place count 114 transition count 487
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 119 place count 84 transition count 351
Iterating global reduction 2 with 30 rules applied. Total rules applied 149 place count 84 transition count 351
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 194 place count 84 transition count 306
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 204 place count 74 transition count 284
Iterating global reduction 3 with 10 rules applied. Total rules applied 214 place count 74 transition count 284
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 227 place count 74 transition count 271
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 71 transition count 268
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 237 place count 71 transition count 264
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 239 place count 69 transition count 258
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 69 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 243 place count 69 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 257 place count 69 transition count 242
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 258 place count 69 transition count 242
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 259 place count 68 transition count 241
Iterating global reduction 6 with 1 rules applied. Total rules applied 260 place count 68 transition count 241
Applied a total of 260 rules in 41 ms. Remains 68 /197 variables (removed 129) and now considering 241/755 (removed 514) transitions.
[2024-05-30 11:58:41] [INFO ] Flow matrix only has 112 transitions (discarded 129 similar events)
// Phase 1: matrix 112 rows 68 cols
[2024-05-30 11:58:41] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 11:58:41] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 11:58:41] [INFO ] Flow matrix only has 112 transitions (discarded 129 similar events)
[2024-05-30 11:58:41] [INFO ] Invariant cache hit.
[2024-05-30 11:58:41] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-30 11:58:41] [INFO ] Redundant transitions in 5 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-30 11:58:41] [INFO ] Flow matrix only has 112 transitions (discarded 129 similar events)
[2024-05-30 11:58:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-30 11:58:42] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 111/179 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/180 variables, and 76 constraints, problems are : Problem set: 0 solved, 229 unsolved in 6572 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-30 11:58:49] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 111/179 variables, 68/77 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 229/306 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/180 variables, and 306 constraints, problems are : Problem set: 0 solved, 229 unsolved in 5854 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 2/2 constraints]
After SMT, in 12512ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 12517ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/197 places, 241/755 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12744 ms. Remains : 68/197 places, 241/755 transitions.
[2024-05-30 11:58:54] [INFO ] Flatten gal took : 9 ms
[2024-05-30 11:58:54] [INFO ] Flatten gal took : 8 ms
[2024-05-30 11:58:54] [INFO ] Input system was already deterministic with 241 transitions.
RANDOM walk for 72 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
FORMULA UtahNoC-PT-none-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 11:58:54] [INFO ] Flatten gal took : 8 ms
[2024-05-30 11:58:54] [INFO ] Flatten gal took : 8 ms
[2024-05-30 11:58:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality202979330791014110.gal : 3 ms
[2024-05-30 11:58:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8281564915635779607.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality202979330791014110.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8281564915635779607.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 165 transition count 603
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 165 transition count 603
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 89 place count 165 transition count 578
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 98 place count 156 transition count 551
Iterating global reduction 1 with 9 rules applied. Total rules applied 107 place count 156 transition count 551
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 119 place count 156 transition count 539
Applied a total of 119 rules in 11 ms. Remains 156 /197 variables (removed 41) and now considering 539/755 (removed 216) transitions.
[2024-05-30 11:58:54] [INFO ] Flow matrix only has 281 transitions (discarded 258 similar events)
// Phase 1: matrix 281 rows 156 cols
[2024-05-30 11:58:54] [INFO ] Computed 8 invariants in 5 ms
[2024-05-30 11:58:54] [INFO ] Implicit Places using invariants in 72 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/197 places, 539/755 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 150 transition count 514
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 150 transition count 514
Applied a total of 10 rules in 6 ms. Remains 150 /155 variables (removed 5) and now considering 514/539 (removed 25) transitions.
[2024-05-30 11:58:54] [INFO ] Flow matrix only has 276 transitions (discarded 238 similar events)
// Phase 1: matrix 276 rows 150 cols
[2024-05-30 11:58:54] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 11:58:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 11:58:54] [INFO ] Flow matrix only has 276 transitions (discarded 238 similar events)
[2024-05-30 11:58:54] [INFO ] Invariant cache hit.
[2024-05-30 11:58:54] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-30 11:58:54] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/197 places, 514/755 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 322 ms. Remains : 150/197 places, 514/755 transitions.
[2024-05-30 11:58:54] [INFO ] Flatten gal took : 16 ms
[2024-05-30 11:58:54] [INFO ] Flatten gal took : 17 ms
[2024-05-30 11:58:54] [INFO ] Input system was already deterministic with 514 transitions.
[2024-05-30 11:58:54] [INFO ] Flatten gal took : 17 ms
[2024-05-30 11:58:54] [INFO ] Flatten gal took : 17 ms
[2024-05-30 11:58:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9124371928696858390.gal : 4 ms
[2024-05-30 11:58:54] [INFO ] Time to serialize properties into /tmp/CTLFireability9342737515662367442.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/CTLFireability9124371928696858390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9342737515662367442.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,5.42595e+08,1.88033,49340,2,5774,5,187501,6,0,1046,185995,0


Converting to forward existential form...Done !
original formula: ((EF((((p98==0)||(p160==0)) * !(A((((p94==1)&&(p213==1))||((p117==1)&&(p189==1))) U (p203==1))))) * AX((p193==0))) * AG(EF(((EX(((p9==1)&...208
=> equivalent forward existential formula: (([(Init * !(E(TRUE U (((p98==0)||(p160==0)) * !(!((E(!((p203==1)) U (!((((p94==1)&&(p213==1))||((p117==1)&&(p18...365
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t24, t31, t35, t37, t44, t48, t50, t59, t61, t63, t71, t73, t75, t83, t85, t87, In...252
(forward)formula 0,1,11.222,251352,1,0,661,1.24381e+06,989,399,7140,1.05765e+06,999
FORMULA UtahNoC-PT-none-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 162 transition count 592
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 162 transition count 592
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 99 place count 162 transition count 563
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 108 place count 153 transition count 536
Iterating global reduction 1 with 9 rules applied. Total rules applied 117 place count 153 transition count 536
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 129 place count 153 transition count 524
Applied a total of 129 rules in 12 ms. Remains 153 /197 variables (removed 44) and now considering 524/755 (removed 231) transitions.
[2024-05-30 11:59:05] [INFO ] Flow matrix only has 274 transitions (discarded 250 similar events)
// Phase 1: matrix 274 rows 153 cols
[2024-05-30 11:59:05] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 11:59:05] [INFO ] Implicit Places using invariants in 70 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/197 places, 524/755 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 499
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 499
Applied a total of 10 rules in 6 ms. Remains 147 /152 variables (removed 5) and now considering 499/524 (removed 25) transitions.
[2024-05-30 11:59:05] [INFO ] Flow matrix only has 269 transitions (discarded 230 similar events)
// Phase 1: matrix 269 rows 147 cols
[2024-05-30 11:59:05] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 11:59:05] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 11:59:05] [INFO ] Flow matrix only has 269 transitions (discarded 230 similar events)
[2024-05-30 11:59:05] [INFO ] Invariant cache hit.
[2024-05-30 11:59:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-30 11:59:06] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/197 places, 499/755 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 304 ms. Remains : 147/197 places, 499/755 transitions.
[2024-05-30 11:59:06] [INFO ] Flatten gal took : 13 ms
[2024-05-30 11:59:06] [INFO ] Flatten gal took : 15 ms
[2024-05-30 11:59:06] [INFO ] Input system was already deterministic with 499 transitions.
[2024-05-30 11:59:06] [INFO ] Flatten gal took : 15 ms
[2024-05-30 11:59:06] [INFO ] Flatten gal took : 14 ms
[2024-05-30 11:59:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14194591065320146487.gal : 4 ms
[2024-05-30 11:59:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5705381059105808434.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/CTLFireability14194591065320146487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5705381059105808434.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((p35==1) * AX((p50!=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p35==1)) * !(EX(!((p50!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t24, t31, t35, t37, t44, t48, t50, t59, t61, t63, t71, t73, t75, t83, t85, t87, In...252
(forward)formula 0,1,8.85087,168488,1,0,623,691302,941,377,6549,696719,931
FORMULA UtahNoC-PT-none-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 161 transition count 587
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 161 transition count 587
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 99 place count 161 transition count 560
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 107 place count 153 transition count 536
Iterating global reduction 1 with 8 rules applied. Total rules applied 115 place count 153 transition count 536
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 125 place count 153 transition count 526
Applied a total of 125 rules in 10 ms. Remains 153 /197 variables (removed 44) and now considering 526/755 (removed 229) transitions.
[2024-05-30 11:59:15] [INFO ] Flow matrix only has 280 transitions (discarded 246 similar events)
// Phase 1: matrix 280 rows 153 cols
[2024-05-30 11:59:15] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 11:59:15] [INFO ] Implicit Places using invariants in 90 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/197 places, 526/755 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 501
Applied a total of 10 rules in 10 ms. Remains 147 /152 variables (removed 5) and now considering 501/526 (removed 25) transitions.
[2024-05-30 11:59:15] [INFO ] Flow matrix only has 275 transitions (discarded 226 similar events)
// Phase 1: matrix 275 rows 147 cols
[2024-05-30 11:59:15] [INFO ] Computed 7 invariants in 2 ms
[2024-05-30 11:59:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 11:59:15] [INFO ] Flow matrix only has 275 transitions (discarded 226 similar events)
[2024-05-30 11:59:15] [INFO ] Invariant cache hit.
[2024-05-30 11:59:15] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-30 11:59:15] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/197 places, 501/755 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 335 ms. Remains : 147/197 places, 501/755 transitions.
[2024-05-30 11:59:15] [INFO ] Flatten gal took : 12 ms
[2024-05-30 11:59:15] [INFO ] Flatten gal took : 12 ms
[2024-05-30 11:59:15] [INFO ] Input system was already deterministic with 501 transitions.
[2024-05-30 11:59:15] [INFO ] Flatten gal took : 13 ms
[2024-05-30 11:59:15] [INFO ] Flatten gal took : 12 ms
[2024-05-30 11:59:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5341927600162902929.gal : 7 ms
[2024-05-30 11:59:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17928765466546664041.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/CTLFireability5341927600162902929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17928765466546664041.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AG(EX(((p127==0)||(p213==0)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX(((p127==0)||(p213==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t22, t29, t33, t35, t42, t46, t48, t57, t59, t61, t69, t71, t73, t81, t83, t85, In...252
(forward)formula 0,1,10.8013,179276,1,0,620,745032,944,373,6644,776602,935
FORMULA UtahNoC-PT-none-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 165 transition count 601
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 165 transition count 601
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 92 place count 165 transition count 573
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 101 place count 156 transition count 546
Iterating global reduction 1 with 9 rules applied. Total rules applied 110 place count 156 transition count 546
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 122 place count 156 transition count 534
Applied a total of 122 rules in 12 ms. Remains 156 /197 variables (removed 41) and now considering 534/755 (removed 221) transitions.
[2024-05-30 11:59:26] [INFO ] Flow matrix only has 284 transitions (discarded 250 similar events)
// Phase 1: matrix 284 rows 156 cols
[2024-05-30 11:59:26] [INFO ] Computed 8 invariants in 2 ms
[2024-05-30 11:59:26] [INFO ] Implicit Places using invariants in 102 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/197 places, 534/755 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 150 transition count 509
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 150 transition count 509
Applied a total of 10 rules in 6 ms. Remains 150 /155 variables (removed 5) and now considering 509/534 (removed 25) transitions.
[2024-05-30 11:59:26] [INFO ] Flow matrix only has 279 transitions (discarded 230 similar events)
// Phase 1: matrix 279 rows 150 cols
[2024-05-30 11:59:26] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 11:59:26] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 11:59:26] [INFO ] Flow matrix only has 279 transitions (discarded 230 similar events)
[2024-05-30 11:59:26] [INFO ] Invariant cache hit.
[2024-05-30 11:59:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-30 11:59:26] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/197 places, 509/755 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 452 ms. Remains : 150/197 places, 509/755 transitions.
[2024-05-30 11:59:26] [INFO ] Flatten gal took : 19 ms
[2024-05-30 11:59:27] [INFO ] Flatten gal took : 21 ms
[2024-05-30 11:59:27] [INFO ] Input system was already deterministic with 509 transitions.
[2024-05-30 11:59:27] [INFO ] Flatten gal took : 20 ms
[2024-05-30 11:59:27] [INFO ] Flatten gal took : 20 ms
[2024-05-30 11:59:27] [INFO ] Time to serialize gal into /tmp/CTLFireability5974354120352354802.gal : 6 ms
[2024-05-30 11:59:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10607234698745874836.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/CTLFireability5974354120352354802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10607234698745874836.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,5.56891e+08,2.14952,50452,2,5679,5,203625,6,0,1043,180287,0


Converting to forward existential form...Done !
original formula: EF((AX(((A(((p29==1)&&(p160==1)) U (p164==1)) + ((p131==1)&&(p175==1))) + ((p34==1)&&(p170==1)))) + EX((AF((p143==0)) * ((p203==1)||((p78...176
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(((!((E(!((p164==1)) U (!(((p29==1)&&(p160==1))) * !((p164==1)))) + EG(!((p164==1))))...318
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t24, t31, t35, t37, t44, t48, t50, t59, t61, t63, t71, t73, t75, t83, t85, t87, In...252
(forward)formula 0,1,9.49875,192140,1,0,646,839154,979,396,6886,827687,979
FORMULA UtahNoC-PT-none-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 167 transition count 616
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 167 transition count 616
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 84 place count 167 transition count 592
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 160 transition count 571
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 160 transition count 571
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 108 place count 160 transition count 561
Applied a total of 108 rules in 7 ms. Remains 160 /197 variables (removed 37) and now considering 561/755 (removed 194) transitions.
[2024-05-30 11:59:36] [INFO ] Flow matrix only has 295 transitions (discarded 266 similar events)
// Phase 1: matrix 295 rows 160 cols
[2024-05-30 11:59:36] [INFO ] Computed 8 invariants in 3 ms
[2024-05-30 11:59:36] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 11:59:36] [INFO ] Flow matrix only has 295 transitions (discarded 266 similar events)
[2024-05-30 11:59:36] [INFO ] Invariant cache hit.
[2024-05-30 11:59:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-30 11:59:36] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 560 sub problems to find dead transitions.
[2024-05-30 11:59:36] [INFO ] Flow matrix only has 295 transitions (discarded 266 similar events)
[2024-05-30 11:59:36] [INFO ] Invariant cache hit.
[2024-05-30 11:59:36] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (OVERLAPS) 294/454 variables, 160/168 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 34/202 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/455 variables, and 203 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 160/160 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (OVERLAPS) 294/454 variables, 160/168 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 34/202 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 560/762 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (OVERLAPS) 1/455 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 763 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 160/160 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 0/0 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in LTL mode, iteration 1 : 160/197 places, 561/755 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60479 ms. Remains : 160/197 places, 561/755 transitions.
[2024-05-30 12:00:37] [INFO ] Flatten gal took : 21 ms
[2024-05-30 12:00:37] [INFO ] Flatten gal took : 22 ms
[2024-05-30 12:00:37] [INFO ] Input system was already deterministic with 561 transitions.
[2024-05-30 12:00:37] [INFO ] Flatten gal took : 21 ms
[2024-05-30 12:00:37] [INFO ] Flatten gal took : 23 ms
[2024-05-30 12:00:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6600713397702534696.gal : 8 ms
[2024-05-30 12:00:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12651336804271038209.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/CTLFireability6600713397702534696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12651336804271038209.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,7.39129e+08,3.49612,76456,2,6932,5,275909,6,0,1124,317040,0


Converting to forward existential form...Done !
original formula: (EF(((EX((p110==1)) * AF(((p7==1)&&(p213==1)))) * (EX((((p116==0)||(p176==0))&&((p45==0)||(p189==0)))) + !(A((p76==1) U (p117==1)))))) + ...269
=> equivalent forward existential formula: ([((FwdU((Init * !(E(TRUE U ((EX((p110==1)) * !(EG(!(((p7==1)&&(p213==1)))))) * (EX((((p116==0)||(p176==0))&&((p...672
Reverse transition relation is NOT exact ! Due to transitions t24, t28, t30, t37, t41, t43, t50, t54, t56, t65, t67, t69, t77, t79, t81, t89, t91, t93, In...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,21.5732,413828,1,0,748,2.30892e+06,1099,462,8051,1.66743e+06,1143
FORMULA UtahNoC-PT-none-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 162 transition count 592
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 162 transition count 592
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 97 place count 162 transition count 565
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 105 place count 154 transition count 541
Iterating global reduction 1 with 8 rules applied. Total rules applied 113 place count 154 transition count 541
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 123 place count 154 transition count 531
Applied a total of 123 rules in 7 ms. Remains 154 /197 variables (removed 43) and now considering 531/755 (removed 224) transitions.
[2024-05-30 12:00:59] [INFO ] Flow matrix only has 281 transitions (discarded 250 similar events)
// Phase 1: matrix 281 rows 154 cols
[2024-05-30 12:00:59] [INFO ] Computed 8 invariants in 2 ms
[2024-05-30 12:00:59] [INFO ] Implicit Places using invariants in 101 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/197 places, 531/755 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 506
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 506
Applied a total of 10 rules in 5 ms. Remains 148 /153 variables (removed 5) and now considering 506/531 (removed 25) transitions.
[2024-05-30 12:00:59] [INFO ] Flow matrix only has 276 transitions (discarded 230 similar events)
// Phase 1: matrix 276 rows 148 cols
[2024-05-30 12:00:59] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 12:00:59] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-30 12:00:59] [INFO ] Flow matrix only has 276 transitions (discarded 230 similar events)
[2024-05-30 12:00:59] [INFO ] Invariant cache hit.
[2024-05-30 12:00:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-30 12:00:59] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 148/197 places, 506/755 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 419 ms. Remains : 148/197 places, 506/755 transitions.
[2024-05-30 12:00:59] [INFO ] Flatten gal took : 18 ms
[2024-05-30 12:00:59] [INFO ] Flatten gal took : 17 ms
[2024-05-30 12:00:59] [INFO ] Input system was already deterministic with 506 transitions.
[2024-05-30 12:00:59] [INFO ] Flatten gal took : 18 ms
[2024-05-30 12:00:59] [INFO ] Flatten gal took : 17 ms
[2024-05-30 12:00:59] [INFO ] Time to serialize gal into /tmp/CTLFireability3728676445420680533.gal : 4 ms
[2024-05-30 12:00:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14694180605860486606.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/CTLFireability3728676445420680533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14694180605860486606.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,5.05959e+08,2.06234,48376,2,5645,5,188022,6,0,1032,179164,0


Converting to forward existential form...Done !
original formula: E(!(((p41==1)&&(p160==1))) U EX(((p13==1)&&(p160==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,!(((p41==1)&&(p160==1))))) * ((p13==1)&&(p160==1)))] != FALSE
Hit Full ! (commute/partial/dont) 438/0/68
(forward)formula 0,1,4.93184,89580,1,0,10,351627,16,1,2022,382269,5
FORMULA UtahNoC-PT-none-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Graph (trivial) has 286 edges and 197 vertex of which 62 / 197 are part of one of the 14 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 31 place count 119 transition count 478
Iterating global reduction 0 with 30 rules applied. Total rules applied 61 place count 119 transition count 478
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 93 place count 119 transition count 446
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 104 place count 108 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 115 place count 108 transition count 414
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 128 place count 108 transition count 401
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 106 transition count 399
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 136 place count 106 transition count 395
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 138 place count 104 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 104 transition count 389
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 103 transition count 387
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 103 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 103 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 159 place count 103 transition count 370
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 103 transition count 370
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 163 place count 101 transition count 368
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 101 transition count 368
Applied a total of 165 rules in 35 ms. Remains 101 /197 variables (removed 96) and now considering 368/755 (removed 387) transitions.
[2024-05-30 12:01:04] [INFO ] Flow matrix only has 168 transitions (discarded 200 similar events)
// Phase 1: matrix 168 rows 101 cols
[2024-05-30 12:01:04] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 12:01:04] [INFO ] Implicit Places using invariants in 52 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 100/197 places, 368/755 transitions.
Graph (trivial) has 136 edges and 100 vertex of which 22 / 100 are part of one of the 4 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 79 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 79 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 79 transition count 283
Applied a total of 13 rules in 9 ms. Remains 79 /100 variables (removed 21) and now considering 283/368 (removed 85) transitions.
[2024-05-30 12:01:04] [INFO ] Flow matrix only has 131 transitions (discarded 152 similar events)
// Phase 1: matrix 131 rows 79 cols
[2024-05-30 12:01:04] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 12:01:04] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 12:01:04] [INFO ] Flow matrix only has 131 transitions (discarded 152 similar events)
[2024-05-30 12:01:04] [INFO ] Invariant cache hit.
[2024-05-30 12:01:04] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-30 12:01:04] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 79/197 places, 283/755 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 248 ms. Remains : 79/197 places, 283/755 transitions.
[2024-05-30 12:01:04] [INFO ] Flatten gal took : 9 ms
[2024-05-30 12:01:04] [INFO ] Flatten gal took : 10 ms
[2024-05-30 12:01:04] [INFO ] Input system was already deterministic with 283 transitions.
[2024-05-30 12:01:04] [INFO ] Flatten gal took : 9 ms
[2024-05-30 12:01:04] [INFO ] Flatten gal took : 10 ms
[2024-05-30 12:01:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17342516655232093960.gal : 2 ms
[2024-05-30 12:01:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1852949884510976483.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/CTLFireability17342516655232093960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1852949884510976483.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,7.31224e+06,0.610697,15340,2,2704,5,53817,6,0,554,48106,0


Converting to forward existential form...Done !
original formula: EG(AG(((EF((p23==0)) + (p13==0)) + ((p189==0) + (EG((p37==0)) * !(A((p90==1) U ((p70==1)&&(p213==1)))))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((E(TRUE U (p23==0)) + (p13==0)) + ((p189==0) + (EG((p37==0)) * !(!((E(!(((p70==1)&&(p21...257
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t13, t17, t19, t21, t25, t27, t29, t31, t32, t33, t36, t37, t38, t40, t41, t42, Int...251
(forward)formula 0,1,3.03109,75596,1,0,429,326302,561,252,4080,351324,559
FORMULA UtahNoC-PT-none-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 163 transition count 597
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 163 transition count 597
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 94 place count 163 transition count 571
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 155 transition count 547
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 155 transition count 547
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 120 place count 155 transition count 537
Applied a total of 120 rules in 7 ms. Remains 155 /197 variables (removed 42) and now considering 537/755 (removed 218) transitions.
[2024-05-30 12:01:07] [INFO ] Flow matrix only has 283 transitions (discarded 254 similar events)
// Phase 1: matrix 283 rows 155 cols
[2024-05-30 12:01:07] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 12:01:08] [INFO ] Implicit Places using invariants in 66 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/197 places, 537/755 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 149 transition count 512
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 149 transition count 512
Applied a total of 10 rules in 4 ms. Remains 149 /154 variables (removed 5) and now considering 512/537 (removed 25) transitions.
[2024-05-30 12:01:08] [INFO ] Flow matrix only has 278 transitions (discarded 234 similar events)
// Phase 1: matrix 278 rows 149 cols
[2024-05-30 12:01:08] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 12:01:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 12:01:08] [INFO ] Flow matrix only has 278 transitions (discarded 234 similar events)
[2024-05-30 12:01:08] [INFO ] Invariant cache hit.
[2024-05-30 12:01:08] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-30 12:01:08] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/197 places, 512/755 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 306 ms. Remains : 149/197 places, 512/755 transitions.
[2024-05-30 12:01:08] [INFO ] Flatten gal took : 9 ms
[2024-05-30 12:01:08] [INFO ] Flatten gal took : 10 ms
[2024-05-30 12:01:08] [INFO ] Input system was already deterministic with 512 transitions.
[2024-05-30 12:01:08] [INFO ] Flatten gal took : 9 ms
[2024-05-30 12:01:08] [INFO ] Flatten gal took : 11 ms
[2024-05-30 12:01:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15436610972304402967.gal : 3 ms
[2024-05-30 12:01:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2272599519621002976.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/CTLFireability15436610972304402967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2272599519621002976.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,5.24103e+08,3.17555,73940,2,7257,5,298033,6,0,1041,288250,0


Converting to forward existential form...Done !
original formula: (AG(((p1==0)||(p199==0))) + (AX((p213==1)) * EF(AX(((E((p9==1) U ((p79==1)&&(p213==1))) * AG(((p8==1)&&(p213==1)))) * E((p120==1) U ((p12...178
=> equivalent forward existential formula: ([(EY((Init * !(!(E(TRUE U !(((p1==0)||(p199==0)))))))) * !((p213==1)))] = FALSE * [((Init * !(!(E(TRUE U !(((p1...330
Reverse transition relation is NOT exact ! Due to transitions t17, t21, t23, t30, t34, t36, t43, t47, t49, t58, t60, t62, t70, t72, t74, t82, t84, t86, In...252
(forward)formula 0,0,12.8577,272596,1,0,646,1.25189e+06,979,390,7022,1.089e+06,986
FORMULA UtahNoC-PT-none-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Graph (trivial) has 266 edges and 197 vertex of which 63 / 197 are part of one of the 16 SCC in 0 ms
Free SCC test removed 47 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 28 place count 123 transition count 503
Iterating global reduction 0 with 27 rules applied. Total rules applied 55 place count 123 transition count 503
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 92 place count 123 transition count 466
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 101 place count 114 transition count 443
Iterating global reduction 1 with 9 rules applied. Total rules applied 110 place count 114 transition count 443
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 122 place count 114 transition count 431
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 2 with 2 rules applied. Total rules applied 124 place count 113 transition count 430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 113 transition count 428
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 112 transition count 425
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 112 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 112 transition count 419
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 112 transition count 419
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 138 place count 110 transition count 417
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 110 transition count 417
Applied a total of 140 rules in 30 ms. Remains 110 /197 variables (removed 87) and now considering 417/755 (removed 338) transitions.
[2024-05-30 12:01:21] [INFO ] Flow matrix only has 189 transitions (discarded 228 similar events)
// Phase 1: matrix 189 rows 110 cols
[2024-05-30 12:01:21] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 12:01:21] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 12:01:21] [INFO ] Flow matrix only has 189 transitions (discarded 228 similar events)
[2024-05-30 12:01:21] [INFO ] Invariant cache hit.
[2024-05-30 12:01:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-30 12:01:21] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-30 12:01:21] [INFO ] Redundant transitions in 4 ms returned []
Running 416 sub problems to find dead transitions.
[2024-05-30 12:01:21] [INFO ] Flow matrix only has 189 transitions (discarded 228 similar events)
[2024-05-30 12:01:21] [INFO ] Invariant cache hit.
[2024-05-30 12:01:21] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 188/298 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 31/149 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 6 (OVERLAPS) 1/299 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 8 (OVERLAPS) 0/299 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 150 constraints, problems are : Problem set: 0 solved, 416 unsolved in 25012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 188/298 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 31/149 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 416/565 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 7 (OVERLAPS) 1/299 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 9 (OVERLAPS) 0/299 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 566 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 55233ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 55243ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/197 places, 417/755 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55472 ms. Remains : 110/197 places, 417/755 transitions.
[2024-05-30 12:02:16] [INFO ] Flatten gal took : 8 ms
[2024-05-30 12:02:16] [INFO ] Flatten gal took : 8 ms
[2024-05-30 12:02:16] [INFO ] Input system was already deterministic with 417 transitions.
[2024-05-30 12:02:16] [INFO ] Flatten gal took : 9 ms
[2024-05-30 12:02:16] [INFO ] Flatten gal took : 8 ms
[2024-05-30 12:02:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9614246992268365690.gal : 5 ms
[2024-05-30 12:02:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17462262289431607167.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/CTLFireability9614246992268365690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17462262289431607167.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95198e+07,0.949191,23028,2,3402,5,89514,6,0,792,71455,0


Converting to forward existential form...Done !
original formula: !(E((E(((p45==1)&&(p141==1)) U (p76==1)) + (!((A(((p4==1)&&(p96==1)) U ((p36==1)&&(p189==1))) + (p70==1))) * !(((((p134!=1) + EG((p123==1...290
=> equivalent forward existential formula: [(FwdU(Init,(E(((p45==1)&&(p141==1)) U (p76==1)) + (!((!((E(!(((p36==1)&&(p189==1))) U (!(((p4==1)&&(p96==1))) *...500
Reverse transition relation is NOT exact ! Due to transitions t18, t21, t23, t28, t30, t32, t36, t38, t40, t46, t48, t50, t57, t58, t59, t61, t62, t63, In...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-30 12:02:46] [INFO ] Flatten gal took : 8 ms
[2024-05-30 12:02:46] [INFO ] Applying decomposition
[2024-05-30 12:02:46] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7030626235107635992.txt' '-o' '/tmp/graph7030626235107635992.bin' '-w' '/tmp/graph7030626235107635992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7030626235107635992.bin' '-l' '-1' '-v' '-w' '/tmp/graph7030626235107635992.weights' '-q' '0' '-e' '0.001'
[2024-05-30 12:02:47] [INFO ] Decomposing Gal with order
[2024-05-30 12:02:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 12:02:47] [INFO ] Removed a total of 415 redundant transitions.
[2024-05-30 12:02:47] [INFO ] Flatten gal took : 80 ms
[2024-05-30 12:02:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 20 ms.
[2024-05-30 12:02:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1613625306705970554.gal : 5 ms
[2024-05-30 12:02:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10977415291214025686.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/CTLFireability1613625306705970554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10977415291214025686.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,3.95198e+07,0.224161,9936,463,23,13584,673,523,17929,98,2046,0


Converting to forward existential form...Done !
original formula: !(E((E(((i1.i0.u2.p45==1)&&(i1.i1.u22.p141==1)) U (i7.u8.p76==1)) + (!((A(((i3.i1.u13.p4==1)&&(i3.i1.u12.p96==1)) U ((i1.i0.u4.p36==1)&&(...441
=> equivalent forward existential formula: [(FwdU(Init,(E(((i1.i0.u2.p45==1)&&(i1.i1.u22.p141==1)) U (i7.u8.p76==1)) + (!((!((E(!(((i1.i0.u4.p36==1)&&(i6.u...711
Reverse transition relation is NOT exact ! Due to transitions t28, t30, t32, t38, t40, t46, t48, t59, i0.t23, i0.t21, i0.t18, i1.t63, i1.i0.t61, i1.i0.t62,...288
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 an SCC at level 7
Fast SCC detection found an SCC at level 8
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 an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,11.23,267864,1,0,498523,704,3354,756332,459,2539,669322
FORMULA UtahNoC-PT-none-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 166 transition count 612
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 166 transition count 612
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 84 place count 166 transition count 590
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 160 transition count 572
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 160 transition count 572
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 105 place count 160 transition count 563
Applied a total of 105 rules in 7 ms. Remains 160 /197 variables (removed 37) and now considering 563/755 (removed 192) transitions.
[2024-05-30 12:02:58] [INFO ] Flow matrix only has 297 transitions (discarded 266 similar events)
// Phase 1: matrix 297 rows 160 cols
[2024-05-30 12:02:58] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 12:02:58] [INFO ] Implicit Places using invariants in 86 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/197 places, 563/755 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 154 transition count 538
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 154 transition count 538
Applied a total of 10 rules in 3 ms. Remains 154 /159 variables (removed 5) and now considering 538/563 (removed 25) transitions.
[2024-05-30 12:02:58] [INFO ] Flow matrix only has 292 transitions (discarded 246 similar events)
// Phase 1: matrix 292 rows 154 cols
[2024-05-30 12:02:58] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 12:02:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 12:02:58] [INFO ] Flow matrix only has 292 transitions (discarded 246 similar events)
[2024-05-30 12:02:58] [INFO ] Invariant cache hit.
[2024-05-30 12:02:58] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-30 12:02:58] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 154/197 places, 538/755 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 154/197 places, 538/755 transitions.
[2024-05-30 12:02:58] [INFO ] Flatten gal took : 12 ms
[2024-05-30 12:02:58] [INFO ] Flatten gal took : 14 ms
[2024-05-30 12:02:59] [INFO ] Input system was already deterministic with 538 transitions.
[2024-05-30 12:02:59] [INFO ] Flatten gal took : 13 ms
[2024-05-30 12:02:59] [INFO ] Flatten gal took : 13 ms
[2024-05-30 12:02:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14732247444196291575.gal : 3 ms
[2024-05-30 12:02:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14279605965293530825.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/CTLFireability14732247444196291575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14279605965293530825.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,6.40258e+08,3.80399,78724,2,7477,5,294272,6,0,1084,326896,0


Converting to forward existential form...Done !
original formula: AG((((p67==0) + EX(((p107!=1)||(p213!=1)))) + (((p119==1)&&(p160==1)) + (EF((p9==1)) * ((p117==1)||((p76==1)&&(p160==1)))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((((p119==1)&&(p160==1)) + (E(TRUE U (p9==1)) * ((p117==1)||((p76==1)&&(p160==1))))))) * ...209
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t24, t31, t35, t37, t44, t48, t50, t59, t61, t63, t71, t73, t75, t83, t85, t87, In...252
(forward)formula 0,1,10.562,188620,1,0,664,778896,1013,399,7023,813853,1004
FORMULA UtahNoC-PT-none-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 166 transition count 612
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 166 transition count 612
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 87 place count 166 transition count 587
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 159 transition count 566
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 159 transition count 566
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 110 place count 159 transition count 557
Applied a total of 110 rules in 11 ms. Remains 159 /197 variables (removed 38) and now considering 557/755 (removed 198) transitions.
[2024-05-30 12:03:09] [INFO ] Flow matrix only has 291 transitions (discarded 266 similar events)
// Phase 1: matrix 291 rows 159 cols
[2024-05-30 12:03:09] [INFO ] Computed 8 invariants in 4 ms
[2024-05-30 12:03:09] [INFO ] Implicit Places using invariants in 78 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 158/197 places, 557/755 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 153 transition count 532
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 153 transition count 532
Applied a total of 10 rules in 3 ms. Remains 153 /158 variables (removed 5) and now considering 532/557 (removed 25) transitions.
[2024-05-30 12:03:09] [INFO ] Flow matrix only has 286 transitions (discarded 246 similar events)
// Phase 1: matrix 286 rows 153 cols
[2024-05-30 12:03:09] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 12:03:09] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 12:03:09] [INFO ] Flow matrix only has 286 transitions (discarded 246 similar events)
[2024-05-30 12:03:09] [INFO ] Invariant cache hit.
[2024-05-30 12:03:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-30 12:03:10] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/197 places, 532/755 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 360 ms. Remains : 153/197 places, 532/755 transitions.
[2024-05-30 12:03:10] [INFO ] Flatten gal took : 11 ms
[2024-05-30 12:03:10] [INFO ] Flatten gal took : 11 ms
[2024-05-30 12:03:10] [INFO ] Input system was already deterministic with 532 transitions.
[2024-05-30 12:03:10] [INFO ] Flatten gal took : 11 ms
[2024-05-30 12:03:10] [INFO ] Flatten gal took : 11 ms
[2024-05-30 12:03:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5416802207737950699.gal : 2 ms
[2024-05-30 12:03:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8190765570451722621.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/CTLFireability5416802207737950699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8190765570451722621.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(!(A((((EX(((p32==1)&&(p189==1))) + ((p143==1)&&(p54==1))) * (p35==1)) * (p189==1)) U ((AX(((p83==1)&&(p160==1))) * EX(((p48==1)&&(p189...207
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((!(EX(!(((p83==1)&&(p160==1))))) * EX(((p48==1)&&(p189==1)))) + (!(EG(!(((p50==1)&&...519
Reverse transition relation is NOT exact ! Due to transitions t20, t24, t26, t33, t37, t39, t46, t50, t52, t61, t63, t65, t73, t75, t77, t85, t87, t89, In...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.6514,215200,1,0,681,909191,1022,417,7395,945951,1029
FORMULA UtahNoC-PT-none-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 636
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 636
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 75 place count 171 transition count 613
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 164 transition count 592
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 164 transition count 592
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 99 place count 164 transition count 582
Applied a total of 99 rules in 6 ms. Remains 164 /197 variables (removed 33) and now considering 582/755 (removed 173) transitions.
[2024-05-30 12:03:22] [INFO ] Flow matrix only has 300 transitions (discarded 282 similar events)
// Phase 1: matrix 300 rows 164 cols
[2024-05-30 12:03:22] [INFO ] Computed 8 invariants in 3 ms
[2024-05-30 12:03:22] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 12:03:22] [INFO ] Flow matrix only has 300 transitions (discarded 282 similar events)
[2024-05-30 12:03:22] [INFO ] Invariant cache hit.
[2024-05-30 12:03:23] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-30 12:03:23] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-05-30 12:03:23] [INFO ] Flow matrix only has 300 transitions (discarded 282 similar events)
[2024-05-30 12:03:23] [INFO ] Invariant cache hit.
[2024-05-30 12:03:23] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 299/463 variables, 164/172 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 34/206 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (OVERLAPS) 1/464 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 207 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 299/463 variables, 164/172 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 34/206 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 581/787 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 7 (OVERLAPS) 1/464 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 788 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 0/0 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in LTL mode, iteration 1 : 164/197 places, 582/755 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60572 ms. Remains : 164/197 places, 582/755 transitions.
[2024-05-30 12:04:23] [INFO ] Flatten gal took : 17 ms
[2024-05-30 12:04:23] [INFO ] Flatten gal took : 18 ms
[2024-05-30 12:04:23] [INFO ] Input system was already deterministic with 582 transitions.
[2024-05-30 12:04:23] [INFO ] Flatten gal took : 18 ms
[2024-05-30 12:04:23] [INFO ] Flatten gal took : 19 ms
[2024-05-30 12:04:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4502574337751203039.gal : 5 ms
[2024-05-30 12:04:23] [INFO ] Time to serialize properties into /tmp/CTLFireability12489148669446974076.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/CTLFireability4502574337751203039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12489148669446974076.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,8.42844e+08,4.4696,79896,2,7474,5,323913,6,0,1157,293459,0


Converting to forward existential form...Done !
original formula: (AG((((p167==1) * (AF((((p1==1)&&(p207==1))||(p119==1))) + (p168==1))) * ((E((A(((p1==1)&&(p203==1)) U (p153==1)) * ((p138==1)||(p99==1))...514
=> equivalent forward existential formula: (([(FwdU((Init * !(EG((EX(E(TRUE U (((p5==1)&&(p189==1))||((p27==1)&&(p213==1))))) + ((((((p33==1)&&(p213==1))&&...1078
Reverse transition relation is NOT exact ! Due to transitions t27, t31, t33, t40, t44, t46, t53, t57, t59, t68, t70, t72, t80, t82, t84, t92, t94, t96, In...252
(forward)formula 0,1,25.9253,509708,1,0,785,2.68499e+06,1141,481,8078,1.94292e+06,1172
FORMULA UtahNoC-PT-none-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 755/755 transitions.
Graph (trivial) has 311 edges and 197 vertex of which 78 / 197 are part of one of the 13 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 29 place count 104 transition count 424
Iterating global reduction 0 with 28 rules applied. Total rules applied 57 place count 104 transition count 424
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 92 place count 104 transition count 389
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 101 place count 95 transition count 365
Iterating global reduction 1 with 9 rules applied. Total rules applied 110 place count 95 transition count 365
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 122 place count 95 transition count 353
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 92 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 132 place count 92 transition count 346
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 134 place count 90 transition count 340
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 90 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 90 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 90 transition count 334
Applied a total of 142 rules in 22 ms. Remains 90 /197 variables (removed 107) and now considering 334/755 (removed 421) transitions.
[2024-05-30 12:04:49] [INFO ] Flow matrix only has 153 transitions (discarded 181 similar events)
// Phase 1: matrix 153 rows 90 cols
[2024-05-30 12:04:49] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 12:04:49] [INFO ] Implicit Places using invariants in 69 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/197 places, 334/755 transitions.
Graph (trivial) has 132 edges and 89 vertex of which 22 / 89 are part of one of the 4 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 68 transition count 255
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 68 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 68 transition count 249
Applied a total of 13 rules in 7 ms. Remains 68 /89 variables (removed 21) and now considering 249/334 (removed 85) transitions.
[2024-05-30 12:04:49] [INFO ] Flow matrix only has 116 transitions (discarded 133 similar events)
// Phase 1: matrix 116 rows 68 cols
[2024-05-30 12:04:49] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 12:04:49] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 12:04:49] [INFO ] Flow matrix only has 116 transitions (discarded 133 similar events)
[2024-05-30 12:04:49] [INFO ] Invariant cache hit.
[2024-05-30 12:04:49] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-30 12:04:49] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 68/197 places, 249/755 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 237 ms. Remains : 68/197 places, 249/755 transitions.
[2024-05-30 12:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-30 12:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 12:04:49] [INFO ] Input system was already deterministic with 249 transitions.
[2024-05-30 12:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 12:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 12:04:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16606254120380646718.gal : 1 ms
[2024-05-30 12:04:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17144786677507897188.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/CTLFireability16606254120380646718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17144786677507897188.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.92934e+06,0.287668,11220,2,1981,5,34706,6,0,482,31403,0


Converting to forward existential form...Done !
original formula: (EF(AG((p31==1))) + AG(E((p44==1) U !(((p1==1)&&(p215==1))))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U !(E(TRUE U !((p31==1))))))),TRUE) * !(E((p44==1) U !(((p1==1)&&(p215==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t13, t15, t17, t19, t21, t23, t25, t26, t27, t28, t29, t30, t31, t32, t34, Inte...250
(forward)formula 0,0,1.84449,48164,1,0,377,199837,481,219,3518,228138,477
FORMULA UtahNoC-PT-none-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 12:04:51] [INFO ] Flatten gal took : 23 ms
[2024-05-30 12:04:51] [INFO ] Flatten gal took : 24 ms
Total runtime 489642 ms.

BK_STOP 1717070691946

--------------------
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="UtahNoC-PT-none"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is UtahNoC-PT-none, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r444-smll-171701110500002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;