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-171654350200556.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-1A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350200556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 07:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 07:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 07:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 07:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 81K 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-1A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716680866083

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 23:47:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 23:47:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:47:47] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-25 23:47:47] [INFO ] Transformed 165 places.
[2024-05-25 23:47:47] [INFO ] Transformed 355 transitions.
[2024-05-25 23:47:47] [INFO ] Found NUPN structural information;
[2024-05-25 23:47:47] [INFO ] Parsed PT model containing 165 places and 355 transitions and 1069 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 108 transitions
Reduce redundant transitions removed 108 transitions.
FORMULA NoC3x3-PT-1A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 247/247 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 142 transition count 214
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 142 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 70 place count 142 transition count 190
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 136 transition count 190
Applied a total of 76 rules in 37 ms. Remains 136 /165 variables (removed 29) and now considering 190/247 (removed 57) transitions.
// Phase 1: matrix 190 rows 136 cols
[2024-05-25 23:47:47] [INFO ] Computed 34 invariants in 23 ms
[2024-05-25 23:47:47] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-25 23:47:47] [INFO ] Invariant cache hit.
[2024-05-25 23:47:48] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-25 23:47:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 190/326 variables, 136/170 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/326 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 170 constraints, problems are : Problem set: 0 solved, 189 unsolved in 3987 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 190/326 variables, 136/170 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 189/359 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/326 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 359 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4833 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 8912ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 8929ms
Starting structural reductions in LTL mode, iteration 1 : 136/165 places, 190/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9422 ms. Remains : 136/165 places, 190/247 transitions.
Support contains 30 out of 136 places after structural reductions.
[2024-05-25 23:47:57] [INFO ] Flatten gal took : 41 ms
[2024-05-25 23:47:57] [INFO ] Flatten gal took : 17 ms
[2024-05-25 23:47:57] [INFO ] Input system was already deterministic with 190 transitions.
Support contains 29 out of 136 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1436 ms. (27 steps per ms) remains 0/22 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Graph (trivial) has 78 edges and 136 vertex of which 42 / 136 are part of one of the 18 SCC in 2 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 109 transition count 139
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 109 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 109 transition count 137
Applied a total of 9 rules in 30 ms. Remains 109 /136 variables (removed 27) and now considering 137/190 (removed 53) transitions.
[2024-05-25 23:47:58] [INFO ] Flow matrix only has 120 transitions (discarded 17 similar events)
// Phase 1: matrix 120 rows 109 cols
[2024-05-25 23:47:58] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 23:47:58] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-25 23:47:58] [INFO ] Flow matrix only has 120 transitions (discarded 17 similar events)
[2024-05-25 23:47:58] [INFO ] Invariant cache hit.
[2024-05-25 23:47:58] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-25 23:47:58] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-25 23:47:58] [INFO ] Redundant transitions in 3 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-25 23:47:58] [INFO ] Flow matrix only has 120 transitions (discarded 17 similar events)
[2024-05-25 23:47:58] [INFO ] Invariant cache hit.
[2024-05-25 23:47:58] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 119/228 variables, 109/143 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 53/196 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 1/229 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 197 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3663 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 109/109 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 119/228 variables, 109/143 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 53/196 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 136/332 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 1/229 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/229 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 333 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4024 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 109/109 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 7728ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 7730ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/136 places, 137/190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7973 ms. Remains : 109/136 places, 137/190 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-01
Stuttering criterion allowed to conclude after 652 steps with 0 reset in 12 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-01 finished in 8277 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((F(p1)&&p0))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 131 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 131 transition count 185
Applied a total of 10 rules in 12 ms. Remains 131 /136 variables (removed 5) and now considering 185/190 (removed 5) transitions.
// Phase 1: matrix 185 rows 131 cols
[2024-05-25 23:48:06] [INFO ] Computed 34 invariants in 2 ms
[2024-05-25 23:48:06] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-25 23:48:06] [INFO ] Invariant cache hit.
[2024-05-25 23:48:06] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-25 23:48:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3455 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4474 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 7970ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 7972ms
Starting structural reductions in LTL mode, iteration 1 : 131/136 places, 185/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8142 ms. Remains : 131/136 places, 185/190 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-02 finished in 8318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&F(G(p2)))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 131 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 131 transition count 185
Applied a total of 10 rules in 9 ms. Remains 131 /136 variables (removed 5) and now considering 185/190 (removed 5) transitions.
[2024-05-25 23:48:14] [INFO ] Invariant cache hit.
[2024-05-25 23:48:14] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-25 23:48:14] [INFO ] Invariant cache hit.
[2024-05-25 23:48:14] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-25 23:48:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3547 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4400 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 7977ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 7980ms
Starting structural reductions in LTL mode, iteration 1 : 131/136 places, 185/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8148 ms. Remains : 131/136 places, 185/190 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 308 ms.
Stack based approach found an accepted trace after 39492 steps with 0 reset with depth 39493 and stack size 27204 in 141 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-03 finished in 8800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Graph (trivial) has 83 edges and 136 vertex of which 44 / 136 are part of one of the 19 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 104 transition count 120
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 40 place count 90 transition count 120
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 85 transition count 115
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 85 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 64 place count 85 transition count 101
Applied a total of 64 rules in 21 ms. Remains 85 /136 variables (removed 51) and now considering 101/190 (removed 89) transitions.
// Phase 1: matrix 101 rows 85 cols
[2024-05-25 23:48:23] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 23:48:23] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-25 23:48:23] [INFO ] Invariant cache hit.
[2024-05-25 23:48:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 23:48:23] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-25 23:48:23] [INFO ] Redundant transitions in 35 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-25 23:48:23] [INFO ] Invariant cache hit.
[2024-05-25 23:48:23] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 100/185 variables, 85/113 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 26/139 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 0/185 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 139 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 85/85 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 100/185 variables, 85/113 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 26/139 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 86/225 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 225 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 85/85 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 2380ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 2381ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/136 places, 101/190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2630 ms. Remains : 85/136 places, 101/190 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-04
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-04 finished in 2684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Graph (trivial) has 81 edges and 136 vertex of which 44 / 136 are part of one of the 19 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 107 transition count 136
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 107 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 107 transition count 135
Applied a total of 10 rules in 15 ms. Remains 107 /136 variables (removed 29) and now considering 135/190 (removed 55) transitions.
[2024-05-25 23:48:26] [INFO ] Flow matrix only has 117 transitions (discarded 18 similar events)
// Phase 1: matrix 117 rows 107 cols
[2024-05-25 23:48:26] [INFO ] Computed 34 invariants in 2 ms
[2024-05-25 23:48:26] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-25 23:48:26] [INFO ] Flow matrix only has 117 transitions (discarded 18 similar events)
[2024-05-25 23:48:26] [INFO ] Invariant cache hit.
[2024-05-25 23:48:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-25 23:48:26] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-25 23:48:26] [INFO ] Redundant transitions in 3 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-25 23:48:26] [INFO ] Flow matrix only has 117 transitions (discarded 18 similar events)
[2024-05-25 23:48:26] [INFO ] Invariant cache hit.
[2024-05-25 23:48:26] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 116/223 variables, 107/141 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 54/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 1/224 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/224 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 196 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3602 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 107/107 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 116/223 variables, 107/141 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 54/195 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 134/329 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 1/224 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 0/224 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 330 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3321 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 107/107 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 6941ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 6943ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/136 places, 135/190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7155 ms. Remains : 107/136 places, 135/190 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-06 finished in 7294 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 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Graph (trivial) has 83 edges and 136 vertex of which 44 / 136 are part of one of the 19 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 106 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 106 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 106 transition count 134
Applied a total of 12 rules in 10 ms. Remains 106 /136 variables (removed 30) and now considering 134/190 (removed 56) transitions.
[2024-05-25 23:48:33] [INFO ] Flow matrix only has 116 transitions (discarded 18 similar events)
// Phase 1: matrix 116 rows 106 cols
[2024-05-25 23:48:33] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 23:48:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-25 23:48:33] [INFO ] Flow matrix only has 116 transitions (discarded 18 similar events)
[2024-05-25 23:48:33] [INFO ] Invariant cache hit.
[2024-05-25 23:48:33] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-25 23:48:33] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-25 23:48:33] [INFO ] Redundant transitions in 2 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-25 23:48:33] [INFO ] Flow matrix only has 116 transitions (discarded 18 similar events)
[2024-05-25 23:48:33] [INFO ] Invariant cache hit.
[2024-05-25 23:48:33] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 115/221 variables, 106/140 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 54/194 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 1/222 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 195 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3536 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 106/106 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 115/221 variables, 106/140 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 54/194 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 133/327 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 1/222 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 328 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3235 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 106/106 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 6789ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 6790ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/136 places, 134/190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6978 ms. Remains : 106/136 places, 134/190 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-07 finished in 7032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(G(p2))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 132 transition count 186
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 132 transition count 186
Applied a total of 8 rules in 5 ms. Remains 132 /136 variables (removed 4) and now considering 186/190 (removed 4) transitions.
// Phase 1: matrix 186 rows 132 cols
[2024-05-25 23:48:40] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 23:48:40] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-25 23:48:40] [INFO ] Invariant cache hit.
[2024-05-25 23:48:40] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-25 23:48:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 3556 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4414 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 7995ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 7997ms
Starting structural reductions in LTL mode, iteration 1 : 132/136 places, 186/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8155 ms. Remains : 132/136 places, 186/190 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-08 finished in 8323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p1&&F(p2))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Graph (trivial) has 80 edges and 136 vertex of which 43 / 136 are part of one of the 19 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 106 transition count 125
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 34 place count 94 transition count 125
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 89 transition count 120
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 89 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 59 place count 89 transition count 105
Applied a total of 59 rules in 14 ms. Remains 89 /136 variables (removed 47) and now considering 105/190 (removed 85) transitions.
// Phase 1: matrix 105 rows 89 cols
[2024-05-25 23:48:48] [INFO ] Computed 29 invariants in 1 ms
[2024-05-25 23:48:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-25 23:48:48] [INFO ] Invariant cache hit.
[2024-05-25 23:48:48] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 23:48:48] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-25 23:48:49] [INFO ] Redundant transitions in 46 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-25 23:48:49] [INFO ] Invariant cache hit.
[2024-05-25 23:48:49] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 104/193 variables, 89/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 26/144 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/194 variables, and 144 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 89/89 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 104/193 variables, 89/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 26/144 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 89/233 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/194 variables, and 233 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1417 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 89/89 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 3054ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3055ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 105/190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3242 ms. Remains : 89/136 places, 105/190 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-09 finished in 3346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 132 transition count 186
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 132 transition count 186
Applied a total of 8 rules in 3 ms. Remains 132 /136 variables (removed 4) and now considering 186/190 (removed 4) transitions.
// Phase 1: matrix 186 rows 132 cols
[2024-05-25 23:48:52] [INFO ] Computed 34 invariants in 2 ms
[2024-05-25 23:48:52] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-25 23:48:52] [INFO ] Invariant cache hit.
[2024-05-25 23:48:52] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-25 23:48:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 3596 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4416 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 8042ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 8043ms
Starting structural reductions in LTL mode, iteration 1 : 132/136 places, 186/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8212 ms. Remains : 132/136 places, 186/190 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2098 steps with 0 reset in 10 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-10 finished in 8326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 131 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 131 transition count 185
Applied a total of 10 rules in 5 ms. Remains 131 /136 variables (removed 5) and now considering 185/190 (removed 5) transitions.
// Phase 1: matrix 185 rows 131 cols
[2024-05-25 23:49:00] [INFO ] Computed 34 invariants in 1 ms
[2024-05-25 23:49:00] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-25 23:49:00] [INFO ] Invariant cache hit.
[2024-05-25 23:49:00] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-25 23:49:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3487 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4349 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 7866ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 7868ms
Starting structural reductions in LTL mode, iteration 1 : 131/136 places, 185/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8040 ms. Remains : 131/136 places, 185/190 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-12 finished in 8135 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&&G(F(p1)))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 190/190 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 131 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 131 transition count 185
Applied a total of 10 rules in 4 ms. Remains 131 /136 variables (removed 5) and now considering 185/190 (removed 5) transitions.
[2024-05-25 23:49:08] [INFO ] Invariant cache hit.
[2024-05-25 23:49:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-25 23:49:08] [INFO ] Invariant cache hit.
[2024-05-25 23:49:08] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-25 23:49:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3471 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4331 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 7826ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 7829ms
Starting structural reductions in LTL mode, iteration 1 : 131/136 places, 185/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8000 ms. Remains : 131/136 places, 185/190 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-13
Product exploration explored 100000 steps with 413 reset in 344 ms.
Stack based approach found an accepted trace after 1452 steps with 5 reset with depth 485 and stack size 452 in 5 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-13 finished in 8522 ms.
All properties solved by simple procedures.
Total runtime 89899 ms.
ITS solved all properties within timeout

BK_STOP 1716680957223

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-1A"
export BK_EXAMINATION="LTLFireability"
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-1A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654350200556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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