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.r246-tall-171654352100643.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is NoC3x3-PT-6B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654352100643
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 552K 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 NoC3x3-PT-6B-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716706732258

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-26 06:58:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 06:58:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 06:58:53] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-05-26 06:58:53] [INFO ] Transformed 1544 places.
[2024-05-26 06:58:53] [INFO ] Transformed 2229 transitions.
[2024-05-26 06:58:53] [INFO ] Found NUPN structural information;
[2024-05-26 06:58:53] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-6B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 358 places :
Symmetric choice reduction at 0 with 358 rule applications. Total rules 358 place count 1186 transition count 1871
Iterating global reduction 0 with 358 rules applied. Total rules applied 716 place count 1186 transition count 1871
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 821 place count 1081 transition count 1675
Iterating global reduction 0 with 105 rules applied. Total rules applied 926 place count 1081 transition count 1675
Discarding 92 places :
Symmetric choice reduction at 0 with 92 rule applications. Total rules 1018 place count 989 transition count 1518
Iterating global reduction 0 with 92 rules applied. Total rules applied 1110 place count 989 transition count 1518
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1130 place count 969 transition count 1478
Iterating global reduction 0 with 20 rules applied. Total rules applied 1150 place count 969 transition count 1478
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1163 place count 956 transition count 1444
Iterating global reduction 0 with 13 rules applied. Total rules applied 1176 place count 956 transition count 1444
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1189 place count 943 transition count 1431
Iterating global reduction 0 with 13 rules applied. Total rules applied 1202 place count 943 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1203 place count 942 transition count 1429
Iterating global reduction 0 with 1 rules applied. Total rules applied 1204 place count 942 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1205 place count 941 transition count 1427
Iterating global reduction 0 with 1 rules applied. Total rules applied 1206 place count 941 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1207 place count 940 transition count 1426
Iterating global reduction 0 with 1 rules applied. Total rules applied 1208 place count 940 transition count 1426
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 1212 place count 940 transition count 1422
Applied a total of 1212 rules in 572 ms. Remains 940 /1544 variables (removed 604) and now considering 1422/2229 (removed 807) transitions.
// Phase 1: matrix 1422 rows 940 cols
[2024-05-26 06:58:54] [INFO ] Computed 66 invariants in 28 ms
[2024-05-26 06:58:55] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-26 06:58:55] [INFO ] Invariant cache hit.
[2024-05-26 06:58:56] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1646 ms to find 0 implicit places.
Running 1421 sub problems to find dead transitions.
[2024-05-26 06:58:56] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/939 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1421 unsolved
SMT process timed out in 30536ms, After SMT, problems are : Problem set: 0 solved, 1421 unsolved
Search for dead transitions found 0 dead transitions in 30565ms
Starting structural reductions in LTL mode, iteration 1 : 940/1544 places, 1422/2229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32839 ms. Remains : 940/1544 places, 1422/2229 transitions.
Support contains 25 out of 940 places after structural reductions.
[2024-05-26 06:59:26] [INFO ] Flatten gal took : 124 ms
[2024-05-26 06:59:27] [INFO ] Flatten gal took : 71 ms
[2024-05-26 06:59:27] [INFO ] Input system was already deterministic with 1422 transitions.
Support contains 24 out of 940 places (down from 25) after GAL structural reductions.
RANDOM walk for 40000 steps (90 resets) in 1448 ms. (27 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40002 steps (10 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
[2024-05-26 06:59:27] [INFO ] Invariant cache hit.
Problem AtomicPropp3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 153/160 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 780/940 variables, 59/66 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/940 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1422/2362 variables, 940/1006 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2362 variables, 0/1006 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2362 variables, 0/1006 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2362/2362 variables, and 1006 constraints, problems are : Problem set: 1 solved, 2 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 940/940 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/152 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 788/940 variables, 60/66 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-26 06:59:29] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/940 variables, 1/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/940 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1422/2362 variables, 940/1007 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2362 variables, 2/1009 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-26 06:59:30] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 2 ms to minimize.
[2024-05-26 06:59:30] [INFO ] Deduced a trap composed of 82 places in 221 ms of which 3 ms to minimize.
[2024-05-26 06:59:30] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 3 ms to minimize.
[2024-05-26 06:59:30] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2362 variables, 4/1013 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2362 variables, 0/1013 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2362 variables, 0/1013 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2362/2362 variables, and 1013 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2564 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 940/940 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 3350ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 304 ms.
Support contains 6 out of 940 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 940/940 places, 1422/1422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 940 transition count 1387
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 905 transition count 1387
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 70 place count 905 transition count 1290
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 264 place count 808 transition count 1290
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 292 place count 780 transition count 1157
Iterating global reduction 2 with 28 rules applied. Total rules applied 320 place count 780 transition count 1157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 320 place count 780 transition count 1156
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 779 transition count 1156
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 330 place count 771 transition count 1122
Iterating global reduction 2 with 8 rules applied. Total rules applied 338 place count 771 transition count 1122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 340 place count 769 transition count 1118
Iterating global reduction 2 with 2 rules applied. Total rules applied 342 place count 769 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 343 place count 768 transition count 1116
Iterating global reduction 2 with 1 rules applied. Total rules applied 344 place count 768 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 345 place count 767 transition count 1114
Iterating global reduction 2 with 1 rules applied. Total rules applied 346 place count 767 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 347 place count 766 transition count 1112
Iterating global reduction 2 with 1 rules applied. Total rules applied 348 place count 766 transition count 1112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 766 transition count 1111
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 709 place count 586 transition count 931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 710 place count 585 transition count 929
Iterating global reduction 3 with 1 rules applied. Total rules applied 711 place count 585 transition count 929
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 712 place count 584 transition count 927
Iterating global reduction 3 with 1 rules applied. Total rules applied 713 place count 584 transition count 927
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 714 place count 583 transition count 925
Iterating global reduction 3 with 1 rules applied. Total rules applied 715 place count 583 transition count 925
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 716 place count 582 transition count 923
Iterating global reduction 3 with 1 rules applied. Total rules applied 717 place count 582 transition count 923
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 718 place count 582 transition count 922
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 920 place count 481 transition count 955
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 996 place count 443 transition count 971
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 1019 place count 443 transition count 948
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 1044 place count 443 transition count 923
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 1081 place count 418 transition count 911
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1083 place count 418 transition count 909
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1084 place count 418 transition count 908
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1085 place count 417 transition count 908
Applied a total of 1085 rules in 559 ms. Remains 417 /940 variables (removed 523) and now considering 908/1422 (removed 514) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 417/940 places, 908/1422 transitions.
RANDOM walk for 39893 steps (269 resets) in 512 ms. (77 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 65 stabilizing places and 65 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 U (p1||G(!p0))))))'
Support contains 4 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 927 transition count 1406
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 927 transition count 1406
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 920 transition count 1389
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 920 transition count 1389
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 917 transition count 1383
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 917 transition count 1383
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 914 transition count 1379
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 914 transition count 1379
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 912 transition count 1376
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 912 transition count 1376
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 910 transition count 1372
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 910 transition count 1372
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 908 transition count 1369
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 908 transition count 1369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 908 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 907 transition count 1365
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 907 transition count 1365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 907 transition count 1364
Applied a total of 70 rules in 128 ms. Remains 907 /940 variables (removed 33) and now considering 1364/1422 (removed 58) transitions.
// Phase 1: matrix 1364 rows 907 cols
[2024-05-26 06:59:32] [INFO ] Computed 66 invariants in 6 ms
[2024-05-26 06:59:33] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-26 06:59:33] [INFO ] Invariant cache hit.
[2024-05-26 06:59:33] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
Running 1363 sub problems to find dead transitions.
[2024-05-26 06:59:34] [INFO ] Invariant cache hit.
(s325 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
SMT process timed out in 30500ms, After SMT, problems are : Problem set: 0 solved, 1363 unsolved
Search for dead transitions found 0 dead transitions in 30512ms
Starting structural reductions in LTL mode, iteration 1 : 907/940 places, 1364/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31919 ms. Remains : 907/940 places, 1364/1422 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-01
Stuttering criterion allowed to conclude after 504 steps with 0 reset in 8 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-01 finished in 32190 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((G(!p0) U p1))))'
Support contains 4 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 926 transition count 1403
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 926 transition count 1403
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 918 transition count 1384
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 918 transition count 1384
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 914 transition count 1377
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 914 transition count 1377
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 910 transition count 1371
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 910 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 907 transition count 1366
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 907 transition count 1366
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 904 transition count 1361
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 904 transition count 1361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 904 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 902 transition count 1357
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 902 transition count 1357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 902 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 901 transition count 1353
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 901 transition count 1353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 901 transition count 1352
Applied a total of 83 rules in 141 ms. Remains 901 /940 variables (removed 39) and now considering 1352/1422 (removed 70) transitions.
// Phase 1: matrix 1352 rows 901 cols
[2024-05-26 07:00:04] [INFO ] Computed 66 invariants in 6 ms
[2024-05-26 07:00:05] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-26 07:00:05] [INFO ] Invariant cache hit.
[2024-05-26 07:00:06] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Running 1351 sub problems to find dead transitions.
[2024-05-26 07:00:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
SMT process timed out in 30346ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 30361ms
Starting structural reductions in LTL mode, iteration 1 : 901/940 places, 1352/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31682 ms. Remains : 901/940 places, 1352/1422 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 307 ms.
Product exploration explored 100000 steps with 33333 reset in 256 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6B-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLCardinality-03 finished in 32518 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((p0||X((p0&&G(p1))))))'
Support contains 2 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 927 transition count 1404
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 927 transition count 1404
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 919 transition count 1385
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 919 transition count 1385
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 915 transition count 1378
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 915 transition count 1378
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 911 transition count 1372
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 911 transition count 1372
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 908 transition count 1367
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 908 transition count 1367
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 905 transition count 1362
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 905 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 905 transition count 1361
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 903 transition count 1358
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 903 transition count 1358
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 903 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 902 transition count 1354
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 902 transition count 1354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 902 transition count 1353
Applied a total of 81 rules in 139 ms. Remains 902 /940 variables (removed 38) and now considering 1353/1422 (removed 69) transitions.
// Phase 1: matrix 1353 rows 902 cols
[2024-05-26 07:00:37] [INFO ] Computed 66 invariants in 5 ms
[2024-05-26 07:00:37] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-26 07:00:37] [INFO ] Invariant cache hit.
[2024-05-26 07:00:38] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2024-05-26 07:00:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
SMT process timed out in 30324ms, After SMT, problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 30335ms
Starting structural reductions in LTL mode, iteration 1 : 902/940 places, 1353/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31720 ms. Remains : 902/940 places, 1353/1422 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-04 finished in 31962 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((G(p0)||G(p1))))'
Support contains 4 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1422/1422 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 929 transition count 1409
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 929 transition count 1409
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 922 transition count 1392
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 922 transition count 1392
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 919 transition count 1387
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 919 transition count 1387
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 916 transition count 1382
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 916 transition count 1382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 913 transition count 1377
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 913 transition count 1377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 910 transition count 1372
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 910 transition count 1372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 910 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 908 transition count 1368
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 908 transition count 1368
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 908 transition count 1365
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 907 transition count 1364
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 907 transition count 1364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 907 transition count 1363
Applied a total of 71 rules in 130 ms. Remains 907 /940 variables (removed 33) and now considering 1363/1422 (removed 59) transitions.
// Phase 1: matrix 1363 rows 907 cols
[2024-05-26 07:01:09] [INFO ] Computed 66 invariants in 15 ms
[2024-05-26 07:01:09] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-26 07:01:09] [INFO ] Invariant cache hit.
[2024-05-26 07:01:10] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Running 1362 sub problems to find dead transitions.
[2024-05-26 07:01:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
SMT process timed out in 30318ms, After SMT, problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 30330ms
Starting structural reductions in LTL mode, iteration 1 : 907/940 places, 1363/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31654 ms. Remains : 907/940 places, 1363/1422 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-05
Product exploration explored 100000 steps with 231 reset in 306 ms.
Product exploration explored 100000 steps with 224 reset in 384 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 125 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (91 resets) in 264 ms. (150 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
[2024-05-26 07:01:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 803/907 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/907 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1363/2270 variables, 907/973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2270 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2270 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2270/2270 variables, and 973 constraints, problems are : Problem set: 0 solved, 3 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 907/907 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 803/907 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 07:01:43] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-26 07:01:43] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 4 ms to minimize.
[2024-05-26 07:01:43] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 5 ms to minimize.
[2024-05-26 07:01:43] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 4 ms to minimize.
[2024-05-26 07:01:44] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 5 ms to minimize.
[2024-05-26 07:01:44] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/907 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1363/2270 variables, 907/979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2270 variables, 3/982 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2270 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2270 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2270/2270 variables, and 982 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2303 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 907/907 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 2880ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1749 ms.
Support contains 4 out of 907 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 907/907 places, 1363/1363 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 907 transition count 1335
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 879 transition count 1335
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 56 place count 879 transition count 1239
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 248 place count 783 transition count 1239
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 271 place count 760 transition count 1093
Iterating global reduction 2 with 23 rules applied. Total rules applied 294 place count 760 transition count 1093
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 0 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 656 place count 579 transition count 912
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 858 place count 478 transition count 942
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 936 place count 439 transition count 958
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 960 place count 439 transition count 934
Free-agglomeration rule applied 25 times.
Iterating global reduction 2 with 25 rules applied. Total rules applied 985 place count 439 transition count 909
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1024 place count 414 transition count 895
Applied a total of 1024 rules in 135 ms. Remains 414 /907 variables (removed 493) and now considering 895/1363 (removed 468) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 414/907 places, 895/1363 transitions.
RANDOM walk for 40000 steps (274 resets) in 524 ms. (76 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
// Phase 1: matrix 895 rows 414 cols
[2024-05-26 07:01:47] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 07:01:47] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 375/414 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 895/1309 variables, 414/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1309 variables, 53/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1309 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1309 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 414/414 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 375/414 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 895/1309 variables, 414/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1309 variables, 53/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1309 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1309 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1309 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 414/414 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 895/895 transitions.
Applied a total of 0 rules in 21 ms. Remains 414 /414 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 414/414 places, 895/895 transitions.
RANDOM walk for 40000 steps (278 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (13 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 411523 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 411523 steps, saw 131051 distinct states, run finished after 3005 ms. (steps per millisecond=136 ) properties seen :0
[2024-05-26 07:01:51] [INFO ] Invariant cache hit.
[2024-05-26 07:01:51] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 375/414 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 895/1309 variables, 414/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1309 variables, 53/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1309 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1309 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 414/414 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 375/414 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 07:01:51] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 895/1309 variables, 414/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1309 variables, 53/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1309 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1309 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 535 constraints, problems are : Problem set: 0 solved, 1 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 414/414 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 677ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 895/895 transitions.
Applied a total of 0 rules in 12 ms. Remains 414 /414 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 414/414 places, 895/895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 895/895 transitions.
Applied a total of 0 rules in 12 ms. Remains 414 /414 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-26 07:01:51] [INFO ] Invariant cache hit.
[2024-05-26 07:01:54] [INFO ] Implicit Places using invariants in 2347 ms returned [10, 45, 89, 128, 184, 259, 307, 348, 394]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2349 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 405/414 places, 895/895 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 381 transition count 871
Applied a total of 48 rules in 16 ms. Remains 381 /405 variables (removed 24) and now considering 871/895 (removed 24) transitions.
// Phase 1: matrix 871 rows 381 cols
[2024-05-26 07:01:54] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 07:01:54] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-26 07:01:54] [INFO ] Invariant cache hit.
[2024-05-26 07:01:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-26 07:01:54] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 381/414 places, 871/895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3102 ms. Remains : 381/414 places, 871/895 transitions.
RANDOM walk for 36813 steps (269 resets) in 207 ms. (176 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 13 factoid took 311 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6B-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLCardinality-05 finished in 46125 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(p0) U ((X(p0)&&(p0||(!p1&&X(p2))))||X(G(p0)))))'
Support contains 4 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 927 transition count 1404
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 927 transition count 1404
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 920 transition count 1391
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 920 transition count 1391
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 916 transition count 1384
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 916 transition count 1384
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 912 transition count 1378
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 912 transition count 1378
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 909 transition count 1373
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 909 transition count 1373
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 906 transition count 1368
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 906 transition count 1368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 906 transition count 1367
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 904 transition count 1364
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 904 transition count 1364
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 76 place count 904 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 903 transition count 1360
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 903 transition count 1360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 903 transition count 1359
Applied a total of 79 rules in 154 ms. Remains 903 /940 variables (removed 37) and now considering 1359/1422 (removed 63) transitions.
// Phase 1: matrix 1359 rows 903 cols
[2024-05-26 07:01:55] [INFO ] Computed 66 invariants in 14 ms
[2024-05-26 07:01:55] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-26 07:01:55] [INFO ] Invariant cache hit.
[2024-05-26 07:01:56] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Running 1358 sub problems to find dead transitions.
[2024-05-26 07:01:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/902 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1358 unsolved
SMT process timed out in 30352ms, After SMT, problems are : Problem set: 0 solved, 1358 unsolved
Search for dead transitions found 0 dead transitions in 30367ms
Starting structural reductions in LTL mode, iteration 1 : 903/940 places, 1359/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31692 ms. Remains : 903/940 places, 1359/1422 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 16 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6B-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLCardinality-09 finished in 32423 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 1 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 1422/1422 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 925 transition count 1402
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 925 transition count 1402
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 917 transition count 1383
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 917 transition count 1383
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 913 transition count 1376
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 913 transition count 1376
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 909 transition count 1370
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 909 transition count 1370
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 906 transition count 1365
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 906 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 903 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 903 transition count 1360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 903 transition count 1359
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 901 transition count 1356
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 901 transition count 1356
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 901 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 900 transition count 1352
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 900 transition count 1352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 900 transition count 1351
Applied a total of 85 rules in 141 ms. Remains 900 /940 variables (removed 40) and now considering 1351/1422 (removed 71) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2024-05-26 07:02:27] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 07:02:28] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-26 07:02:28] [INFO ] Invariant cache hit.
[2024-05-26 07:02:29] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
Running 1350 sub problems to find dead transitions.
[2024-05-26 07:02:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/899 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
SMT process timed out in 30350ms, After SMT, problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 30362ms
Starting structural reductions in LTL mode, iteration 1 : 900/940 places, 1351/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31738 ms. Remains : 900/940 places, 1351/1422 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 283 ms.
Product exploration explored 100000 steps with 33333 reset in 307 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Detected a total of 65/900 stabilizing places and 65/1351 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLCardinality-11 finished in 32595 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)&&F(p1))))'
Support contains 3 out of 940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 940/940 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 939 transition count 1387
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 905 transition count 1387
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 68 place count 905 transition count 1290
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 262 place count 808 transition count 1290
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 295 place count 775 transition count 1144
Iterating global reduction 2 with 33 rules applied. Total rules applied 328 place count 775 transition count 1144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 328 place count 775 transition count 1142
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 332 place count 773 transition count 1142
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 342 place count 763 transition count 1102
Iterating global reduction 2 with 10 rules applied. Total rules applied 352 place count 763 transition count 1102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 760 transition count 1096
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 760 transition count 1096
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 360 place count 758 transition count 1092
Iterating global reduction 2 with 2 rules applied. Total rules applied 362 place count 758 transition count 1092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 363 place count 758 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 364 place count 757 transition count 1089
Iterating global reduction 3 with 1 rules applied. Total rules applied 365 place count 757 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 366 place count 756 transition count 1087
Iterating global reduction 3 with 1 rules applied. Total rules applied 367 place count 756 transition count 1087
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 368 place count 756 transition count 1086
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 1 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 4 with 356 rules applied. Total rules applied 724 place count 578 transition count 908
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 926 place count 477 transition count 938
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1004 place count 438 transition count 953
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1028 place count 438 transition count 929
Applied a total of 1028 rules in 209 ms. Remains 438 /940 variables (removed 502) and now considering 929/1422 (removed 493) transitions.
// Phase 1: matrix 929 rows 438 cols
[2024-05-26 07:03:00] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 07:03:00] [INFO ] Implicit Places using invariants in 244 ms returned [10, 45, 97, 136, 197, 277, 328, 367, 416]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 246 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 429/940 places, 929/1422 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 405 transition count 905
Applied a total of 48 rules in 21 ms. Remains 405 /429 variables (removed 24) and now considering 905/929 (removed 24) transitions.
// Phase 1: matrix 905 rows 405 cols
[2024-05-26 07:03:00] [INFO ] Computed 57 invariants in 10 ms
[2024-05-26 07:03:01] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-26 07:03:01] [INFO ] Invariant cache hit.
[2024-05-26 07:03:01] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 07:03:01] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/940 places, 905/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1322 ms. Remains : 405/940 places, 905/1422 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-14
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-14 finished in 1470 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 2 out of 940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 940/940 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 939 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 906 transition count 1388
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 66 place count 906 transition count 1290
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 262 place count 808 transition count 1290
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 294 place count 776 transition count 1145
Iterating global reduction 2 with 32 rules applied. Total rules applied 326 place count 776 transition count 1145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 326 place count 776 transition count 1143
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 774 transition count 1143
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 339 place count 765 transition count 1105
Iterating global reduction 2 with 9 rules applied. Total rules applied 348 place count 765 transition count 1105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 350 place count 763 transition count 1101
Iterating global reduction 2 with 2 rules applied. Total rules applied 352 place count 763 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 353 place count 762 transition count 1099
Iterating global reduction 2 with 1 rules applied. Total rules applied 354 place count 762 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 355 place count 762 transition count 1098
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 711 place count 584 transition count 920
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 712 place count 583 transition count 918
Iterating global reduction 3 with 1 rules applied. Total rules applied 713 place count 583 transition count 918
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 714 place count 582 transition count 916
Iterating global reduction 3 with 1 rules applied. Total rules applied 715 place count 582 transition count 916
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 716 place count 581 transition count 914
Iterating global reduction 3 with 1 rules applied. Total rules applied 717 place count 581 transition count 914
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 718 place count 580 transition count 912
Iterating global reduction 3 with 1 rules applied. Total rules applied 719 place count 580 transition count 912
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 720 place count 580 transition count 911
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 922 place count 479 transition count 941
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1004 place count 438 transition count 956
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 1026 place count 438 transition count 934
Applied a total of 1026 rules in 212 ms. Remains 438 /940 variables (removed 502) and now considering 934/1422 (removed 488) transitions.
// Phase 1: matrix 934 rows 438 cols
[2024-05-26 07:03:02] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 07:03:02] [INFO ] Implicit Places using invariants in 241 ms returned [10, 45, 93, 132, 192, 272, 322, 363, 416]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 245 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 429/940 places, 934/1422 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 405 transition count 910
Applied a total of 48 rules in 25 ms. Remains 405 /429 variables (removed 24) and now considering 910/934 (removed 24) transitions.
// Phase 1: matrix 910 rows 405 cols
[2024-05-26 07:03:02] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 07:03:02] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-26 07:03:02] [INFO ] Invariant cache hit.
[2024-05-26 07:03:02] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-26 07:03:03] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/940 places, 910/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1310 ms. Remains : 405/940 places, 910/1422 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-15
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-15 finished in 1366 ms.
All properties solved by simple procedures.
Total runtime 249828 ms.

BK_STOP 1716706983294

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-6B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-6B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654352100643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6B.tgz
mv NoC3x3-PT-6B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;