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.r544-smll-171701110500004.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 ltsminxred
Input is UtahNoC-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701110500004
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME UtahNoC-PT-none-LTLFireability-01
FORMULA_NAME UtahNoC-PT-none-LTLFireability-02
FORMULA_NAME UtahNoC-PT-none-LTLFireability-03
FORMULA_NAME UtahNoC-PT-none-LTLFireability-04
FORMULA_NAME UtahNoC-PT-none-LTLFireability-05
FORMULA_NAME UtahNoC-PT-none-LTLFireability-06
FORMULA_NAME UtahNoC-PT-none-LTLFireability-07
FORMULA_NAME UtahNoC-PT-none-LTLFireability-08
FORMULA_NAME UtahNoC-PT-none-LTLFireability-09
FORMULA_NAME UtahNoC-PT-none-LTLFireability-10
FORMULA_NAME UtahNoC-PT-none-LTLFireability-11
FORMULA_NAME UtahNoC-PT-none-LTLFireability-12
FORMULA_NAME UtahNoC-PT-none-LTLFireability-13
FORMULA_NAME UtahNoC-PT-none-LTLFireability-14
FORMULA_NAME UtahNoC-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717257082065

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:51:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:51:24] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-06-01 15:51:24] [INFO ] Transformed 216 places.
[2024-06-01 15:51:24] [INFO ] Transformed 977 transitions.
[2024-06-01 15:51:24] [INFO ] Found NUPN structural information;
[2024-06-01 15:51:24] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
FORMULA UtahNoC-PT-none-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 829/829 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 171 transition count 647
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 171 transition count 647
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 123 place count 171 transition count 614
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 130 place count 164 transition count 593
Iterating global reduction 1 with 7 rules applied. Total rules applied 137 place count 164 transition count 593
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 147 place count 164 transition count 583
Applied a total of 147 rules in 116 ms. Remains 164 /216 variables (removed 52) and now considering 583/829 (removed 246) transitions.
[2024-06-01 15:51:24] [INFO ] Flow matrix only has 309 transitions (discarded 274 similar events)
// Phase 1: matrix 309 rows 164 cols
[2024-06-01 15:51:24] [INFO ] Computed 8 invariants in 29 ms
[2024-06-01 15:51:25] [INFO ] Implicit Places using invariants in 515 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 565 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/216 places, 583/829 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 159 transition count 563
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 159 transition count 563
Applied a total of 8 rules in 22 ms. Remains 159 /163 variables (removed 4) and now considering 563/583 (removed 20) transitions.
[2024-06-01 15:51:25] [INFO ] Flow matrix only has 305 transitions (discarded 258 similar events)
// Phase 1: matrix 305 rows 159 cols
[2024-06-01 15:51:25] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 15:51:25] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 15:51:25] [INFO ] Flow matrix only has 305 transitions (discarded 258 similar events)
[2024-06-01 15:51:25] [INFO ] Invariant cache hit.
[2024-06-01 15:51:25] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 15:51:25] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 159/216 places, 563/829 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1160 ms. Remains : 159/216 places, 563/829 transitions.
Support contains 30 out of 159 places after structural reductions.
[2024-06-01 15:51:26] [INFO ] Flatten gal took : 102 ms
[2024-06-01 15:51:26] [INFO ] Flatten gal took : 45 ms
[2024-06-01 15:51:26] [INFO ] Input system was already deterministic with 563 transitions.
RANDOM walk for 40000 steps (8 resets) in 2398 ms. (16 steps per ms) remains 4/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
[2024-06-01 15:51:27] [INFO ] Flow matrix only has 305 transitions (discarded 258 similar events)
[2024-06-01 15:51:27] [INFO ] Invariant cache hit.
[2024-06-01 15:51:27] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 117/127 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 32/159 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 304/463 variables, 159/166 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 16/182 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/464 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/464 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 183 constraints, problems are : Problem set: 1 solved, 3 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 101/108 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/159 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 304/463 variables, 159/166 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 16/182 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 3/185 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/464 variables, 1/186 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/464 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 186 constraints, problems are : Problem set: 1 solved, 3 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1026ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 650 ms.
Support contains 7 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 563/563 transitions.
Graph (trivial) has 257 edges and 159 vertex of which 83 / 159 are part of one of the 15 SCC in 5 ms
Free SCC test removed 68 places
Drop transitions (Empty/Sink Transition effects.) removed 199 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 274 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 91 transition count 287
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 89 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 88 transition count 286
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 88 transition count 285
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 87 transition count 285
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 15 place count 81 transition count 264
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 81 transition count 264
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 29 place count 81 transition count 256
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 80 transition count 253
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 80 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 80 transition count 252
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 40 place count 76 transition count 245
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 15 rules applied. Total rules applied 55 place count 76 transition count 230
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 60 place count 73 transition count 228
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 68 place count 69 transition count 244
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 71 place count 69 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 8 with 20 rules applied. Total rules applied 91 place count 69 transition count 221
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 92 place count 68 transition count 220
Iterating global reduction 8 with 1 rules applied. Total rules applied 93 place count 68 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 94 place count 68 transition count 219
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 9 with 2 rules applied. Total rules applied 96 place count 67 transition count 232
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 99 place count 67 transition count 229
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 103 place count 64 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 104 place count 64 transition count 227
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 108 place count 64 transition count 227
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 109 place count 64 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 110 place count 63 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 111 place count 62 transition count 225
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 117 place count 59 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 118 place count 58 transition count 230
Applied a total of 118 rules in 142 ms. Remains 58 /159 variables (removed 101) and now considering 230/563 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 58/159 places, 230/563 transitions.
RANDOM walk for 33289 steps (6 resets) in 414 ms. (80 steps per ms) remains 0/3 properties
FORMULA UtahNoC-PT-none-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtahNoC-PT-none-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA UtahNoC-PT-none-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 563/563 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 149 transition count 516
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 149 transition count 516
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 29 place count 149 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 147 transition count 501
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 147 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 147 transition count 499
Applied a total of 35 rules in 11 ms. Remains 147 /159 variables (removed 12) and now considering 499/563 (removed 64) transitions.
[2024-06-01 15:51:29] [INFO ] Flow matrix only has 273 transitions (discarded 226 similar events)
// Phase 1: matrix 273 rows 147 cols
[2024-06-01 15:51:29] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 15:51:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 15:51:29] [INFO ] Flow matrix only has 273 transitions (discarded 226 similar events)
[2024-06-01 15:51:29] [INFO ] Invariant cache hit.
[2024-06-01 15:51:30] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 15:51:30] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-01 15:51:30] [INFO ] Flow matrix only has 273 transitions (discarded 226 similar events)
[2024-06-01 15:51:30] [INFO ] Invariant cache hit.
[2024-06-01 15:51:30] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (OVERLAPS) 272/419 variables, 147/154 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 16/170 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (OVERLAPS) 1/420 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 171 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (OVERLAPS) 272/419 variables, 147/154 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 16/170 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 498/668 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 15:52:11] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 1/420 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 670 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 1/1 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60457ms
Starting structural reductions in LTL mode, iteration 1 : 147/159 places, 499/563 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60746 ms. Remains : 147/159 places, 499/563 transitions.
Stuttering acceptance computed with spot in 456 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA UtahNoC-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-00 finished in 61296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(G(!p0)) U p0)) U X(p1)))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 563/563 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 148 transition count 511
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 148 transition count 511
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 148 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 146 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 146 transition count 495
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 146 transition count 493
Applied a total of 38 rules in 13 ms. Remains 146 /159 variables (removed 13) and now considering 493/563 (removed 70) transitions.
[2024-06-01 15:52:31] [INFO ] Flow matrix only has 271 transitions (discarded 222 similar events)
// Phase 1: matrix 271 rows 146 cols
[2024-06-01 15:52:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 15:52:31] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 15:52:31] [INFO ] Flow matrix only has 271 transitions (discarded 222 similar events)
[2024-06-01 15:52:31] [INFO ] Invariant cache hit.
[2024-06-01 15:52:31] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 15:52:31] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 492 sub problems to find dead transitions.
[2024-06-01 15:52:31] [INFO ] Flow matrix only has 271 transitions (discarded 222 similar events)
[2024-06-01 15:52:31] [INFO ] Invariant cache hit.
[2024-06-01 15:52:31] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (OVERLAPS) 270/416 variables, 146/153 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 16/169 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 6 (OVERLAPS) 1/417 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 8 (OVERLAPS) 0/417 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 492 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 170 constraints, problems are : Problem set: 0 solved, 492 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 492 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (OVERLAPS) 270/416 variables, 146/153 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 16/169 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 492/661 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 15:53:12] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 8 (OVERLAPS) 1/417 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 663 constraints, problems are : Problem set: 0 solved, 492 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 1/1 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 492 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Starting structural reductions in LTL mode, iteration 1 : 146/159 places, 493/563 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60601 ms. Remains : 146/159 places, 493/563 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 429 ms.
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 22 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtahNoC-PT-none-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtahNoC-PT-none-LTLFireability-01 finished in 61648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((!p0||G(p1))) U !p2)))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 563/563 transitions.
Graph (trivial) has 259 edges and 159 vertex of which 81 / 159 are part of one of the 21 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 177 transitions
Reduce isomorphic transitions removed 177 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 85 transition count 336
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 85 transition count 336
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 39 place count 85 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 82 transition count 316
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 82 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 82 transition count 313
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 54 place count 79 transition count 310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 79 transition count 306
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 77 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 77 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 77 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 90 place count 77 transition count 272
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 77 transition count 272
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 76 transition count 271
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 76 transition count 271
Applied a total of 93 rules in 53 ms. Remains 76 /159 variables (removed 83) and now considering 271/563 (removed 292) transitions.
[2024-06-01 15:53:32] [INFO ] Flow matrix only has 124 transitions (discarded 147 similar events)
// Phase 1: matrix 124 rows 76 cols
[2024-06-01 15:53:32] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 15:53:32] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 15:53:32] [INFO ] Flow matrix only has 124 transitions (discarded 147 similar events)
[2024-06-01 15:53:32] [INFO ] Invariant cache hit.
[2024-06-01 15:53:32] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-06-01 15:53:32] [INFO ] Redundant transitions in 16 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 15:53:32] [INFO ] Flow matrix only has 124 transitions (discarded 147 similar events)
[2024-06-01 15:53:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 123/199 variables, 76/83 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/200 variables, and 83 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6326 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 123/199 variables, 76/83 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 260/343 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/200 variables, and 343 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6865 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 13276ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 13280ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/159 places, 271/563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13504 ms. Remains : 76/159 places, 271/563 transitions.
Stuttering acceptance computed with spot in 201 ms :[p2, true, (NOT p1), (AND (NOT p1) p0), p2]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-05 finished in 13725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 563/563 transitions.
Graph (trivial) has 268 edges and 159 vertex of which 89 / 159 are part of one of the 17 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 77 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 77 transition count 302
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 28 place count 77 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 76 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 76 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 76 transition count 289
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 35 place count 74 transition count 287
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 74 transition count 283
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 72 transition count 277
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 72 transition count 277
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 71 transition count 275
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 71 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 71 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 72 place count 71 transition count 248
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 71 transition count 248
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 70 transition count 247
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 70 transition count 247
Applied a total of 75 rules in 39 ms. Remains 70 /159 variables (removed 89) and now considering 247/563 (removed 316) transitions.
[2024-06-01 15:53:46] [INFO ] Flow matrix only has 118 transitions (discarded 129 similar events)
// Phase 1: matrix 118 rows 70 cols
[2024-06-01 15:53:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 15:53:46] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 15:53:46] [INFO ] Flow matrix only has 118 transitions (discarded 129 similar events)
[2024-06-01 15:53:46] [INFO ] Invariant cache hit.
[2024-06-01 15:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 15:53:46] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-06-01 15:53:46] [INFO ] Redundant transitions in 4 ms returned []
Running 236 sub problems to find dead transitions.
[2024-06-01 15:53:46] [INFO ] Flow matrix only has 118 transitions (discarded 129 similar events)
[2024-06-01 15:53:46] [INFO ] Invariant cache hit.
[2024-06-01 15:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 2/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 117/187 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5851 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 2/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 117/187 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 236/314 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-06-01 15:53:55] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-06-01 15:53:55] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (OVERLAPS) 0/187 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/188 variables, and 316 constraints, problems are : Problem set: 0 solved, 236 unsolved in 7861 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 2/2 constraints]
After SMT, in 13778ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 13781ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/159 places, 247/563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14134 ms. Remains : 70/159 places, 247/563 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-06 finished in 14204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 563/563 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 148 transition count 512
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 148 transition count 512
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 148 transition count 502
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 146 transition count 496
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 146 transition count 496
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 146 transition count 494
Applied a total of 38 rules in 8 ms. Remains 146 /159 variables (removed 13) and now considering 494/563 (removed 69) transitions.
[2024-06-01 15:54:00] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
// Phase 1: matrix 268 rows 146 cols
[2024-06-01 15:54:00] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 15:54:00] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 15:54:00] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
[2024-06-01 15:54:00] [INFO ] Invariant cache hit.
[2024-06-01 15:54:00] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 15:54:00] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 493 sub problems to find dead transitions.
[2024-06-01 15:54:00] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
[2024-06-01 15:54:00] [INFO ] Invariant cache hit.
[2024-06-01 15:54:00] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (OVERLAPS) 267/413 variables, 146/153 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 16/169 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (OVERLAPS) 1/414 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 493 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 170 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 493 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (OVERLAPS) 267/413 variables, 146/153 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 16/169 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 493/662 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 7 (OVERLAPS) 1/414 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 493 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 663 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 493 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 146/159 places, 494/563 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60486 ms. Remains : 146/159 places, 494/563 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-10 finished in 60638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(X(X(F(p0)))) U (F(p1) U p2))))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 563/563 transitions.
Graph (trivial) has 263 edges and 159 vertex of which 86 / 159 are part of one of the 16 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 222 transitions
Reduce isomorphic transitions removed 222 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 80 transition count 309
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 80 transition count 309
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 24 place count 80 transition count 302
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 78 transition count 297
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 78 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 78 transition count 295
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 36 place count 75 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 75 transition count 288
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 73 transition count 282
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 73 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 73 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 71 place count 73 transition count 255
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 73 transition count 255
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 72 transition count 254
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 72 transition count 254
Applied a total of 74 rules in 65 ms. Remains 72 /159 variables (removed 87) and now considering 254/563 (removed 309) transitions.
[2024-06-01 15:55:01] [INFO ] Flow matrix only has 125 transitions (discarded 129 similar events)
// Phase 1: matrix 125 rows 72 cols
[2024-06-01 15:55:01] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 15:55:01] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 15:55:01] [INFO ] Flow matrix only has 125 transitions (discarded 129 similar events)
[2024-06-01 15:55:01] [INFO ] Invariant cache hit.
[2024-06-01 15:55:01] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-01 15:55:01] [INFO ] Redundant transitions in 5 ms returned []
Running 243 sub problems to find dead transitions.
[2024-06-01 15:55:01] [INFO ] Flow matrix only has 125 transitions (discarded 129 similar events)
[2024-06-01 15:55:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 124/196 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/197 variables, and 79 constraints, problems are : Problem set: 0 solved, 243 unsolved in 6236 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 124/196 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 243/322 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 15:55:11] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 15:55:12] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/197 variables, and 324 constraints, problems are : Problem set: 0 solved, 243 unsolved in 10365 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 2/2 constraints]
After SMT, in 16667ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 16671ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/159 places, 254/563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16907 ms. Remains : 72/159 places, 254/563 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA UtahNoC-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-12 finished in 17032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 563/563 transitions.
Graph (trivial) has 274 edges and 159 vertex of which 91 / 159 are part of one of the 17 SCC in 0 ms
Free SCC test removed 74 places
Ensure Unique test removed 215 transitions
Reduce isomorphic transitions removed 215 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 74 transition count 301
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 74 transition count 301
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 32 place count 74 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 72 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 72 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 72 transition count 282
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 44 place count 69 transition count 279
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 69 transition count 275
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 67 transition count 269
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 67 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 67 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 79 place count 67 transition count 242
Applied a total of 79 rules in 24 ms. Remains 67 /159 variables (removed 92) and now considering 242/563 (removed 321) transitions.
[2024-06-01 15:55:18] [INFO ] Flow matrix only has 110 transitions (discarded 132 similar events)
// Phase 1: matrix 110 rows 67 cols
[2024-06-01 15:55:18] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 15:55:18] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 15:55:18] [INFO ] Flow matrix only has 110 transitions (discarded 132 similar events)
[2024-06-01 15:55:18] [INFO ] Invariant cache hit.
[2024-06-01 15:55:18] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-06-01 15:55:18] [INFO ] Redundant transitions in 2 ms returned []
Running 228 sub problems to find dead transitions.
[2024-06-01 15:55:18] [INFO ] Flow matrix only has 110 transitions (discarded 132 similar events)
[2024-06-01 15:55:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 109/176 variables, 67/74 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/176 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/177 variables, and 74 constraints, problems are : Problem set: 0 solved, 228 unsolved in 5728 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 109/176 variables, 67/74 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 228/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/176 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/177 variables, and 302 constraints, problems are : Problem set: 0 solved, 228 unsolved in 5632 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 11428ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 11431ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/159 places, 242/563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11618 ms. Remains : 67/159 places, 242/563 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-13
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA UtahNoC-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-13 finished in 11690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p1)||G(p2)))&&p0)))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 563/563 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 148 transition count 510
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 148 transition count 510
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 31 place count 148 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 146 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 146 transition count 495
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 146 transition count 493
Applied a total of 37 rules in 10 ms. Remains 146 /159 variables (removed 13) and now considering 493/563 (removed 70) transitions.
[2024-06-01 15:55:29] [INFO ] Flow matrix only has 271 transitions (discarded 222 similar events)
// Phase 1: matrix 271 rows 146 cols
[2024-06-01 15:55:30] [INFO ] Computed 7 invariants in 11 ms
[2024-06-01 15:55:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 15:55:30] [INFO ] Flow matrix only has 271 transitions (discarded 222 similar events)
[2024-06-01 15:55:30] [INFO ] Invariant cache hit.
[2024-06-01 15:55:30] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 15:55:30] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 492 sub problems to find dead transitions.
[2024-06-01 15:55:30] [INFO ] Flow matrix only has 271 transitions (discarded 222 similar events)
[2024-06-01 15:55:30] [INFO ] Invariant cache hit.
[2024-06-01 15:55:30] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (OVERLAPS) 270/416 variables, 146/153 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 16/169 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 6 (OVERLAPS) 1/417 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 170 constraints, problems are : Problem set: 0 solved, 492 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 492 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (OVERLAPS) 270/416 variables, 146/153 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 16/169 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 492/661 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 7 (OVERLAPS) 1/417 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 662 constraints, problems are : Problem set: 0 solved, 492 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 0/0 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 492 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Starting structural reductions in LTL mode, iteration 1 : 146/159 places, 493/563 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60488 ms. Remains : 146/159 places, 493/563 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-14 finished in 60697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 563/563 transitions.
Graph (trivial) has 269 edges and 159 vertex of which 92 / 159 are part of one of the 15 SCC in 1 ms
Free SCC test removed 77 places
Ensure Unique test removed 237 transitions
Reduce isomorphic transitions removed 237 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 76 transition count 303
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 76 transition count 303
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 20 place count 76 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 74 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 74 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 74 transition count 286
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 32 place count 71 transition count 283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 71 transition count 279
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 38 place count 69 transition count 273
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 69 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 69 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 65 place count 69 transition count 248
Applied a total of 65 rules in 25 ms. Remains 69 /159 variables (removed 90) and now considering 248/563 (removed 315) transitions.
[2024-06-01 15:56:30] [INFO ] Flow matrix only has 116 transitions (discarded 132 similar events)
// Phase 1: matrix 116 rows 69 cols
[2024-06-01 15:56:30] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 15:56:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 15:56:30] [INFO ] Flow matrix only has 116 transitions (discarded 132 similar events)
[2024-06-01 15:56:30] [INFO ] Invariant cache hit.
[2024-06-01 15:56:30] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-06-01 15:56:30] [INFO ] Redundant transitions in 1 ms returned []
Running 235 sub problems to find dead transitions.
[2024-06-01 15:56:30] [INFO ] Flow matrix only has 116 transitions (discarded 132 similar events)
[2024-06-01 15:56:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 15:56:31] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 115/184 variables, 69/77 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/185 variables, and 77 constraints, problems are : Problem set: 0 solved, 235 unsolved in 6192 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 115/184 variables, 69/77 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 235/312 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 15:56:40] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 5 ms to minimize.
[2024-06-01 15:56:40] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 15:56:41] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/185 variables, and 315 constraints, problems are : Problem set: 0 solved, 235 unsolved in 9933 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 4/4 constraints]
After SMT, in 16195ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 16199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/159 places, 248/563 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16399 ms. Remains : 69/159 places, 248/563 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtahNoC-PT-none-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA UtahNoC-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtahNoC-PT-none-LTLFireability-15 finished in 16511 ms.
All properties solved by simple procedures.
Total runtime 323227 ms.
ITS solved all properties within timeout

BK_STOP 1717257407243

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is UtahNoC-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r544-smll-171701110500004"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;