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.r245-tall-171654350200571.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 greatspnxred
Input is NoC3x3-PT-2A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350200571
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 07:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 07:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 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 127K 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-2A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716682235086

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 00:10:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 00:10:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:10:36] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-26 00:10:36] [INFO ] Transformed 361 places.
[2024-05-26 00:10:36] [INFO ] Transformed 428 transitions.
[2024-05-26 00:10:36] [INFO ] Found NUPN structural information;
[2024-05-26 00:10:36] [INFO ] Parsed PT model containing 361 places and 428 transitions and 1697 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-2A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 428/428 transitions.
Ensure Unique test removed 23 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 338 transition count 428
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 117 place count 244 transition count 314
Ensure Unique test removed 29 places
Iterating global reduction 1 with 123 rules applied. Total rules applied 240 place count 215 transition count 314
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 296 place count 215 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 316 place count 215 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 322 place count 209 transition count 238
Applied a total of 322 rules in 70 ms. Remains 209 /361 variables (removed 152) and now considering 238/428 (removed 190) transitions.
[2024-05-26 00:10:36] [INFO ] Flow matrix only has 227 transitions (discarded 11 similar events)
// Phase 1: matrix 227 rows 209 cols
[2024-05-26 00:10:36] [INFO ] Computed 69 invariants in 19 ms
[2024-05-26 00:10:37] [INFO ] Implicit Places using invariants in 274 ms returned [7, 23, 48, 60, 89, 93, 126, 132, 156, 169, 177]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 305 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/361 places, 238/428 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 238/238 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 401 ms. Remains : 198/361 places, 238/428 transitions.
Support contains 27 out of 198 places after structural reductions.
[2024-05-26 00:10:37] [INFO ] Flatten gal took : 59 ms
[2024-05-26 00:10:37] [INFO ] Flatten gal took : 20 ms
[2024-05-26 00:10:37] [INFO ] Input system was already deterministic with 238 transitions.
RANDOM walk for 31084 steps (7 resets) in 1164 ms. (26 steps per ms) remains 0/18 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 238
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 185 transition count 223
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 185 transition count 223
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 33 place count 185 transition count 215
Applied a total of 33 rules in 15 ms. Remains 185 /198 variables (removed 13) and now considering 215/238 (removed 23) transitions.
[2024-05-26 00:10:38] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 185 cols
[2024-05-26 00:10:38] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 00:10:38] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-26 00:10:38] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 00:10:38] [INFO ] Invariant cache hit.
[2024-05-26 00:10:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 00:10:38] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-26 00:10:38] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 00:10:38] [INFO ] Invariant cache hit.
[2024-05-26 00:10:38] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/391 variables, 185/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/392 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/392 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 252 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8548 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 185/185 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/391 variables, 185/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 214/465 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 466 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9951 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 185/185 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 18613ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 18640ms
Starting structural reductions in LTL mode, iteration 1 : 185/198 places, 215/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18964 ms. Remains : 185/198 places, 215/238 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-02 finished in 19303 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' '!((p0 U (G((p1||(p2 U p3)))&&X(p1))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 238
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 187 transition count 226
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 187 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 28 place count 187 transition count 219
Applied a total of 28 rules in 7 ms. Remains 187 /198 variables (removed 11) and now considering 219/238 (removed 19) transitions.
[2024-05-26 00:10:57] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 187 cols
[2024-05-26 00:10:57] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 00:10:57] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-26 00:10:57] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2024-05-26 00:10:57] [INFO ] Invariant cache hit.
[2024-05-26 00:10:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 00:10:57] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-26 00:10:57] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2024-05-26 00:10:57] [INFO ] Invariant cache hit.
[2024-05-26 00:10:57] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 209/396 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/397 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/397 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 254 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8405 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 209/396 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 218/471 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 472 constraints, problems are : Problem set: 0 solved, 218 unsolved in 10123 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 18574ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 18577ms
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 219/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18944 ms. Remains : 187/198 places, 219/238 transitions.
Stuttering acceptance computed with spot in 623 ms :[(NOT p1), true, (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-03 finished in 19596 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) U p1)))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 196 transition count 171
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 155 place count 122 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 118 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 118 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 118 transition count 148
Applied a total of 164 rules in 57 ms. Remains 118 /198 variables (removed 80) and now considering 148/238 (removed 90) transitions.
// Phase 1: matrix 148 rows 118 cols
[2024-05-26 00:11:16] [INFO ] Computed 49 invariants in 0 ms
[2024-05-26 00:11:16] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-26 00:11:16] [INFO ] Invariant cache hit.
[2024-05-26 00:11:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 00:11:17] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-26 00:11:17] [INFO ] Redundant transitions in 84 ms returned [23, 30, 31, 44, 45, 56, 57, 58, 60, 68, 69, 85, 100, 101, 103, 110, 111, 112, 118, 119, 120, 122, 126, 129, 130, 131, 132, 135, 138, 139, 140, 141, 147]
Found 33 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 33 transitions
Redundant transitions reduction (with SMT) removed 33 transitions.
Running 90 sub problems to find dead transitions.
// Phase 1: matrix 115 rows 118 cols
[2024-05-26 00:11:17] [INFO ] Computed 49 invariants in 1 ms
[2024-05-26 00:11:17] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 13/118 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 114/232 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/233 variables, and 176 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2217 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 13/118 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 114/232 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 90/266 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/233 variables, and 266 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1552 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 3798ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 3800ms
Starting structural reductions in SI_LTL mode, iteration 1 : 118/198 places, 115/238 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 118 transition count 103
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 94 transition count 103
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 94 transition count 99
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 46 edges and 86 vertex of which 16 / 86 are part of one of the 8 SCC in 2 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 53 place count 78 transition count 95
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 63 place count 77 transition count 86
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 87 place count 61 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 60 transition count 77
Graph (trivial) has 37 edges and 60 vertex of which 14 / 60 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 53 transition count 77
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 97 place count 53 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 112 place count 53 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 115 place count 51 transition count 54
Graph (trivial) has 16 edges and 51 vertex of which 2 / 51 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 50 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 50 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 50 transition count 52
Applied a total of 118 rules in 39 ms. Remains 50 /118 variables (removed 68) and now considering 52/115 (removed 63) transitions.
// Phase 1: matrix 52 rows 50 cols
[2024-05-26 00:11:21] [INFO ] Computed 23 invariants in 0 ms
[2024-05-26 00:11:21] [INFO ] Implicit Places using invariants in 68 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/198 places, 52/238 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4331 ms. Remains : 49/198 places, 52/238 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-04 finished in 4509 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 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 197 transition count 174
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 75 rules applied. Total rules applied 139 place count 133 transition count 163
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 144 place count 129 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 126 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 126 transition count 157
Applied a total of 150 rules in 27 ms. Remains 126 /198 variables (removed 72) and now considering 157/238 (removed 81) transitions.
[2024-05-26 00:11:21] [INFO ] Flow matrix only has 148 transitions (discarded 9 similar events)
// Phase 1: matrix 148 rows 126 cols
[2024-05-26 00:11:21] [INFO ] Computed 57 invariants in 0 ms
[2024-05-26 00:11:21] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-26 00:11:21] [INFO ] Flow matrix only has 148 transitions (discarded 9 similar events)
[2024-05-26 00:11:21] [INFO ] Invariant cache hit.
[2024-05-26 00:11:21] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 00:11:21] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-26 00:11:21] [INFO ] Redundant transitions in 5 ms returned []
Running 156 sub problems to find dead transitions.
[2024-05-26 00:11:21] [INFO ] Flow matrix only has 148 transitions (discarded 9 similar events)
[2024-05-26 00:11:21] [INFO ] Invariant cache hit.
[2024-05-26 00:11:21] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 147/273 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 33/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 217 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4793 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 126/126 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 147/273 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 33/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 156/372 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/274 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 373 constraints, problems are : Problem set: 0 solved, 156 unsolved in 5191 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 126/126 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
After SMT, in 10019ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 10023ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/198 places, 157/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10259 ms. Remains : 126/198 places, 157/238 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-05 finished in 10320 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&&(!p1 U (p2||G(!p1)))))||(p0&&(!p1 U (p2||G(!p1)))&&G(F(p3))))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 196 transition count 174
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 82 rules applied. Total rules applied 145 place count 127 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 147 place count 125 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 122 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 122 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 122 transition count 152
Applied a total of 156 rules in 30 ms. Remains 122 /198 variables (removed 76) and now considering 152/238 (removed 86) transitions.
// Phase 1: matrix 152 rows 122 cols
[2024-05-26 00:11:31] [INFO ] Computed 51 invariants in 2 ms
[2024-05-26 00:11:31] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-26 00:11:31] [INFO ] Invariant cache hit.
[2024-05-26 00:11:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 00:11:31] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-26 00:11:31] [INFO ] Redundant transitions in 63 ms returned [23, 46, 47, 75, 86, 101, 102, 104, 108, 133, 134, 137, 149, 150, 151]
Found 15 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 15 transitions
Redundant transitions reduction (with SMT) removed 15 transitions.
Running 111 sub problems to find dead transitions.
// Phase 1: matrix 137 rows 122 cols
[2024-05-26 00:11:31] [INFO ] Computed 51 invariants in 1 ms
[2024-05-26 00:11:31] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 11/122 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 136/258 variables, 122/173 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 9/182 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/259 variables, and 182 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 122/122 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 11/122 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 136/258 variables, 122/173 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 9/182 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 111/293 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/259 variables, and 293 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2045 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 122/122 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 4238ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 4240ms
Starting structural reductions in SI_LTL mode, iteration 1 : 122/198 places, 137/238 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 122 transition count 129
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 129
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 106 transition count 126
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 38 edges and 100 vertex of which 8 / 100 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 37 place count 96 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 96 transition count 119
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 56 place count 86 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 84 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 34 edges and 84 vertex of which 4 / 84 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 82 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 82 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 71 place count 82 transition count 102
Applied a total of 71 rules in 16 ms. Remains 82 /122 variables (removed 40) and now considering 102/137 (removed 35) transitions.
[2024-05-26 00:11:36] [INFO ] Flow matrix only has 100 transitions (discarded 2 similar events)
// Phase 1: matrix 100 rows 82 cols
[2024-05-26 00:11:36] [INFO ] Computed 34 invariants in 1 ms
[2024-05-26 00:11:36] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-26 00:11:36] [INFO ] Flow matrix only has 100 transitions (discarded 2 similar events)
[2024-05-26 00:11:36] [INFO ] Invariant cache hit.
[2024-05-26 00:11:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-26 00:11:36] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/198 places, 102/238 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4688 ms. Remains : 82/198 places, 102/238 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-10
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 1 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-10 finished in 4928 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(X(F(p0)))))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 238
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 185 transition count 223
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 185 transition count 223
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 33 place count 185 transition count 215
Applied a total of 33 rules in 9 ms. Remains 185 /198 variables (removed 13) and now considering 215/238 (removed 23) transitions.
[2024-05-26 00:11:36] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 185 cols
[2024-05-26 00:11:36] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 00:11:36] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-26 00:11:36] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 00:11:36] [INFO ] Invariant cache hit.
[2024-05-26 00:11:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 00:11:36] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-26 00:11:36] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 00:11:36] [INFO ] Invariant cache hit.
[2024-05-26 00:11:36] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/391 variables, 185/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/392 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/392 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 252 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8134 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 185/185 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/391 variables, 185/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 214/465 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 466 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9405 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 185/185 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 17573ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 17575ms
Starting structural reductions in LTL mode, iteration 1 : 185/198 places, 215/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17812 ms. Remains : 185/198 places, 215/238 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 580 ms.
Product exploration explored 100000 steps with 25000 reset in 413 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3061 steps (0 resets) in 37 ms. (80 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-26 00:11:56] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 00:11:56] [INFO ] Invariant cache hit.
[2024-05-26 00:11:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-26 00:11:56] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 00:11:56] [INFO ] Invariant cache hit.
[2024-05-26 00:11:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 00:11:56] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-26 00:11:56] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 00:11:56] [INFO ] Invariant cache hit.
[2024-05-26 00:11:56] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/391 variables, 185/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/392 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/392 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 252 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8007 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 185/185 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/391 variables, 185/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 214/465 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 466 constraints, problems are : Problem set: 0 solved, 214 unsolved in 10047 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 185/185 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 18101ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 18104ms
Finished structural reductions in LTL mode , in 1 iterations and 18326 ms. Remains : 185/185 places, 215/215 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 971 steps (0 resets) in 13 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 326 ms.
Product exploration explored 100000 steps with 25000 reset in 383 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 215/215 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 185 transition count 215
Deduced a syphon composed of 60 places in 0 ms
Applied a total of 60 rules in 22 ms. Remains 185 /185 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-26 00:12:16] [INFO ] Redundant transitions in 2 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-26 00:12:16] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 185 cols
[2024-05-26 00:12:16] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 00:12:16] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 8 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-26 00:12:18] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/77 constraints. Problems are: Problem set: 43 solved, 171 unsolved
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD109 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
[2024-05-26 00:12:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD154 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 14/91 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 206/391 variables, 185/276 constraints. Problems are: Problem set: 60 solved, 154 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 33/309 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/309 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 1/392 variables, 1/310 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/310 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/392 variables, 0/310 constraints. Problems are: Problem set: 60 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 310 constraints, problems are : Problem set: 60 solved, 154 unsolved in 7984 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 185/185 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 60 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 61/185 variables, 57/57 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 34/91 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 206/391 variables, 185/276 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 33/309 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 154/463 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/463 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 1/392 variables, 1/464 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/464 constraints. Problems are: Problem set: 60 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/392 variables, 0/464 constraints. Problems are: Problem set: 60 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 60 solved, 154 unsolved in 6933 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 185/185 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 154/214 constraints, Known Traps: 34/34 constraints]
After SMT, in 14956ms problems are : Problem set: 60 solved, 154 unsolved
Search for dead transitions found 60 dead transitions in 14959ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 185/185 places, 155/215 transitions.
Graph (complete) has 433 edges and 185 vertex of which 125 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.2 ms
Discarding 60 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 125 /185 variables (removed 60) and now considering 155/155 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/185 places, 155/215 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15010 ms. Remains : 125/185 places, 155/215 transitions.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-26 00:12:31] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 185 cols
[2024-05-26 00:12:31] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 00:12:31] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-26 00:12:31] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 00:12:31] [INFO ] Invariant cache hit.
[2024-05-26 00:12:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 00:12:31] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-26 00:12:31] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 00:12:31] [INFO ] Invariant cache hit.
[2024-05-26 00:12:31] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/391 variables, 185/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/392 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/392 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 252 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8086 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 185/185 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 206/391 variables, 185/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 9/251 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 214/465 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 466 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9995 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 185/185 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 18116ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 18119ms
Finished structural reductions in LTL mode , in 1 iterations and 18395 ms. Remains : 185/185 places, 215/215 transitions.
Treatment of property NoC3x3-PT-2A-LTLCardinality-11 finished in 73294 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&&F(p1))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 238
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 187 transition count 225
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 187 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 187 transition count 219
Applied a total of 27 rules in 5 ms. Remains 187 /198 variables (removed 11) and now considering 219/238 (removed 19) transitions.
[2024-05-26 00:12:49] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 187 cols
[2024-05-26 00:12:49] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 00:12:49] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-26 00:12:49] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2024-05-26 00:12:49] [INFO ] Invariant cache hit.
[2024-05-26 00:12:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 00:12:50] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-26 00:12:50] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2024-05-26 00:12:50] [INFO ] Invariant cache hit.
[2024-05-26 00:12:50] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 210/397 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/398 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 254 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8597 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 210/397 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 218/471 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 472 constraints, problems are : Problem set: 0 solved, 218 unsolved in 10244 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 18882ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 18885ms
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 219/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19095 ms. Remains : 187/198 places, 219/238 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-12 finished in 19268 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)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 238
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 187 transition count 226
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 187 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 28 place count 187 transition count 219
Applied a total of 28 rules in 8 ms. Remains 187 /198 variables (removed 11) and now considering 219/238 (removed 19) transitions.
[2024-05-26 00:13:09] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 187 cols
[2024-05-26 00:13:09] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 00:13:09] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-26 00:13:09] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2024-05-26 00:13:09] [INFO ] Invariant cache hit.
[2024-05-26 00:13:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 00:13:09] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-26 00:13:09] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2024-05-26 00:13:09] [INFO ] Invariant cache hit.
[2024-05-26 00:13:09] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 209/396 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/397 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/397 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 254 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 209/396 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 218/471 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 472 constraints, problems are : Problem set: 0 solved, 218 unsolved in 10698 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 18753ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 18756ms
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 219/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19000 ms. Remains : 187/198 places, 219/238 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-13 finished in 19143 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' '!((p0 U G(!p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 196 transition count 170
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 158 place count 120 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 162 place count 116 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 166 place count 116 transition count 148
Applied a total of 166 rules in 7 ms. Remains 116 /198 variables (removed 82) and now considering 148/238 (removed 90) transitions.
// Phase 1: matrix 148 rows 116 cols
[2024-05-26 00:13:28] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 00:13:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-26 00:13:28] [INFO ] Invariant cache hit.
[2024-05-26 00:13:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 00:13:28] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-26 00:13:28] [INFO ] Redundant transitions in 72 ms returned [23, 30, 31, 44, 45, 56, 57, 58, 59, 60, 67, 68, 73, 84, 99, 100, 102, 106, 109, 112, 118, 119, 120, 122, 126, 129, 130, 131, 132, 135, 138, 139, 140, 141, 147]
Found 35 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 35 transitions
Redundant transitions reduction (with SMT) removed 35 transitions.
Running 88 sub problems to find dead transitions.
// Phase 1: matrix 113 rows 116 cols
[2024-05-26 00:13:28] [INFO ] Computed 48 invariants in 0 ms
[2024-05-26 00:13:28] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 13/116 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/228 variables, 116/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/229 variables, and 173 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1731 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 13/116 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/228 variables, 116/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 88/261 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/229 variables, and 261 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 3270ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3271ms
Starting structural reductions in SI_LTL mode, iteration 1 : 116/198 places, 113/238 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 116 transition count 100
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 90 transition count 100
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 90 transition count 95
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 46 edges and 80 vertex of which 16 / 80 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 72 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 72 transition count 82
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 92 place count 56 transition count 74
Graph (trivial) has 38 edges and 56 vertex of which 16 / 56 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 48 transition count 74
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 101 place count 48 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 117 place count 48 transition count 50
Applied a total of 117 rules in 12 ms. Remains 48 /116 variables (removed 68) and now considering 50/113 (removed 63) transitions.
// Phase 1: matrix 50 rows 48 cols
[2024-05-26 00:13:31] [INFO ] Computed 22 invariants in 0 ms
[2024-05-26 00:13:31] [INFO ] Implicit Places using invariants in 46 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/198 places, 50/238 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3586 ms. Remains : 47/198 places, 50/238 transitions.
Stuttering acceptance computed with spot in 85 ms :[p0, true, p0]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-14 finished in 3707 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)))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 196 transition count 169
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 160 place count 119 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 164 place count 115 transition count 147
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 115 transition count 147
Applied a total of 168 rules in 9 ms. Remains 115 /198 variables (removed 83) and now considering 147/238 (removed 91) transitions.
// Phase 1: matrix 147 rows 115 cols
[2024-05-26 00:13:31] [INFO ] Computed 48 invariants in 2 ms
[2024-05-26 00:13:32] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-26 00:13:32] [INFO ] Invariant cache hit.
[2024-05-26 00:13:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 00:13:32] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-26 00:13:32] [INFO ] Redundant transitions in 63 ms returned [23, 30, 31, 44, 47, 58, 59, 60, 61, 62, 69, 70, 73, 84, 99, 100, 102, 106, 109, 110, 111, 117, 118, 119, 121, 125, 128, 129, 130, 131, 134, 137, 138, 139, 140, 146]
Found 36 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 36 transitions
Redundant transitions reduction (with SMT) removed 36 transitions.
Running 86 sub problems to find dead transitions.
// Phase 1: matrix 111 rows 115 cols
[2024-05-26 00:13:32] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 00:13:32] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 13/115 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 110/225 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/226 variables, and 172 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 13/115 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 110/225 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 86/258 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/226 variables, and 258 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1483 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 3125ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/198 places, 111/238 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 115 transition count 98
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 89 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 89 transition count 93
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 46 edges and 79 vertex of which 16 / 79 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 71 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 71 transition count 80
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 95 place count 53 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 52 transition count 70
Graph (trivial) has 37 edges and 52 vertex of which 16 / 52 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 44 transition count 70
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 106 place count 44 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 123 place count 44 transition count 45
Applied a total of 123 rules in 14 ms. Remains 44 /115 variables (removed 71) and now considering 45/111 (removed 66) transitions.
// Phase 1: matrix 45 rows 44 cols
[2024-05-26 00:13:35] [INFO ] Computed 21 invariants in 0 ms
[2024-05-26 00:13:35] [INFO ] Implicit Places using invariants in 32 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/198 places, 45/238 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 45
Applied a total of 1 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-26 00:13:35] [INFO ] Computed 20 invariants in 1 ms
[2024-05-26 00:13:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-26 00:13:35] [INFO ] Invariant cache hit.
[2024-05-26 00:13:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 00:13:35] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 43/198 places, 45/238 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3714 ms. Remains : 43/198 places, 45/238 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-15 finished in 3807 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(X(F(p0)))))'
Found a Shortening insensitive property : NoC3x3-PT-2A-LTLCardinality-11
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 196 transition count 169
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 161 place count 119 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 165 place count 115 transition count 146
Iterating global reduction 2 with 4 rules applied. Total rules applied 169 place count 115 transition count 146
Applied a total of 169 rules in 21 ms. Remains 115 /198 variables (removed 83) and now considering 146/238 (removed 92) transitions.
// Phase 1: matrix 146 rows 115 cols
[2024-05-26 00:13:36] [INFO ] Computed 48 invariants in 0 ms
[2024-05-26 00:13:36] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-26 00:13:36] [INFO ] Invariant cache hit.
[2024-05-26 00:13:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 00:13:36] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-26 00:13:36] [INFO ] Invariant cache hit.
[2024-05-26 00:13:36] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 145/260 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 0/260 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/261 variables, and 172 constraints, problems are : Problem set: 0 solved, 121 unsolved in 1686 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 145/260 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 121/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/261 variables, and 293 constraints, problems are : Problem set: 0 solved, 121 unsolved in 1962 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 3676ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 3677ms
Starting structural reductions in LI_LTL mode, iteration 1 : 115/198 places, 146/238 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3889 ms. Remains : 115/198 places, 146/238 transitions.
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 238 ms.
Product exploration explored 100000 steps with 25000 reset in 256 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 575 steps (0 resets) in 11 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2024-05-26 00:13:41] [INFO ] Invariant cache hit.
[2024-05-26 00:13:41] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-26 00:13:41] [INFO ] Invariant cache hit.
[2024-05-26 00:13:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 00:13:41] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-26 00:13:41] [INFO ] Invariant cache hit.
[2024-05-26 00:13:41] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 145/260 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 0/260 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/261 variables, and 172 constraints, problems are : Problem set: 0 solved, 121 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 145/260 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 121/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/261 variables, and 293 constraints, problems are : Problem set: 0 solved, 121 unsolved in 1934 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 3568ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 3569ms
Finished structural reductions in LTL mode , in 1 iterations and 3717 ms. Remains : 115/115 places, 146/146 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1370 steps (0 resets) in 20 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 51175 steps with 12793 reset in 117 ms.
Treatment of property NoC3x3-PT-2A-LTLCardinality-11 finished in 9942 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-26 00:13:45] [INFO ] Flatten gal took : 13 ms
[2024-05-26 00:13:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-26 00:13:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 238 transitions and 788 arcs took 5 ms.
Total runtime 189481 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NoC3x3-PT-2A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 198
TRANSITIONS: 238
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.003s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1410
MODEL NAME: /home/mcc/execution/412/model
198 places, 238 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA NoC3x3-PT-2A-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716682426854

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-2A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is NoC3x3-PT-2A, 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 r245-tall-171654350200571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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