fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r245-tall-171654350400675
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for NoC3x3-PT-8B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1049.983 596182.00 750045.00 1671.10 FFTFFFFTFFFTFFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
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-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-8B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716700743129

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 05:19:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 05:19:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:19:04] [INFO ] Load time of PNML (sax parser for PT used): 388 ms
[2024-05-26 05:19:04] [INFO ] Transformed 9140 places.
[2024-05-26 05:19:04] [INFO ] Transformed 14577 transitions.
[2024-05-26 05:19:04] [INFO ] Found NUPN structural information;
[2024-05-26 05:19:04] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 608 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA NoC3x3-PT-8B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 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 5490 places :
Symmetric choice reduction at 1 with 5490 rule applications. Total rules 5523 place count 3617 transition count 9087
Iterating global reduction 1 with 5490 rules applied. Total rules applied 11013 place count 3617 transition count 9087
Ensure Unique test removed 3038 transitions
Reduce isomorphic transitions removed 3038 transitions.
Iterating post reduction 1 with 3038 rules applied. Total rules applied 14051 place count 3617 transition count 6049
Discarding 1990 places :
Symmetric choice reduction at 2 with 1990 rule applications. Total rules 16041 place count 1627 transition count 4059
Iterating global reduction 2 with 1990 rules applied. Total rules applied 18031 place count 1627 transition count 4059
Ensure Unique test removed 1861 transitions
Reduce isomorphic transitions removed 1861 transitions.
Iterating post reduction 2 with 1861 rules applied. Total rules applied 19892 place count 1627 transition count 2198
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 19958 place count 1561 transition count 2132
Iterating global reduction 3 with 66 rules applied. Total rules applied 20024 place count 1561 transition count 2132
Applied a total of 20024 rules in 1436 ms. Remains 1561 /9140 variables (removed 7579) and now considering 2132/14577 (removed 12445) transitions.
// Phase 1: matrix 2132 rows 1561 cols
[2024-05-26 05:19:06] [INFO ] Computed 66 invariants in 36 ms
[2024-05-26 05:19:07] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-05-26 05:19:07] [INFO ] Invariant cache hit.
[2024-05-26 05:19:08] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
Running 2131 sub problems to find dead transitions.
[2024-05-26 05:19:08] [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 1560/3693 variables, and 0 constraints, problems are : Problem set: 0 solved, 2131 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 2131/2131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3693 variables, and 0 constraints, problems are : Problem set: 0 solved, 2131 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/2131 constraints, Known Traps: 0/0 constraints]
After SMT, in 60896ms problems are : Problem set: 0 solved, 2131 unsolved
Search for dead transitions found 0 dead transitions in 60934ms
Starting structural reductions in LTL mode, iteration 1 : 1561/9140 places, 2132/14577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64448 ms. Remains : 1561/9140 places, 2132/14577 transitions.
Support contains 33 out of 1561 places after structural reductions.
[2024-05-26 05:20:10] [INFO ] Flatten gal took : 159 ms
[2024-05-26 05:20:10] [INFO ] Flatten gal took : 100 ms
[2024-05-26 05:20:10] [INFO ] Input system was already deterministic with 2132 transitions.
Support contains 32 out of 1561 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 2080 ms. (19 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
[2024-05-26 05:20:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 208/214 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1494 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1494 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2098/3592 variables, 1494/1560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3592 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 101/3693 variables, 67/1627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3693 variables, 0/1627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3693 variables, 0/1627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3693/3693 variables, and 1627 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1561/1561 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 208/214 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1494 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 05:20:12] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 16 ms to minimize.
[2024-05-26 05:20:12] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1494 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1494 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2098/3592 variables, 1494/1562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3592 variables, 2/1564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 05:20:13] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 5 ms to minimize.
[2024-05-26 05:20:14] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3592 variables, 2/1566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3592 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 101/3693 variables, 67/1633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3693 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3693 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3693/3693 variables, and 1633 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2402 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1561/1561 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 3470ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1305 ms.
Support contains 6 out of 1561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1561/1561 places, 2132/2132 transitions.
Graph (trivial) has 1380 edges and 1561 vertex of which 494 / 1561 are part of one of the 33 SCC in 7 ms
Free SCC test removed 461 places
Drop transitions (Empty/Sink Transition effects.) removed 536 transitions
Reduce isomorphic transitions removed 536 transitions.
Graph (complete) has 2682 edges and 1100 vertex of which 1099 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 250 rules applied. Total rules applied 252 place count 1099 transition count 1346
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 235 rules applied. Total rules applied 487 place count 897 transition count 1313
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 35 rules applied. Total rules applied 522 place count 881 transition count 1294
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 530 place count 873 transition count 1294
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 530 place count 873 transition count 1198
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 722 place count 777 transition count 1198
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 818 place count 681 transition count 1012
Iterating global reduction 4 with 96 rules applied. Total rules applied 914 place count 681 transition count 1012
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 985 place count 681 transition count 941
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 225
Deduced a syphon composed of 225 places in 1 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 5 with 450 rules applied. Total rules applied 1435 place count 456 transition count 716
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1483 place count 456 transition count 668
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1489 place count 453 transition count 709
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 1490 place count 453 transition count 708
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 1502 place count 453 transition count 696
Free-agglomeration rule applied 206 times.
Iterating global reduction 7 with 206 rules applied. Total rules applied 1708 place count 453 transition count 490
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 800 edges and 247 vertex of which 240 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 220 rules applied. Total rules applied 1928 place count 240 transition count 477
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 1935 place count 240 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 170 transitions
Redundant transition composition rules discarded 170 transitions
Iterating global reduction 9 with 170 rules applied. Total rules applied 2105 place count 240 transition count 300
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 615 edges and 232 vertex of which 209 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 9 rules applied. Total rules applied 2114 place count 209 transition count 300
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 2137 place count 209 transition count 277
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 11 with 23 rules applied. Total rules applied 2160 place count 209 transition count 277
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 2161 place count 209 transition count 276
Applied a total of 2161 rules in 345 ms. Remains 209 /1561 variables (removed 1352) and now considering 276/2132 (removed 1856) transitions.
Running 267 sub problems to find dead transitions.
// Phase 1: matrix 276 rows 209 cols
[2024-05-26 05:20:16] [INFO ] Computed 58 invariants in 4 ms
[2024-05-26 05:20:16] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-26 05:20:18] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-26 05:20:18] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD257 is UNSAT
At refinement iteration 4 (OVERLAPS) 276/485 variables, 209/269 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 190/459 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/459 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/459 constraints. Problems are: Problem set: 1 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 459 constraints, problems are : Problem set: 1 solved, 266 unsolved in 11403 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 209/209 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 276/485 variables, 209/269 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 190/459 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 266/725 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/725 constraints. Problems are: Problem set: 1 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/725 constraints. Problems are: Problem set: 1 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 725 constraints, problems are : Problem set: 1 solved, 266 unsolved in 13673 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 209/209 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 266/267 constraints, Known Traps: 2/2 constraints]
After SMT, in 25205ms problems are : Problem set: 1 solved, 266 unsolved
Search for dead transitions found 1 dead transitions in 25209ms
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 : 209/1561 places, 275/2132 transitions.
Applied a total of 0 rules in 9 ms. Remains 209 /209 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25566 ms. Remains : 209/1561 places, 275/2132 transitions.
RANDOM walk for 2661 steps (0 resets) in 39 ms. (66 steps per ms) remains 0/2 properties
FORMULA NoC3x3-PT-8B-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-8B-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 198 stabilizing places and 317 stable transitions
Graph (complete) has 3273 edges and 1561 vertex of which 1560 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.63 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(F(!p0))))'
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1561/1561 places, 2132/2132 transitions.
Graph (trivial) has 1387 edges and 1561 vertex of which 495 / 1561 are part of one of the 33 SCC in 3 ms
Free SCC test removed 462 places
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Graph (complete) has 2713 edges and 1099 vertex of which 1098 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 1097 transition count 1374
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 241 rules applied. Total rules applied 495 place count 893 transition count 1337
Reduce places removed 18 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 2 with 40 rules applied. Total rules applied 535 place count 875 transition count 1315
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 544 place count 866 transition count 1315
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 544 place count 866 transition count 1219
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 736 place count 770 transition count 1219
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 833 place count 673 transition count 1030
Iterating global reduction 4 with 97 rules applied. Total rules applied 930 place count 673 transition count 1030
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 1001 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 1447 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 1495 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 1496 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 1498 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 1500 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 1533 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 1581 place count 415 transition count 637
Applied a total of 1581 rules in 266 ms. Remains 415 /1561 variables (removed 1146) and now considering 637/2132 (removed 1495) transitions.
[2024-05-26 05:20:42] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
// Phase 1: matrix 605 rows 415 cols
[2024-05-26 05:20:42] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 05:20:42] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-26 05:20:42] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 05:20:42] [INFO ] Invariant cache hit.
[2024-05-26 05:20:42] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 05:20:42] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-26 05:20:43] [INFO ] Redundant transitions in 32 ms returned []
Running 595 sub problems to find dead transitions.
[2024-05-26 05:20:43] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 05:20:43] [INFO ] Invariant cache hit.
[2024-05-26 05:20:43] [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 30016 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 30020 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 60177ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 415/1561 places, 637/2132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61115 ms. Remains : 415/1561 places, 637/2132 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p0), p0, p0]
Running random walk in product with property : NoC3x3-PT-8B-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLCardinality-00 finished in 61470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 1561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1561/1561 places, 2132/2132 transitions.
Graph (trivial) has 1383 edges and 1561 vertex of which 495 / 1561 are part of one of the 33 SCC in 2 ms
Free SCC test removed 462 places
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Graph (complete) has 2713 edges and 1099 vertex of which 1098 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 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 250 rules applied. Total rules applied 252 place count 1097 transition count 1376
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 235 rules applied. Total rules applied 487 place count 895 transition count 1343
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 35 rules applied. Total rules applied 522 place count 879 transition count 1324
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 530 place count 871 transition count 1324
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 530 place count 871 transition count 1227
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 724 place count 774 transition count 1227
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 821 place count 677 transition count 1038
Iterating global reduction 4 with 97 rules applied. Total rules applied 918 place count 677 transition count 1038
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 989 place count 677 transition count 967
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 1435 place count 454 transition count 744
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1483 place count 454 transition count 696
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 1485 place count 454 transition count 694
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1489 place count 454 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1490 place count 454 transition count 693
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1492 place count 452 transition count 691
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 7 with 33 rules applied. Total rules applied 1525 place count 443 transition count 667
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1573 place count 419 transition count 643
Applied a total of 1573 rules in 272 ms. Remains 419 /1561 variables (removed 1142) and now considering 643/2132 (removed 1489) transitions.
[2024-05-26 05:21:43] [INFO ] Flow matrix only has 611 transitions (discarded 32 similar events)
// Phase 1: matrix 611 rows 419 cols
[2024-05-26 05:21:43] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 05:21:44] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-26 05:21:44] [INFO ] Flow matrix only has 611 transitions (discarded 32 similar events)
[2024-05-26 05:21:44] [INFO ] Invariant cache hit.
[2024-05-26 05:21:44] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 05:21:44] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2024-05-26 05:21:44] [INFO ] Redundant transitions in 68 ms returned []
Running 601 sub problems to find dead transitions.
[2024-05-26 05:21:44] [INFO ] Flow matrix only has 611 transitions (discarded 32 similar events)
[2024-05-26 05:21:44] [INFO ] Invariant cache hit.
[2024-05-26 05:21:44] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 9/419 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 610/1029 variables, 419/476 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 28/504 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1029/1030 variables, and 504 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 419/419 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 9/419 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 610/1029 variables, 419/476 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 28/504 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 601/1105 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1029 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/1030 variables, and 1105 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 419/419 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/1561 places, 643/2132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61616 ms. Remains : 419/1561 places, 643/2132 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLCardinality-01 finished in 61702 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)))'
Support contains 4 out of 1561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1561/1561 places, 2132/2132 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1534 transition count 2105
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1534 transition count 2105
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 81 place count 1534 transition count 2078
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 99 place count 1516 transition count 2060
Iterating global reduction 1 with 18 rules applied. Total rules applied 117 place count 1516 transition count 2060
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 135 place count 1516 transition count 2042
Applied a total of 135 rules in 114 ms. Remains 1516 /1561 variables (removed 45) and now considering 2042/2132 (removed 90) transitions.
// Phase 1: matrix 2042 rows 1516 cols
[2024-05-26 05:22:45] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 05:22:45] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-26 05:22:45] [INFO ] Invariant cache hit.
[2024-05-26 05:22:47] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
Running 2041 sub problems to find dead transitions.
[2024-05-26 05:22:47] [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 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/3558 variables, and 0 constraints, problems are : Problem set: 0 solved, 2041 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 2041/2041 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1515/3558 variables, and 0 constraints, problems are : Problem set: 0 solved, 2041 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 0/2041 constraints, Known Traps: 0/0 constraints]
After SMT, in 60565ms problems are : Problem set: 0 solved, 2041 unsolved
Search for dead transitions found 0 dead transitions in 60583ms
Starting structural reductions in LTL mode, iteration 1 : 1516/1561 places, 2042/2132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62588 ms. Remains : 1516/1561 places, 2042/2132 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-8B-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 583 ms.
Product exploration explored 100000 steps with 50000 reset in 491 ms.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3182 edges and 1516 vertex of which 1515 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 p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 66 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-8B-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8B-LTLCardinality-07 finished in 63915 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 4 out of 1561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1561/1561 places, 2132/2132 transitions.
Graph (trivial) has 1383 edges and 1561 vertex of which 495 / 1561 are part of one of the 33 SCC in 10 ms
Free SCC test removed 462 places
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Graph (complete) has 2713 edges and 1099 vertex of which 1098 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 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 250 rules applied. Total rules applied 252 place count 1097 transition count 1376
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 236 rules applied. Total rules applied 488 place count 895 transition count 1342
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 34 rules applied. Total rules applied 522 place count 878 transition count 1325
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 528 place count 872 transition count 1325
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 98 Pre rules applied. Total rules applied 528 place count 872 transition count 1227
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 724 place count 774 transition count 1227
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 821 place count 677 transition count 1038
Iterating global reduction 4 with 97 rules applied. Total rules applied 918 place count 677 transition count 1038
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 989 place count 677 transition count 967
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 1435 place count 454 transition count 744
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1483 place count 454 transition count 696
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1486 place count 454 transition count 693
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1490 place count 454 transition count 693
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1492 place count 452 transition count 691
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 1525 place count 443 transition count 667
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 1573 place count 419 transition count 643
Applied a total of 1573 rules in 169 ms. Remains 419 /1561 variables (removed 1142) and now considering 643/2132 (removed 1489) transitions.
[2024-05-26 05:23:49] [INFO ] Flow matrix only has 611 transitions (discarded 32 similar events)
// Phase 1: matrix 611 rows 419 cols
[2024-05-26 05:23:49] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 05:23:49] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-26 05:23:49] [INFO ] Flow matrix only has 611 transitions (discarded 32 similar events)
[2024-05-26 05:23:49] [INFO ] Invariant cache hit.
[2024-05-26 05:23:49] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 05:23:50] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2024-05-26 05:23:50] [INFO ] Redundant transitions in 3 ms returned []
Running 601 sub problems to find dead transitions.
[2024-05-26 05:23:50] [INFO ] Flow matrix only has 611 transitions (discarded 32 similar events)
[2024-05-26 05:23:50] [INFO ] Invariant cache hit.
[2024-05-26 05:23:50] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 9/419 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 610/1029 variables, 419/476 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 28/504 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1029/1030 variables, and 504 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 419/419 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 9/419 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 610/1029 variables, 419/476 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 28/504 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 601/1105 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1029 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/1030 variables, and 1105 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 419/419 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/1561 places, 643/2132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61106 ms. Remains : 419/1561 places, 643/2132 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLCardinality-08
Stuttering criterion allowed to conclude after 296 steps with 1 reset in 4 ms.
FORMULA NoC3x3-PT-8B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLCardinality-08 finished in 61208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1561/1561 places, 2132/2132 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1533 transition count 2104
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1533 transition count 2104
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 84 place count 1533 transition count 2076
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 103 place count 1514 transition count 2057
Iterating global reduction 1 with 19 rules applied. Total rules applied 122 place count 1514 transition count 2057
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 141 place count 1514 transition count 2038
Applied a total of 141 rules in 111 ms. Remains 1514 /1561 variables (removed 47) and now considering 2038/2132 (removed 94) transitions.
// Phase 1: matrix 2038 rows 1514 cols
[2024-05-26 05:24:50] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 05:24:51] [INFO ] Implicit Places using invariants in 596 ms returned []
[2024-05-26 05:24:51] [INFO ] Invariant cache hit.
[2024-05-26 05:24:52] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
Running 2037 sub problems to find dead transitions.
[2024-05-26 05:24:52] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3552 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 2037/2037 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2037 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3552 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/2037 constraints, Known Traps: 0/0 constraints]
After SMT, in 60549ms problems are : Problem set: 0 solved, 2037 unsolved
Search for dead transitions found 0 dead transitions in 60573ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1561 places, 2038/2132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62632 ms. Remains : 1514/1561 places, 2038/2132 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLCardinality-09 finished in 62779 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||(p1&&X((p2 U !p1)))))))'
Support contains 4 out of 1561 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1561/1561 places, 2132/2132 transitions.
Graph (trivial) has 1380 edges and 1561 vertex of which 493 / 1561 are part of one of the 33 SCC in 5 ms
Free SCC test removed 460 places
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Graph (complete) has 2717 edges and 1101 vertex of which 1100 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 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 251 rules applied. Total rules applied 253 place count 1099 transition count 1379
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 238 rules applied. Total rules applied 491 place count 896 transition count 1344
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 37 rules applied. Total rules applied 528 place count 879 transition count 1324
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 536 place count 871 transition count 1324
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 536 place count 871 transition count 1227
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 730 place count 774 transition count 1227
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 826 place count 678 transition count 1039
Iterating global reduction 4 with 96 rules applied. Total rules applied 922 place count 678 transition count 1039
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 992 place count 678 transition count 969
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 1438 place count 455 transition count 746
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1486 place count 455 transition count 698
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 1488 place count 455 transition count 696
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1491 place count 455 transition count 696
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1493 place count 453 transition count 694
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 1526 place count 444 transition count 670
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 1574 place count 420 transition count 646
Applied a total of 1574 rules in 223 ms. Remains 420 /1561 variables (removed 1141) and now considering 646/2132 (removed 1486) transitions.
[2024-05-26 05:25:53] [INFO ] Flow matrix only has 614 transitions (discarded 32 similar events)
// Phase 1: matrix 614 rows 420 cols
[2024-05-26 05:25:53] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 05:25:53] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-05-26 05:25:53] [INFO ] Flow matrix only has 614 transitions (discarded 32 similar events)
[2024-05-26 05:25:53] [INFO ] Invariant cache hit.
[2024-05-26 05:25:53] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 05:25:54] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2024-05-26 05:25:54] [INFO ] Redundant transitions in 4 ms returned []
Running 601 sub problems to find dead transitions.
[2024-05-26 05:25:54] [INFO ] Flow matrix only has 614 transitions (discarded 32 similar events)
[2024-05-26 05:25:54] [INFO ] Invariant cache hit.
[2024-05-26 05:25:54] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 9/420 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 613/1033 variables, 420/477 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 28/505 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1033 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1033/1034 variables, and 505 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 420/420 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 9/420 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 613/1033 variables, 420/477 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 28/505 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1033 variables, 601/1106 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1033 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1033/1034 variables, and 1106 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 420/420 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in SI_LTL mode, iteration 1 : 420/1561 places, 646/2132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61275 ms. Remains : 420/1561 places, 646/2132 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8B-LTLCardinality-12
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLCardinality-12 finished in 61404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1561/1561 places, 2132/2132 transitions.
Graph (trivial) has 1387 edges and 1561 vertex of which 495 / 1561 are part of one of the 33 SCC in 1 ms
Free SCC test removed 462 places
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Graph (complete) has 2713 edges and 1099 vertex of which 1098 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 1097 transition count 1374
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 241 rules applied. Total rules applied 495 place count 893 transition count 1337
Reduce places removed 18 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 2 with 40 rules applied. Total rules applied 535 place count 875 transition count 1315
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 544 place count 866 transition count 1315
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 544 place count 866 transition count 1219
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 736 place count 770 transition count 1219
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 833 place count 673 transition count 1030
Iterating global reduction 4 with 97 rules applied. Total rules applied 930 place count 673 transition count 1030
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 1001 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 1447 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 1495 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 1496 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 1498 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 1500 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 1533 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 1581 place count 415 transition count 637
Applied a total of 1581 rules in 221 ms. Remains 415 /1561 variables (removed 1146) and now considering 637/2132 (removed 1495) transitions.
[2024-05-26 05:26:54] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
// Phase 1: matrix 605 rows 415 cols
[2024-05-26 05:26:54] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 05:26:54] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-26 05:26:54] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 05:26:54] [INFO ] Invariant cache hit.
[2024-05-26 05:26:55] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-26 05:26:55] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-26 05:26:55] [INFO ] Redundant transitions in 3 ms returned []
Running 595 sub problems to find dead transitions.
[2024-05-26 05:26:55] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2024-05-26 05:26:55] [INFO ] Invariant cache hit.
[2024-05-26 05:26: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
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 1019/1020 variables, and 500 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30021 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 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]
After SMT, in 60157ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 415/1561 places, 637/2132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61026 ms. Remains : 415/1561 places, 637/2132 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLCardinality-14 finished in 61090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||G(p1))) U p1)))'
Support contains 4 out of 1561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1561/1561 places, 2132/2132 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1533 transition count 2104
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1533 transition count 2104
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 84 place count 1533 transition count 2076
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 103 place count 1514 transition count 2057
Iterating global reduction 1 with 19 rules applied. Total rules applied 122 place count 1514 transition count 2057
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 141 place count 1514 transition count 2038
Applied a total of 141 rules in 110 ms. Remains 1514 /1561 variables (removed 47) and now considering 2038/2132 (removed 94) transitions.
// Phase 1: matrix 2038 rows 1514 cols
[2024-05-26 05:27:55] [INFO ] Computed 66 invariants in 26 ms
[2024-05-26 05:27:56] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-26 05:27:56] [INFO ] Invariant cache hit.
[2024-05-26 05:27:57] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
Running 2037 sub problems to find dead transitions.
[2024-05-26 05:27:57] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3552 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 2037/2037 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2037 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3552 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/2037 constraints, Known Traps: 0/0 constraints]
After SMT, in 60563ms problems are : Problem set: 0 solved, 2037 unsolved
Search for dead transitions found 0 dead transitions in 60579ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1561 places, 2038/2132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62344 ms. Remains : 1514/1561 places, 2038/2132 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 509 ms.
Product exploration explored 100000 steps with 50000 reset in 464 ms.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3178 edges and 1514 vertex of which 1513 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.27 ms
Computed a total of 198 stabilizing places and 316 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 42 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-8B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8B-LTLCardinality-15 finished in 63603 ms.
All properties solved by simple procedures.
Total runtime 594830 ms.
ITS solved all properties within timeout

BK_STOP 1716701339311

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is NoC3x3-PT-8B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654350400675"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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