Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K 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.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 07:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 07:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 3.0M 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-8B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716714682144

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 09:11:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 09:11:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 09:11:23] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2024-05-26 09:11:23] [INFO ] Transformed 9140 places.
[2024-05-26 09:11:23] [INFO ] Transformed 14577 transitions.
[2024-05-26 09:11:23] [INFO ] Found NUPN structural information;
[2024-05-26 09:11:23] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 537 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-8B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 9140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 9107 transition count 14577
Discarding 5500 places :
Symmetric choice reduction at 1 with 5500 rule applications. Total rules 5533 place count 3607 transition count 9077
Iterating global reduction 1 with 5500 rules applied. Total rules applied 11033 place count 3607 transition count 9077
Ensure Unique test removed 3050 transitions
Reduce isomorphic transitions removed 3050 transitions.
Iterating post reduction 1 with 3050 rules applied. Total rules applied 14083 place count 3607 transition count 6027
Discarding 2000 places :
Symmetric choice reduction at 2 with 2000 rule applications. Total rules 16083 place count 1607 transition count 4027
Iterating global reduction 2 with 2000 rules applied. Total rules applied 18083 place count 1607 transition count 4027
Ensure Unique test removed 1871 transitions
Reduce isomorphic transitions removed 1871 transitions.
Iterating post reduction 2 with 1871 rules applied. Total rules applied 19954 place count 1607 transition count 2156
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 20020 place count 1541 transition count 2090
Iterating global reduction 3 with 66 rules applied. Total rules applied 20086 place count 1541 transition count 2090
Applied a total of 20086 rules in 1542 ms. Remains 1541 /9140 variables (removed 7599) and now considering 2090/14577 (removed 12487) transitions.
// Phase 1: matrix 2090 rows 1541 cols
[2024-05-26 09:11:25] [INFO ] Computed 66 invariants in 33 ms
[2024-05-26 09:11:26] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-26 09:11:26] [INFO ] Invariant cache hit.
[2024-05-26 09:11:27] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
Running 2089 sub problems to find dead transitions.
[2024-05-26 09:11:27] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/3631 variables, and 0 constraints, problems are : Problem set: 0 solved, 2089 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1541 constraints, PredecessorRefiner: 2089/2089 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2089 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1540/3631 variables, and 0 constraints, problems are : Problem set: 0 solved, 2089 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1541 constraints, PredecessorRefiner: 0/2089 constraints, Known Traps: 0/0 constraints]
After SMT, in 60943ms problems are : Problem set: 0 solved, 2089 unsolved
Search for dead transitions found 0 dead transitions in 60996ms
Starting structural reductions in LTL mode, iteration 1 : 1541/9140 places, 2090/14577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64494 ms. Remains : 1541/9140 places, 2090/14577 transitions.
Support contains 29 out of 1541 places after structural reductions.
[2024-05-26 09:12:29] [INFO ] Flatten gal took : 135 ms
[2024-05-26 09:12:29] [INFO ] Flatten gal took : 85 ms
[2024-05-26 09:12:29] [INFO ] Input system was already deterministic with 2090 transitions.
Support contains 28 out of 1541 places (down from 29) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (17 resets) in 2038 ms. (19 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
[2024-05-26 09:12:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1403/1474 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1474 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2056/3530 variables, 1474/1540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 09:12:30] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/3530 variables, 1/1541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3530 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 101/3631 variables, 67/1608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3631 variables, 0/1608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3631 variables, 0/1608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3631/3631 variables, and 1608 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1541/1541 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1403/1474 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1474 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 09:12:31] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1474 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1474 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2056/3530 variables, 1474/1542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3530 variables, 1/1543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3530 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 101/3631 variables, 67/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3631 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3631 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3631/3631 variables, and 1610 constraints, problems are : Problem set: 0 solved, 1 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1541/1541 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2161ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 331 ms.
Support contains 1 out of 1541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1348 edges and 1541 vertex of which 486 / 1541 are part of one of the 33 SCC in 5 ms
Free SCC test removed 453 places
Drop transitions (Empty/Sink Transition effects.) removed 520 transitions
Reduce isomorphic transitions removed 520 transitions.
Graph (complete) has 2655 edges and 1088 vertex of which 1087 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 1087 transition count 1315
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 232 rules applied. Total rules applied 489 place count 880 transition count 1290
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 22 rules applied. Total rules applied 511 place count 870 transition count 1278
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 517 place count 864 transition count 1278
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 95 Pre rules applied. Total rules applied 517 place count 864 transition count 1183
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 707 place count 769 transition count 1183
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 803 place count 673 transition count 995
Iterating global reduction 4 with 96 rules applied. Total rules applied 899 place count 673 transition count 995
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 969 place count 673 transition count 925
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 226
Deduced a syphon composed of 226 places in 0 ms
Reduce places removed 226 places and 0 transitions.
Iterating global reduction 5 with 452 rules applied. Total rules applied 1421 place count 447 transition count 699
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1469 place count 447 transition count 651
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1475 place count 444 transition count 692
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1476 place count 444 transition count 691
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1484 place count 444 transition count 683
Free-agglomeration rule applied 206 times.
Iterating global reduction 7 with 206 rules applied. Total rules applied 1690 place count 444 transition count 477
Reduce places removed 206 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 785 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 220 rules applied. Total rules applied 1910 place count 231 transition count 464
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1917 place count 231 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 169 transitions
Redundant transition composition rules discarded 169 transitions
Iterating global reduction 9 with 169 rules applied. Total rules applied 2086 place count 231 transition count 288
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 601 edges and 223 vertex of which 200 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 9 rules applied. Total rules applied 2095 place count 200 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 2118 place count 200 transition count 265
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 11 with 25 rules applied. Total rules applied 2143 place count 200 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2144 place count 200 transition count 264
Applied a total of 2144 rules in 274 ms. Remains 200 /1541 variables (removed 1341) and now considering 264/2090 (removed 1826) transitions.
Running 255 sub problems to find dead transitions.
// Phase 1: matrix 264 rows 200 cols
[2024-05-26 09:12:32] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 09:12:32] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Problem TDEAD245 is UNSAT
At refinement iteration 3 (OVERLAPS) 264/464 variables, 200/258 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 192/450 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 450 constraints, problems are : Problem set: 1 solved, 254 unsolved in 10120 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 200/200 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 264/464 variables, 200/258 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 192/450 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 254/704 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/704 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/704 constraints. Problems are: Problem set: 1 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 704 constraints, problems are : Problem set: 1 solved, 254 unsolved in 11017 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 200/200 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 254/255 constraints, Known Traps: 0/0 constraints]
After SMT, in 21249ms problems are : Problem set: 1 solved, 254 unsolved
Search for dead transitions found 1 dead transitions in 21253ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 200/1541 places, 263/2090 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21543 ms. Remains : 200/1541 places, 263/2090 transitions.
RANDOM walk for 495 steps (0 resets) in 9 ms. (49 steps per ms) remains 0/1 properties
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3230 edges and 1541 vertex of which 1540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.41 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1346 edges and 1541 vertex of which 486 / 1541 are part of one of the 33 SCC in 3 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2688 edges and 1088 vertex of which 1087 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 1086 transition count 1349
Reduce places removed 205 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 229 rules applied. Total rules applied 484 place count 881 transition count 1325
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
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 2 with 21 rules applied. Total rules applied 505 place count 871 transition count 1314
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 510 place count 866 transition count 1314
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 510 place count 866 transition count 1218
Deduced a syphon composed of 96 places in 7 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 702 place count 770 transition count 1218
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 798 place count 674 transition count 1030
Iterating global reduction 4 with 96 rules applied. Total rules applied 894 place count 674 transition count 1030
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 964 place count 674 transition count 960
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1412 place count 450 transition count 736
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1460 place count 450 transition count 688
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1461 place count 450 transition count 687
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1462 place count 450 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1464 place count 448 transition count 685
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1497 place count 439 transition count 661
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1545 place count 415 transition count 637
Applied a total of 1545 rules in 162 ms. Remains 415 /1541 variables (removed 1126) and now considering 637/2090 (removed 1453) transitions.
[2024-05-26 09:12:54] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
// Phase 1: matrix 605 rows 415 cols
[2024-05-26 09:12:54] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 09:12:54] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-26 09:12:54] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 09:12:54] [INFO ] Invariant cache hit.
[2024-05-26 09:12:55] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 09:12:55] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-05-26 09:12:55] [INFO ] Redundant transitions in 35 ms returned []
Running 595 sub problems to find dead transitions.
[2024-05-26 09:12:55] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 09:12:55] [INFO ] Invariant cache hit.
[2024-05-26 09:12:55] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (OVERLAPS) 9/415 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (OVERLAPS) 604/1019 variables, 415/472 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 28/500 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1019/1020 variables, and 500 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 415/415 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (OVERLAPS) 9/415 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (OVERLAPS) 604/1019 variables, 415/472 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 28/500 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 595/1095 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1019 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1019/1020 variables, and 1095 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 415/415 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in SI_LTL mode, iteration 1 : 415/1541 places, 637/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60969 ms. Remains : 415/1541 places, 637/2090 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-00 finished in 61242 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(p0)||G(F(p1))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1344 edges and 1541 vertex of which 486 / 1541 are part of one of the 33 SCC in 2 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2688 edges and 1088 vertex of which 1087 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 1086 transition count 1350
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 226 rules applied. Total rules applied 480 place count 882 transition count 1328
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
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 2 with 18 rules applied. Total rules applied 498 place count 873 transition count 1319
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 502 place count 869 transition count 1319
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 502 place count 869 transition count 1222
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 696 place count 772 transition count 1222
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 792 place count 676 transition count 1034
Iterating global reduction 4 with 96 rules applied. Total rules applied 888 place count 676 transition count 1034
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 958 place count 676 transition count 964
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1406 place count 452 transition count 740
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1454 place count 452 transition count 692
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1456 place count 452 transition count 690
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1458 place count 452 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1460 place count 450 transition count 688
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1493 place count 441 transition count 664
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1541 place count 417 transition count 640
Applied a total of 1541 rules in 126 ms. Remains 417 /1541 variables (removed 1124) and now considering 640/2090 (removed 1450) transitions.
[2024-05-26 09:13:55] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
// Phase 1: matrix 608 rows 417 cols
[2024-05-26 09:13:55] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 09:13:56] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-26 09:13:56] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
[2024-05-26 09:13:56] [INFO ] Invariant cache hit.
[2024-05-26 09:13:56] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 09:13:56] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-05-26 09:13:56] [INFO ] Redundant transitions in 5 ms returned []
Running 598 sub problems to find dead transitions.
[2024-05-26 09:13:56] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
[2024-05-26 09:13:56] [INFO ] Invariant cache hit.
[2024-05-26 09:13:56] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (OVERLAPS) 9/417 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 607/1024 variables, 417/474 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 28/502 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1024 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1025 variables, and 502 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 417/417 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (OVERLAPS) 9/417 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 607/1024 variables, 417/474 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 28/502 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1024 variables, 598/1100 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1025 variables, and 1100 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 417/417 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in SI_LTL mode, iteration 1 : 417/1541 places, 640/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60936 ms. Remains : 417/1541 places, 640/2090 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-01
Stuttering criterion allowed to conclude after 1027 steps with 5 reset in 13 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-01 finished in 61106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1||G(!p0))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1523 transition count 2072
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1523 transition count 2072
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 1523 transition count 2056
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 1513 transition count 2046
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 1513 transition count 2046
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 82 place count 1513 transition count 2036
Applied a total of 82 rules in 148 ms. Remains 1513 /1541 variables (removed 28) and now considering 2036/2090 (removed 54) transitions.
// Phase 1: matrix 2036 rows 1513 cols
[2024-05-26 09:14:56] [INFO ] Computed 66 invariants in 16 ms
[2024-05-26 09:14:57] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-26 09:14:57] [INFO ] Invariant cache hit.
[2024-05-26 09:14:58] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
Running 2035 sub problems to find dead transitions.
[2024-05-26 09:14:58] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3549 variables, and 0 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 2035/2035 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2035 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3549 variables, and 0 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/2035 constraints, Known Traps: 0/0 constraints]
After SMT, in 60562ms problems are : Problem set: 0 solved, 2035 unsolved
Search for dead transitions found 0 dead transitions in 60579ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1541 places, 2036/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62254 ms. Remains : 1513/1541 places, 2036/2090 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2309 steps with 1 reset in 16 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-02 finished in 62512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||(p1&&F(!p0)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1346 edges and 1541 vertex of which 486 / 1541 are part of one of the 33 SCC in 2 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2688 edges and 1088 vertex of which 1087 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 1086 transition count 1348
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 229 rules applied. Total rules applied 485 place count 880 transition count 1325
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 21 rules applied. Total rules applied 506 place count 871 transition count 1313
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 512 place count 865 transition count 1313
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 512 place count 865 transition count 1217
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 704 place count 769 transition count 1217
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 800 place count 673 transition count 1029
Iterating global reduction 4 with 96 rules applied. Total rules applied 896 place count 673 transition count 1029
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 966 place count 673 transition count 959
Performed 223 Post agglomeration using F-continuation condition.Transition count delta: 223
Deduced a syphon composed of 223 places in 0 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 5 with 446 rules applied. Total rules applied 1412 place count 450 transition count 736
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1460 place count 450 transition count 688
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1461 place count 450 transition count 687
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1463 place count 450 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1465 place count 448 transition count 685
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1498 place count 439 transition count 661
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1546 place count 415 transition count 637
Applied a total of 1546 rules in 142 ms. Remains 415 /1541 variables (removed 1126) and now considering 637/2090 (removed 1453) transitions.
[2024-05-26 09:15:59] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
// Phase 1: matrix 605 rows 415 cols
[2024-05-26 09:15:59] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 09:15:59] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-26 09:15:59] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 09:15:59] [INFO ] Invariant cache hit.
[2024-05-26 09:15:59] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 09:16:00] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-26 09:16:00] [INFO ] Redundant transitions in 5 ms returned []
Running 595 sub problems to find dead transitions.
[2024-05-26 09:16:00] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 09:16:00] [INFO ] Invariant cache hit.
[2024-05-26 09:16:00] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (OVERLAPS) 9/415 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (OVERLAPS) 604/1019 variables, 415/472 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 28/500 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1019/1020 variables, and 500 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 415/415 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (OVERLAPS) 9/415 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (OVERLAPS) 604/1019 variables, 415/472 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 28/500 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 595/1095 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1019 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1019/1020 variables, and 1095 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 415/415 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 415/1541 places, 637/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60910 ms. Remains : 415/1541 places, 637/2090 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, p0, (NOT p0), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-03 finished in 61129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1522 transition count 2071
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1522 transition count 2071
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 1522 transition count 2054
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 1511 transition count 2043
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 1511 transition count 2043
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 1511 transition count 2032
Applied a total of 88 rules in 147 ms. Remains 1511 /1541 variables (removed 30) and now considering 2032/2090 (removed 58) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2024-05-26 09:17:00] [INFO ] Computed 66 invariants in 14 ms
[2024-05-26 09:17:00] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-26 09:17:00] [INFO ] Invariant cache hit.
[2024-05-26 09:17:02] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
Running 2031 sub problems to find dead transitions.
[2024-05-26 09:17:02] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 2031/2031 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2031 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)timeout

(s76 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/2031 constraints, Known Traps: 0/0 constraints]
After SMT, in 60553ms problems are : Problem set: 0 solved, 2031 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 2032/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62229 ms. Remains : 1511/1541 places, 2032/2090 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-04 finished in 62529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1521 transition count 2070
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1521 transition count 2070
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 58 place count 1521 transition count 2052
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 1510 transition count 2041
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 1510 transition count 2041
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 91 place count 1510 transition count 2030
Applied a total of 91 rules in 152 ms. Remains 1510 /1541 variables (removed 31) and now considering 2030/2090 (removed 60) transitions.
// Phase 1: matrix 2030 rows 1510 cols
[2024-05-26 09:18:03] [INFO ] Computed 66 invariants in 14 ms
[2024-05-26 09:18:03] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-26 09:18:03] [INFO ] Invariant cache hit.
[2024-05-26 09:18:04] [INFO ] Implicit Places using invariants and state equation in 1159 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
Running 2029 sub problems to find dead transitions.
[2024-05-26 09:18:04] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3540 variables, and 0 constraints, problems are : Problem set: 0 solved, 2029 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 2029/2029 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2029 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 timeout
1)
(s285 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3540 variables, and 0 constraints, problems are : Problem set: 0 solved, 2029 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/2029 constraints, Known Traps: 0/0 constraints]
After SMT, in 60596ms problems are : Problem set: 0 solved, 2029 unsolved
Search for dead transitions found 0 dead transitions in 60613ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1541 places, 2030/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62320 ms. Remains : 1510/1541 places, 2030/2090 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 7810 steps with 2 reset in 38 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-06 finished in 62532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(p1))))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1522 transition count 2071
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1522 transition count 2071
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 1522 transition count 2054
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 1511 transition count 2043
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 1511 transition count 2043
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 1511 transition count 2032
Applied a total of 88 rules in 148 ms. Remains 1511 /1541 variables (removed 30) and now considering 2032/2090 (removed 58) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2024-05-26 09:19:05] [INFO ] Computed 66 invariants in 16 ms
[2024-05-26 09:19:06] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-26 09:19:06] [INFO ] Invariant cache hit.
[2024-05-26 09:19:07] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
Running 2031 sub problems to find dead transitions.
[2024-05-26 09:19:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 2031/2031 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2031 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/2031 constraints, Known Traps: 0/0 constraints]
After SMT, in 60590ms problems are : Problem set: 0 solved, 2031 unsolved
Search for dead transitions found 0 dead transitions in 60609ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 2032/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62283 ms. Remains : 1511/1541 places, 2032/2090 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-09
Stuttering criterion allowed to conclude after 2669 steps with 0 reset in 10 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-09 finished in 62482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(p1&&G(F(p2))))))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1522 transition count 2071
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1522 transition count 2071
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 1522 transition count 2054
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 1511 transition count 2043
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 1511 transition count 2043
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 1511 transition count 2032
Applied a total of 88 rules in 144 ms. Remains 1511 /1541 variables (removed 30) and now considering 2032/2090 (removed 58) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2024-05-26 09:20:08] [INFO ] Computed 66 invariants in 15 ms
[2024-05-26 09:20:08] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-26 09:20:08] [INFO ] Invariant cache hit.
[2024-05-26 09:20:09] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
Running 2031 sub problems to find dead transitions.
[2024-05-26 09:20:09] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 2031/2031 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2031 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/2031 constraints, Known Traps: 0/0 constraints]
After SMT, in 60528ms problems are : Problem set: 0 solved, 2031 unsolved
Search for dead transitions found 0 dead transitions in 60544ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 2032/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62140 ms. Remains : 1511/1541 places, 2032/2090 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 378 ms.
Product exploration explored 100000 steps with 33333 reset in 433 ms.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3172 edges and 1511 vertex of which 1510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 198 stabilizing places and 316 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-8B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8B-LTLFireability-10 finished in 63339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1522 transition count 2071
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1522 transition count 2071
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 1522 transition count 2054
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 1511 transition count 2043
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 1511 transition count 2043
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 1511 transition count 2032
Applied a total of 88 rules in 147 ms. Remains 1511 /1541 variables (removed 30) and now considering 2032/2090 (removed 58) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2024-05-26 09:21:11] [INFO ] Computed 66 invariants in 19 ms
[2024-05-26 09:21:11] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-26 09:21:11] [INFO ] Invariant cache hit.
[2024-05-26 09:21:13] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
Running 2031 sub problems to find dead transitions.
[2024-05-26 09:21:13] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 2031/2031 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2031 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/2031 constraints, Known Traps: 0/0 constraints]
After SMT, in 60597ms problems are : Problem set: 0 solved, 2031 unsolved
Search for dead transitions found 0 dead transitions in 60618ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 2032/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62357 ms. Remains : 1511/1541 places, 2032/2090 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-11
Stuttering criterion allowed to conclude after 2924 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-11 finished in 62480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1)||(F(p0)&&(p2 U p3)))))'
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1524 transition count 2073
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1524 transition count 2073
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 49 place count 1524 transition count 2058
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 1515 transition count 2049
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 1515 transition count 2049
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 1515 transition count 2040
Applied a total of 76 rules in 144 ms. Remains 1515 /1541 variables (removed 26) and now considering 2040/2090 (removed 50) transitions.
// Phase 1: matrix 2040 rows 1515 cols
[2024-05-26 09:22:13] [INFO ] Computed 66 invariants in 16 ms
[2024-05-26 09:22:14] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-26 09:22:14] [INFO ] Invariant cache hit.
[2024-05-26 09:22:15] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
Running 2039 sub problems to find dead transitions.
[2024-05-26 09:22:15] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3555 variables, and 0 constraints, problems are : Problem set: 0 solved, 2039 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 2039/2039 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3555 variables, and 0 constraints, problems are : Problem set: 0 solved, 2039 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/2039 constraints, Known Traps: 0/0 constraints]
After SMT, in 60560ms problems are : Problem set: 0 solved, 2039 unsolved
Search for dead transitions found 0 dead transitions in 60577ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1541 places, 2040/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62385 ms. Remains : 1515/1541 places, 2040/2090 transitions.
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), true, (NOT p0), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-12
Stuttering criterion allowed to conclude after 2684 steps with 0 reset in 12 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-12 finished in 62743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((F(p2)&&F(p3)&&p1))))))'
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1523 transition count 2072
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1523 transition count 2072
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 1523 transition count 2056
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 1512 transition count 2045
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 1512 transition count 2045
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 85 place count 1512 transition count 2034
Applied a total of 85 rules in 152 ms. Remains 1512 /1541 variables (removed 29) and now considering 2034/2090 (removed 56) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2024-05-26 09:23:16] [INFO ] Computed 66 invariants in 13 ms
[2024-05-26 09:23:17] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-26 09:23:17] [INFO ] Invariant cache hit.
[2024-05-26 09:23:18] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
Running 2033 sub problems to find dead transitions.
[2024-05-26 09:23:18] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2033/2033 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2033 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2033 constraints, Known Traps: 0/0 constraints]
After SMT, in 60546ms problems are : Problem set: 0 solved, 2033 unsolved
Search for dead transitions found 0 dead transitions in 60565ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1541 places, 2034/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62333 ms. Remains : 1512/1541 places, 2034/2090 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-13
Stuttering criterion allowed to conclude after 2524 steps with 0 reset in 14 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-13 finished in 62594 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 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1346 edges and 1541 vertex of which 472 / 1541 are part of one of the 33 SCC in 2 ms
Free SCC test removed 439 places
Ensure Unique test removed 468 transitions
Reduce isomorphic transitions removed 468 transitions.
Graph (complete) has 2714 edges and 1102 vertex of which 1101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 263 rules applied. Total rules applied 265 place count 1100 transition count 1357
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 242 rules applied. Total rules applied 507 place count 885 transition count 1330
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 25 rules applied. Total rules applied 532 place count 874 transition count 1316
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 539 place count 867 transition count 1316
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 95 Pre rules applied. Total rules applied 539 place count 867 transition count 1221
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 729 place count 772 transition count 1221
Discarding 92 places :
Symmetric choice reduction at 4 with 92 rule applications. Total rules 821 place count 680 transition count 1041
Iterating global reduction 4 with 92 rules applied. Total rules applied 913 place count 680 transition count 1041
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 4 with 66 rules applied. Total rules applied 979 place count 680 transition count 975
Performed 227 Post agglomeration using F-continuation condition.Transition count delta: 227
Deduced a syphon composed of 227 places in 0 ms
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 5 with 454 rules applied. Total rules applied 1433 place count 453 transition count 748
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 5 with 50 rules applied. Total rules applied 1483 place count 453 transition count 698
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1485 place count 451 transition count 696
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1518 place count 442 transition count 672
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1566 place count 418 transition count 648
Applied a total of 1566 rules in 97 ms. Remains 418 /1541 variables (removed 1123) and now considering 648/2090 (removed 1442) transitions.
[2024-05-26 09:24:19] [INFO ] Flow matrix only has 616 transitions (discarded 32 similar events)
// Phase 1: matrix 616 rows 418 cols
[2024-05-26 09:24:19] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 09:24:19] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-26 09:24:19] [INFO ] Flow matrix only has 616 transitions (discarded 32 similar events)
[2024-05-26 09:24:19] [INFO ] Invariant cache hit.
[2024-05-26 09:24:19] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 09:24:19] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-26 09:24:19] [INFO ] Redundant transitions in 4 ms returned []
Running 610 sub problems to find dead transitions.
[2024-05-26 09:24:19] [INFO ] Flow matrix only has 616 transitions (discarded 32 similar events)
[2024-05-26 09:24:19] [INFO ] Invariant cache hit.
[2024-05-26 09:24:19] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 9/418 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (OVERLAPS) 615/1033 variables, 418/475 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1033 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1033/1034 variables, and 503 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 418/418 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 9/418 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (OVERLAPS) 615/1033 variables, 418/475 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1033 variables, 610/1113 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1033 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1033/1034 variables, and 1113 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 418/418 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 418/1541 places, 648/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60868 ms. Remains : 418/1541 places, 648/2090 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-14 finished in 60979 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)||G(p1))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 2090/2090 transitions.
Graph (trivial) has 1346 edges and 1541 vertex of which 486 / 1541 are part of one of the 33 SCC in 3 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2688 edges and 1088 vertex of which 1087 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 1086 transition count 1348
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 229 rules applied. Total rules applied 485 place count 880 transition count 1325
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 21 rules applied. Total rules applied 506 place count 871 transition count 1313
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 512 place count 865 transition count 1313
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 512 place count 865 transition count 1217
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 704 place count 769 transition count 1217
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 800 place count 673 transition count 1029
Iterating global reduction 4 with 96 rules applied. Total rules applied 896 place count 673 transition count 1029
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 966 place count 673 transition count 959
Performed 223 Post agglomeration using F-continuation condition.Transition count delta: 223
Deduced a syphon composed of 223 places in 0 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 5 with 446 rules applied. Total rules applied 1412 place count 450 transition count 736
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1460 place count 450 transition count 688
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1461 place count 450 transition count 687
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1463 place count 450 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1465 place count 448 transition count 685
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1498 place count 439 transition count 661
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1546 place count 415 transition count 637
Applied a total of 1546 rules in 99 ms. Remains 415 /1541 variables (removed 1126) and now considering 637/2090 (removed 1453) transitions.
[2024-05-26 09:25:20] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
// Phase 1: matrix 605 rows 415 cols
[2024-05-26 09:25:20] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 09:25:20] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-26 09:25:20] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 09:25:20] [INFO ] Invariant cache hit.
[2024-05-26 09:25:20] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 09:25:20] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-26 09:25:20] [INFO ] Redundant transitions in 4 ms returned []
Running 595 sub problems to find dead transitions.
[2024-05-26 09:25:20] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 09:25:20] [INFO ] Invariant cache hit.
[2024-05-26 09:25:20] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (OVERLAPS) 9/415 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (OVERLAPS) 604/1019 variables, 415/472 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 28/500 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1019/1020 variables, and 500 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 415/415 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (OVERLAPS) 9/415 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (OVERLAPS) 604/1019 variables, 415/472 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 28/500 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 595/1095 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1019 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1019/1020 variables, and 1095 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 415/415 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 415/1541 places, 637/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60861 ms. Remains : 415/1541 places, 637/2090 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-15 finished in 60920 ms.
All properties solved by simple procedures.
Total runtime 897719 ms.

BK_STOP 1716715581091

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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