About the Execution of ITS-Tools for NoC3x3-PT-4A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 607705.00 | 0.00 | 0.00 | FTFFFFFFFTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812100204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is NoC3x3-PT-4A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812100204
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 144K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748822523714
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 00:02:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 00:02:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 00:02:05] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-06-02 00:02:05] [INFO ] Transformed 293 places.
[2025-06-02 00:02:05] [INFO ] Transformed 608 transitions.
[2025-06-02 00:02:05] [INFO ] Found NUPN structural information;
[2025-06-02 00:02:05] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
FORMULA NoC3x3-PT-4A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 244 transition count 377
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 244 transition count 377
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 143 place count 244 transition count 332
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 151 place count 236 transition count 332
Applied a total of 151 rules in 62 ms. Remains 236 /293 variables (removed 57) and now considering 332/453 (removed 121) transitions.
// Phase 1: matrix 332 rows 236 cols
[2025-06-02 00:02:05] [INFO ] Computed 58 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:02:05] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-06-02 00:02:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:02:06] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2025-06-02 00:02:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (OVERLAPS) 332/568 variables, 236/294 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 0/568 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 294 constraints, problems are : Problem set: 0 solved, 331 unsolved in 22775 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (OVERLAPS) 332/568 variables, 236/294 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 331/625 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (OVERLAPS) 0/568 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 625 constraints, problems are : Problem set: 0 solved, 331 unsolved in 28497 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51408ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 51424ms
Starting structural reductions in LTL mode, iteration 1 : 236/293 places, 332/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52320 ms. Remains : 236/293 places, 332/453 transitions.
Support contains 51 out of 236 places after structural reductions.
[2025-06-02 00:02:57] [INFO ] Flatten gal took : 49 ms
[2025-06-02 00:02:57] [INFO ] Flatten gal took : 24 ms
[2025-06-02 00:02:57] [INFO ] Input system was already deterministic with 332 transitions.
RANDOM walk for 37820 steps (8 resets) in 1568 ms. (24 steps per ms) remains 0/34 properties
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 788 edges and 236 vertex of which 235 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p1&&X(G(p0)))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 230 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 230 transition count 326
Applied a total of 12 rules in 9 ms. Remains 230 /236 variables (removed 6) and now considering 326/332 (removed 6) transitions.
// Phase 1: matrix 326 rows 230 cols
[2025-06-02 00:02:58] [INFO ] Computed 58 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:02:59] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-02 00:02:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:02:59] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2025-06-02 00:02:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 1/230 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 326/556 variables, 230/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (OVERLAPS) 0/556 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 288 constraints, problems are : Problem set: 0 solved, 325 unsolved in 21609 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 1/230 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 326/556 variables, 230/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 325/613 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 613 constraints, problems are : Problem set: 0 solved, 325 unsolved in 26041 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47713ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 47715ms
Starting structural reductions in LTL mode, iteration 1 : 230/236 places, 326/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48020 ms. Remains : 230/236 places, 326/332 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (OR (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-02 finished in 48374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)&&(X(G(p2))||(p3 U (p4||G(p3))))))'
Support contains 6 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 228 transition count 325
Applied a total of 15 rules in 14 ms. Remains 228 /236 variables (removed 8) and now considering 325/332 (removed 7) transitions.
// Phase 1: matrix 325 rows 228 cols
[2025-06-02 00:03:47] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:03:47] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 00:03:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:03:47] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:03:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17716 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23000 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40763ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 40774ms
Starting structural reductions in LTL mode, iteration 1 : 228/236 places, 325/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41071 ms. Remains : 228/236 places, 325/332 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p4) (NOT p3)), true, (AND (NOT p4) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-03 finished in 41347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 137 edges and 236 vertex of which 73 / 236 are part of one of the 32 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 707 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 0 with 41 rules applied. Total rules applied 43 place count 184 transition count 218
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 160 transition count 218
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 154 transition count 212
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 154 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 103 place count 154 transition count 188
Applied a total of 103 rules in 61 ms. Remains 154 /236 variables (removed 82) and now considering 188/332 (removed 144) transitions.
// Phase 1: matrix 188 rows 154 cols
[2025-06-02 00:04:28] [INFO ] Computed 48 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:04:28] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-06-02 00:04:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:04:29] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-02 00:04:29] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 00:04:29] [INFO ] Redundant transitions in 64 ms returned []
Running 163 sub problems to find dead transitions.
[2025-06-02 00:04:29] [INFO ] Invariant cache hit.
[2025-06-02 00:04:29] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 187/341 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 54/256 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 0/341 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/342 variables, and 256 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5705 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 187/341 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 54/256 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 163/419 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/342 variables, and 419 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5742 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11470ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 11470ms
Starting structural reductions in SI_LTL mode, iteration 1 : 154/236 places, 188/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12058 ms. Remains : 154/236 places, 188/332 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-04
Stuttering criterion allowed to conclude after 2832 steps with 0 reset in 38 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-04 finished in 12145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 137 edges and 236 vertex of which 73 / 236 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 707 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 0 with 41 rules applied. Total rules applied 43 place count 184 transition count 218
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 160 transition count 218
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 153 transition count 211
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 153 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 105 place count 153 transition count 187
Applied a total of 105 rules in 33 ms. Remains 153 /236 variables (removed 83) and now considering 187/332 (removed 145) transitions.
// Phase 1: matrix 187 rows 153 cols
[2025-06-02 00:04:40] [INFO ] Computed 48 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:04:40] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-02 00:04:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:04:41] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-02 00:04:41] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 00:04:41] [INFO ] Redundant transitions in 70 ms returned []
Running 162 sub problems to find dead transitions.
[2025-06-02 00:04:41] [INFO ] Invariant cache hit.
[2025-06-02 00:04:41] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/339 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 54/255 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 0/339 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/340 variables, and 255 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5680 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/339 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 54/255 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 162/417 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/340 variables, and 417 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5659 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11354ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 11355ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/236 places, 187/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11950 ms. Remains : 153/236 places, 187/332 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-05 finished in 12020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(p1 U (G(p1)||(p1&&(!p2 U (G(!p2)||(!p2&&G(!p3))))))))))'
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 131 edges and 236 vertex of which 70 / 236 are part of one of the 31 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Graph (complete) has 711 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 190 transition count 249
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 190 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 190 transition count 246
Applied a total of 17 rules in 21 ms. Remains 190 /236 variables (removed 46) and now considering 246/332 (removed 86) transitions.
[2025-06-02 00:04:52] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 190 cols
[2025-06-02 00:04:52] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:04:52] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-02 00:04:52] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
[2025-06-02 00:04:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:04:52] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-02 00:04:53] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 00:04:53] [INFO ] Redundant transitions in 3 ms returned []
Running 245 sub problems to find dead transitions.
[2025-06-02 00:04:53] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
[2025-06-02 00:04:53] [INFO ] Invariant cache hit.
[2025-06-02 00:04:53] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 215/405 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 98/345 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 1/406 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/406 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 346 constraints, problems are : Problem set: 0 solved, 245 unsolved in 12593 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 190/190 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 215/405 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 98/345 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 245/590 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 1/406 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 591 constraints, problems are : Problem set: 0 solved, 245 unsolved in 19501 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 190/190 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32119ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 32121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 190/236 places, 246/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32513 ms. Remains : 190/236 places, 246/332 transitions.
Stuttering acceptance computed with spot in 433 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) p2 p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p0), (OR (NOT p0) (AND p2 p3)), (OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)), (OR (NOT p0) p2)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-06 finished in 32973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((p1||X(X(p2))) U X((p3||X(p0))))))'
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 229 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 229 transition count 326
Applied a total of 13 rules in 12 ms. Remains 229 /236 variables (removed 7) and now considering 326/332 (removed 6) transitions.
// Phase 1: matrix 326 rows 229 cols
[2025-06-02 00:05:25] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:05:25] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 00:05:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:05:26] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2025-06-02 00:05:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 286 constraints, problems are : Problem set: 0 solved, 325 unsolved in 17827 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 325/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 611 constraints, problems are : Problem set: 0 solved, 325 unsolved in 24091 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41954ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 41956ms
Starting structural reductions in LTL mode, iteration 1 : 229/236 places, 326/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42234 ms. Remains : 229/236 places, 326/332 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-07 finished in 42635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))||(F(p0) U G(p1))||F(p2))))'
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 229 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 229 transition count 326
Applied a total of 13 rules in 9 ms. Remains 229 /236 variables (removed 7) and now considering 326/332 (removed 6) transitions.
// Phase 1: matrix 326 rows 229 cols
[2025-06-02 00:06:08] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:06:08] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 00:06:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:06:08] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2025-06-02 00:06:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 286 constraints, problems are : Problem set: 0 solved, 325 unsolved in 17989 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 325/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 611 constraints, problems are : Problem set: 0 solved, 325 unsolved in 24572 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42589ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 42590ms
Starting structural reductions in LTL mode, iteration 1 : 229/236 places, 326/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42847 ms. Remains : 229/236 places, 326/332 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-08
Product exploration explored 100000 steps with 28 reset in 385 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-08 finished in 43519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X(G(p1)))||p0)))))'
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 228 transition count 325
Applied a total of 15 rules in 12 ms. Remains 228 /236 variables (removed 8) and now considering 325/332 (removed 7) transitions.
// Phase 1: matrix 325 rows 228 cols
[2025-06-02 00:06:51] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:06:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 00:06:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:06:52] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:06:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17964 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23291 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41295ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 41296ms
Starting structural reductions in LTL mode, iteration 1 : 228/236 places, 325/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41576 ms. Remains : 228/236 places, 325/332 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 330 ms.
Product exploration explored 100000 steps with 25000 reset in 423 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 15815 steps (3 resets) in 109 ms. (143 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 325/325 transitions.
Applied a total of 0 rules in 2 ms. Remains 228 /228 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2025-06-02 00:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:07:35] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-02 00:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:07:35] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17611 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23478 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41122ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 41122ms
Finished structural reductions in LTL mode , in 1 iterations and 41462 ms. Remains : 228/228 places, 325/325 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 9998 steps (2 resets) in 64 ms. (153 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 217 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 316 ms.
Product exploration explored 100000 steps with 25000 reset in 336 ms.
Applying partial POR strategy [true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 237 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 325/325 transitions.
Graph (trivial) has 134 edges and 228 vertex of which 72 / 228 are part of one of the 32 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
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 2 place count 188 transition count 245
Applied a total of 2 rules in 24 ms. Remains 188 /228 variables (removed 40) and now considering 245/325 (removed 80) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 00:08:19] [INFO ] Redundant transitions in 2 ms returned []
Running 244 sub problems to find dead transitions.
[2025-06-02 00:08:19] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
// Phase 1: matrix 214 rows 188 cols
[2025-06-02 00:08:19] [INFO ] Computed 57 invariants in 1 ms
[2025-06-02 00:08:19] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 213/401 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 98/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 1/402 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 344 constraints, problems are : Problem set: 0 solved, 244 unsolved in 12167 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 213/401 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 98/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 244/587 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 588 constraints, problems are : Problem set: 0 solved, 244 unsolved in 19044 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31241ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 31241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 188/228 places, 245/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31271 ms. Remains : 188/228 places, 245/325 transitions.
Built C files in :
/tmp/ltsmin17944631803498113894
[2025-06-02 00:08:50] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17944631803498113894
Running compilation step : cd /tmp/ltsmin17944631803498113894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 595 ms.
Running link step : cd /tmp/ltsmin17944631803498113894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin17944631803498113894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6471358988059561068.hoa' '--buchi-type=spotba'
LTSmin run took 5520 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-4A-LTLFireability-09 finished in 124832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X(F(p1))))))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 230 transition count 327
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 230 transition count 327
Applied a total of 11 rules in 10 ms. Remains 230 /236 variables (removed 6) and now considering 327/332 (removed 5) transitions.
// Phase 1: matrix 327 rows 230 cols
[2025-06-02 00:08:56] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:08:56] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 00:08:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:08:57] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2025-06-02 00:08:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 327/557 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 0/557 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 287 constraints, problems are : Problem set: 0 solved, 326 unsolved in 17621 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 327/557 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 326/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 613 constraints, problems are : Problem set: 0 solved, 326 unsolved in 24713 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42360ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 42361ms
Starting structural reductions in LTL mode, iteration 1 : 230/236 places, 327/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42668 ms. Remains : 230/236 places, 327/332 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-10
Product exploration explored 100000 steps with 76 reset in 322 ms.
Stack based approach found an accepted trace after 175 steps with 0 reset with depth 176 and stack size 173 in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-10 finished in 43212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 228 transition count 325
Applied a total of 15 rules in 13 ms. Remains 228 /236 variables (removed 8) and now considering 325/332 (removed 7) transitions.
// Phase 1: matrix 325 rows 228 cols
[2025-06-02 00:09:39] [INFO ] Computed 57 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:09:40] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 00:09:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:09:40] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:09:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17688 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23208 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40929ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 40929ms
Starting structural reductions in LTL mode, iteration 1 : 228/236 places, 325/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41219 ms. Remains : 228/236 places, 325/332 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 296 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-11 finished in 41394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 228 transition count 325
Applied a total of 15 rules in 7 ms. Remains 228 /236 variables (removed 8) and now considering 325/332 (removed 7) transitions.
[2025-06-02 00:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:10:21] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-06-02 00:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:10:21] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17281 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 22980 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40318ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 40319ms
Starting structural reductions in LTL mode, iteration 1 : 228/236 places, 325/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40756 ms. Remains : 228/236 places, 325/332 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-12 finished in 40871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (p1 U p2))))'
Support contains 6 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 228 transition count 325
Applied a total of 15 rules in 7 ms. Remains 228 /236 variables (removed 8) and now considering 325/332 (removed 7) transitions.
[2025-06-02 00:11:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:11:02] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-02 00:11:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:11:02] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:11:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17257 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 22635 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39932ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 39933ms
Starting structural reductions in LTL mode, iteration 1 : 228/236 places, 325/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40335 ms. Remains : 228/236 places, 325/332 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-13
Product exploration explored 100000 steps with 16 reset in 282 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-13 finished in 40749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 137 edges and 236 vertex of which 74 / 236 are part of one of the 33 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 707 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 185 transition count 222
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 59 place count 164 transition count 222
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 66 place count 157 transition count 215
Iterating global reduction 2 with 7 rules applied. Total rules applied 73 place count 157 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 98 place count 157 transition count 190
Applied a total of 98 rules in 18 ms. Remains 157 /236 variables (removed 79) and now considering 190/332 (removed 142) transitions.
// Phase 1: matrix 190 rows 157 cols
[2025-06-02 00:11:42] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:11:43] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-06-02 00:11:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:11:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 00:11:43] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 00:11:43] [INFO ] Redundant transitions in 53 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-02 00:11:43] [INFO ] Invariant cache hit.
[2025-06-02 00:11:43] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 189/346 variables, 157/206 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/346 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/347 variables, and 262 constraints, problems are : Problem set: 0 solved, 164 unsolved in 7148 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 157/157 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 189/346 variables, 157/206 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 164/426 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/346 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/347 variables, and 426 constraints, problems are : Problem set: 0 solved, 164 unsolved in 6541 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 157/157 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13719ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 13720ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/236 places, 190/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14326 ms. Remains : 157/236 places, 190/332 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-14
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-14 finished in 14401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 332/332 transitions.
Graph (trivial) has 134 edges and 236 vertex of which 72 / 236 are part of one of the 32 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Graph (complete) has 709 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 186 transition count 223
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 61 place count 164 transition count 223
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 157 transition count 216
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 157 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 100 place count 157 transition count 191
Applied a total of 100 rules in 19 ms. Remains 157 /236 variables (removed 79) and now considering 191/332 (removed 141) transitions.
// Phase 1: matrix 191 rows 157 cols
[2025-06-02 00:11:57] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:11:57] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 00:11:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:11:57] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-02 00:11:57] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 00:11:57] [INFO ] Redundant transitions in 47 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-02 00:11:57] [INFO ] Invariant cache hit.
[2025-06-02 00:11:57] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 190/347 variables, 157/206 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 54/260 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/347 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/348 variables, and 260 constraints, problems are : Problem set: 0 solved, 165 unsolved in 7240 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 157/157 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 190/347 variables, 157/206 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 54/260 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 165/425 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/348 variables, and 425 constraints, problems are : Problem set: 0 solved, 165 unsolved in 6390 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 157/157 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13657ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 13658ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/236 places, 191/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13997 ms. Remains : 157/236 places, 191/332 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-15
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-15 finished in 14044 ms.
All properties solved by simple procedures.
Total runtime 606480 ms.
BK_STOP 1748823131419
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-4A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-4A, 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 r142-tall-174876812100204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-4A.tgz
mv NoC3x3-PT-4A 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.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 '
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 ;