About the Execution of ITS-Tools for Champagne-PT-H08T1U
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 672392.00 | 0.00 | 0.00 | TTTFTFFTFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339300108.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 Champagne-PT-H08T1U, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339300108
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.9K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 13:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 6 13:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 13:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 13:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Jun 6 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 13:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 13:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 214K Jun 5 20:08 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 Champagne-PT-H08T1U-LTLFireability-00
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-01
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-02
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-03
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-04
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-05
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-06
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-07
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-08
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-09
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-10
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-11
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-12
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-13
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-14
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749327170884
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H08T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 20:12:52] [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-07 20:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 20:12:52] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2025-06-07 20:12:52] [INFO ] Transformed 961 places.
[2025-06-07 20:12:52] [INFO ] Transformed 1347 transitions.
[2025-06-07 20:12:52] [INFO ] Found NUPN structural information;
[2025-06-07 20:12:52] [INFO ] Parsed PT model containing 961 places and 1347 transitions and 3454 arcs in 201 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.
FORMULA Champagne-PT-H08T1U-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H08T1U-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1347/1347 transitions.
Discarding 213 places :
Symmetric choice reduction at 0 with 213 rule applications. Total rules 213 place count 748 transition count 1134
Iterating global reduction 0 with 213 rules applied. Total rules applied 426 place count 748 transition count 1134
Discarding 139 places :
Symmetric choice reduction at 0 with 139 rule applications. Total rules 565 place count 609 transition count 995
Iterating global reduction 0 with 139 rules applied. Total rules applied 704 place count 609 transition count 995
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 781 place count 532 transition count 918
Iterating global reduction 0 with 77 rules applied. Total rules applied 858 place count 532 transition count 918
Applied a total of 858 rules in 163 ms. Remains 532 /961 variables (removed 429) and now considering 918/1347 (removed 429) transitions.
// Phase 1: matrix 918 rows 532 cols
[2025-06-07 20:12:52] [INFO ] Computed 37 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:12:53] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-06-07 20:12:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:12:53] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Running 917 sub problems to find dead transitions.
[2025-06-07 20:12:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 917 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1450 variables, and 37 constraints, problems are : Problem set: 0 solved, 917 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/532 constraints, PredecessorRefiner: 917/917 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 917 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 1 (OVERLAPS) 1/532 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 3 (OVERLAPS) 918/1450 variables, 532/569 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1450 variables, 917/1486 constraints. Problems are: Problem set: 0 solved, 917 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1450/1450 variables, and 1486 constraints, problems are : Problem set: 0 solved, 917 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 532/532 constraints, PredecessorRefiner: 917/917 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 917 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Starting structural reductions in LTL mode, iteration 1 : 532/961 places, 918/1347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61388 ms. Remains : 532/961 places, 918/1347 transitions.
Support contains 38 out of 532 places after structural reductions.
[2025-06-07 20:13:54] [INFO ] Flatten gal took : 79 ms
[2025-06-07 20:13:54] [INFO ] Flatten gal took : 45 ms
[2025-06-07 20:13:54] [INFO ] Input system was already deterministic with 918 transitions.
Support contains 37 out of 532 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (61 resets) in 1244 ms. (32 steps per ms) remains 0/31 properties
Computed a total of 48 stabilizing places and 48 stable transitions
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(F(p0))||(F(!p1)&&F(p0))||F((G(F(!p1))||(F(!p1)&&X(X(p0))))))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 521 transition count 907
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 521 transition count 907
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 513 transition count 899
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 513 transition count 899
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 510 transition count 896
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 510 transition count 896
Applied a total of 44 rules in 33 ms. Remains 510 /532 variables (removed 22) and now considering 896/918 (removed 22) transitions.
// Phase 1: matrix 896 rows 510 cols
[2025-06-07 20:13:55] [INFO ] Computed 37 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:13:55] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-07 20:13:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:13:55] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 895 sub problems to find dead transitions.
[2025-06-07 20:13:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 1 (OVERLAPS) 1/510 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 895 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/1406 variables, and 37 constraints, problems are : Problem set: 0 solved, 895 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/510 constraints, PredecessorRefiner: 895/895 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 895 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 1 (OVERLAPS) 1/510 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 3 (OVERLAPS) 896/1406 variables, 510/547 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1406 variables, 895/1442 constraints. Problems are: Problem set: 0 solved, 895 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1406/1406 variables, and 1442 constraints, problems are : Problem set: 0 solved, 895 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 895/895 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 895 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 510/532 places, 896/918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60782 ms. Remains : 510/532 places, 896/918 transitions.
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 316 ms.
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/510 stabilizing places and 39/896 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 22 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H08T1U-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H08T1U-LTLFireability-00 finished in 61753 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) U X((p1||X(G(!p1))))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 523 transition count 909
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 523 transition count 909
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 515 transition count 901
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 515 transition count 901
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 512 transition count 898
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 512 transition count 898
Applied a total of 40 rules in 40 ms. Remains 512 /532 variables (removed 20) and now considering 898/918 (removed 20) transitions.
// Phase 1: matrix 898 rows 512 cols
[2025-06-07 20:14:56] [INFO ] Computed 37 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:14:57] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-07 20:14:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:14:57] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 897 sub problems to find dead transitions.
[2025-06-07 20:14: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/511 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (OVERLAPS) 1/512 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 897 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/1410 variables, and 37 constraints, problems are : Problem set: 0 solved, 897 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/512 constraints, PredecessorRefiner: 897/897 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 897 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (OVERLAPS) 1/512 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 3 (OVERLAPS) 898/1410 variables, 512/549 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1410 variables, 897/1446 constraints. Problems are: Problem set: 0 solved, 897 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1410/1410 variables, and 1446 constraints, problems are : Problem set: 0 solved, 897 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 897/897 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 897 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 512/532 places, 898/918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 512/532 places, 898/918 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, false, (AND p1 (NOT p0)), (NOT p0), false, false, p1]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 20 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H08T1U-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H08T1U-LTLFireability-01 finished in 61398 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 p1))||(p0 U X(p2))||X(p2)))'
Support contains 5 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 520 transition count 906
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 520 transition count 906
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 511 transition count 897
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 511 transition count 897
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 507 transition count 893
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 507 transition count 893
Applied a total of 50 rules in 35 ms. Remains 507 /532 variables (removed 25) and now considering 893/918 (removed 25) transitions.
// Phase 1: matrix 893 rows 507 cols
[2025-06-07 20:15:58] [INFO ] Computed 37 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:15:58] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-07 20:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:15:58] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 892 sub problems to find dead transitions.
[2025-06-07 20:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/1400 variables, and 37 constraints, problems are : Problem set: 0 solved, 892 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/507 constraints, PredecessorRefiner: 892/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 892 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 3 (OVERLAPS) 893/1400 variables, 507/544 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1400 variables, 892/1436 constraints. Problems are: Problem set: 0 solved, 892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1400/1400 variables, and 1436 constraints, problems are : Problem set: 0 solved, 892 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 892/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 892 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 507/532 places, 893/918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60720 ms. Remains : 507/532 places, 893/918 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, (NOT p2), (NOT p2)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Detected a total of 36/507 stabilizing places and 36/893 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 21 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H08T1U-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H08T1U-LTLFireability-02 finished in 61484 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(((G(p0)||F(G(p1))) U X(p2)))))'
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 521 transition count 907
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 521 transition count 907
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 513 transition count 899
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 513 transition count 899
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 509 transition count 895
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 509 transition count 895
Applied a total of 46 rules in 37 ms. Remains 509 /532 variables (removed 23) and now considering 895/918 (removed 23) transitions.
// Phase 1: matrix 895 rows 509 cols
[2025-06-07 20:16:59] [INFO ] Computed 37 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:16:59] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-07 20:16:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:17:00] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 894 sub problems to find dead transitions.
[2025-06-07 20:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (OVERLAPS) 1/509 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 509/1404 variables, and 37 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/509 constraints, PredecessorRefiner: 894/894 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 894 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (OVERLAPS) 1/509 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/509 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 3 (OVERLAPS) 895/1404 variables, 509/546 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1404 variables, 894/1440 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1404/1404 variables, and 1440 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 509/509 constraints, PredecessorRefiner: 894/894 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 509/532 places, 895/918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60722 ms. Remains : 509/532 places, 895/918 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-03
Stuttering criterion allowed to conclude after 589 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-03 finished in 61121 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((X(X(p0))||(F(p1) U p2)))))'
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 521 transition count 907
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 521 transition count 907
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 513 transition count 899
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 513 transition count 899
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 509 transition count 895
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 509 transition count 895
Applied a total of 46 rules in 40 ms. Remains 509 /532 variables (removed 23) and now considering 895/918 (removed 23) transitions.
// Phase 1: matrix 895 rows 509 cols
[2025-06-07 20:18:00] [INFO ] Computed 37 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:18:01] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-07 20:18:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:18:01] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 894 sub problems to find dead transitions.
[2025-06-07 20:18:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (OVERLAPS) 1/509 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 509/1404 variables, and 37 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/509 constraints, PredecessorRefiner: 894/894 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 894 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (OVERLAPS) 1/509 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/509 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 3 (OVERLAPS) 895/1404 variables, 509/546 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1404 variables, 894/1440 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1404/1404 variables, and 1440 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 509/509 constraints, PredecessorRefiner: 894/894 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 509/532 places, 895/918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60725 ms. Remains : 509/532 places, 895/918 transitions.
Stuttering acceptance computed with spot in 444 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), false]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-04
Product exploration explored 100000 steps with 28556 reset in 177 ms.
Product exploration explored 100000 steps with 28511 reset in 218 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/509 stabilizing places and 38/895 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 877 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 11 states, 44 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 473 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, false, false]
RANDOM walk for 40000 steps (60 resets) in 319 ms. (125 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
[2025-06-07 20:19:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 441/509 variables, 33/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 895/1404 variables, 509/546 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1404 variables, 0/546 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1404 variables, 0/546 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1404/1404 variables, and 546 constraints, problems are : Problem set: 1 solved, 2 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 509/509 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 68/1404 variables, and 4 constraints, problems are : Problem set: 3 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 4/37 constraints, State Equation: 0/509 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 349ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p0)), (G (OR p1 p2 p0)), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (F p2), (F (NOT (OR p1 (NOT p2) p0))), (F p1), (F (NOT p0))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 423 ms. Reduced automaton from 11 states, 44 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H08T1U-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H08T1U-LTLFireability-04 finished in 63975 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))&&G(p2))))'
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 520 transition count 906
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 520 transition count 906
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 511 transition count 897
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 511 transition count 897
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 507 transition count 893
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 507 transition count 893
Applied a total of 50 rules in 34 ms. Remains 507 /532 variables (removed 25) and now considering 893/918 (removed 25) transitions.
// Phase 1: matrix 893 rows 507 cols
[2025-06-07 20:19:04] [INFO ] Computed 37 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:19:05] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-07 20:19:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:19:05] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 892 sub problems to find dead transitions.
[2025-06-07 20:19:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/1400 variables, and 37 constraints, problems are : Problem set: 0 solved, 892 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/507 constraints, PredecessorRefiner: 892/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 892 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 3 (OVERLAPS) 893/1400 variables, 507/544 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1400 variables, 892/1436 constraints. Problems are: Problem set: 0 solved, 892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1400/1400 variables, and 1436 constraints, problems are : Problem set: 0 solved, 892 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 892/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 892 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 507/532 places, 893/918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60724 ms. Remains : 507/532 places, 893/918 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-05 finished in 60960 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((X(p0) U p1)))'
Support contains 1 out of 532 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Graph (trivial) has 551 edges and 532 vertex of which 272 / 532 are part of one of the 37 SCC in 3 ms
Free SCC test removed 235 places
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 296 transition count 606
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 124 rules applied. Total rules applied 179 place count 242 transition count 536
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 213 place count 208 transition count 536
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 243 place count 178 transition count 378
Iterating global reduction 3 with 30 rules applied. Total rules applied 273 place count 178 transition count 378
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 298 place count 178 transition count 353
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 436 place count 109 transition count 284
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 438 place count 107 transition count 274
Iterating global reduction 4 with 2 rules applied. Total rules applied 440 place count 107 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 442 place count 107 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 444 place count 105 transition count 270
Applied a total of 444 rules in 81 ms. Remains 105 /532 variables (removed 427) and now considering 270/918 (removed 648) transitions.
[2025-06-07 20:20:05] [INFO ] Flow matrix only has 98 transitions (discarded 172 similar events)
// Phase 1: matrix 98 rows 105 cols
[2025-06-07 20:20:05] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:20:05] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-07 20:20:05] [INFO ] Flow matrix only has 98 transitions (discarded 172 similar events)
[2025-06-07 20:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:20:06] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:20:06] [INFO ] Redundant transitions in 15 ms returned []
Running 169 sub problems to find dead transitions.
[2025-06-07 20:20:06] [INFO ] Flow matrix only has 98 transitions (discarded 172 similar events)
[2025-06-07 20:20: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/102 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 3/105 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 97/202 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/203 variables, and 142 constraints, problems are : Problem set: 0 solved, 169 unsolved in 4645 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 3/105 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 97/202 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 169/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/203 variables, and 311 constraints, problems are : Problem set: 0 solved, 169 unsolved in 4809 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9480ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 9482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/532 places, 270/918 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9747 ms. Remains : 105/532 places, 270/918 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-06 finished in 9798 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(F(p1)))||p0))))'
Support contains 5 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 520 transition count 906
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 520 transition count 906
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 511 transition count 897
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 511 transition count 897
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 507 transition count 893
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 507 transition count 893
Applied a total of 50 rules in 53 ms. Remains 507 /532 variables (removed 25) and now considering 893/918 (removed 25) transitions.
// Phase 1: matrix 893 rows 507 cols
[2025-06-07 20:20:15] [INFO ] Computed 37 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:20:15] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-07 20:20:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:20:16] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 892 sub problems to find dead transitions.
[2025-06-07 20:20:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/1400 variables, and 37 constraints, problems are : Problem set: 0 solved, 892 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/507 constraints, PredecessorRefiner: 892/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 892 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 3 (OVERLAPS) 893/1400 variables, 507/544 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1400 variables, 892/1436 constraints. Problems are: Problem set: 0 solved, 892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1400/1400 variables, and 1436 constraints, problems are : Problem set: 0 solved, 892 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 892/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 892 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LTL mode, iteration 1 : 507/532 places, 893/918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60741 ms. Remains : 507/532 places, 893/918 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Product exploration explored 100000 steps with 33333 reset in 170 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H08T1U-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H08T1U-LTLFireability-07 finished in 61326 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 1 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Graph (trivial) has 553 edges and 532 vertex of which 278 / 532 are part of one of the 37 SCC in 2 ms
Free SCC test removed 241 places
Ensure Unique test removed 265 transitions
Reduce isomorphic transitions removed 265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 290 transition count 600
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 118 rules applied. Total rules applied 171 place count 238 transition count 534
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 203 place count 206 transition count 534
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 234 place count 175 transition count 375
Iterating global reduction 3 with 31 rules applied. Total rules applied 265 place count 175 transition count 375
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 290 place count 175 transition count 350
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 426 place count 107 transition count 282
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 428 place count 105 transition count 272
Iterating global reduction 4 with 2 rules applied. Total rules applied 430 place count 105 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 432 place count 105 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 434 place count 103 transition count 268
Applied a total of 434 rules in 60 ms. Remains 103 /532 variables (removed 429) and now considering 268/918 (removed 650) transitions.
[2025-06-07 20:21:16] [INFO ] Flow matrix only has 99 transitions (discarded 169 similar events)
// Phase 1: matrix 99 rows 103 cols
[2025-06-07 20:21:16] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:21:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-07 20:21:17] [INFO ] Flow matrix only has 99 transitions (discarded 169 similar events)
[2025-06-07 20:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:21:17] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:21:17] [INFO ] Redundant transitions in 3 ms returned []
Running 167 sub problems to find dead transitions.
[2025-06-07 20:21:17] [INFO ] Flow matrix only has 99 transitions (discarded 169 similar events)
[2025-06-07 20:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 2/103 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 98/201 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/202 variables, and 140 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4407 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 2/103 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 98/201 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 167/307 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/202 variables, and 307 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4718 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9143ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 9144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/532 places, 268/918 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9382 ms. Remains : 103/532 places, 268/918 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-08 finished in 9429 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)) U p1))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Graph (trivial) has 546 edges and 532 vertex of which 264 / 532 are part of one of the 35 SCC in 1 ms
Free SCC test removed 229 places
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 302 transition count 609
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 122 rules applied. Total rules applied 178 place count 247 transition count 542
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 210 place count 215 transition count 542
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 210 place count 215 transition count 540
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 214 place count 213 transition count 540
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 242 place count 185 transition count 397
Iterating global reduction 3 with 28 rules applied. Total rules applied 270 place count 185 transition count 397
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 292 place count 185 transition count 375
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 438 place count 112 transition count 302
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 440 place count 110 transition count 292
Iterating global reduction 4 with 2 rules applied. Total rules applied 442 place count 110 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 444 place count 110 transition count 290
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 448 place count 108 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 459 place count 108 transition count 288
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 461 place count 106 transition count 277
Iterating global reduction 5 with 2 rules applied. Total rules applied 463 place count 106 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 465 place count 106 transition count 275
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 467 place count 104 transition count 273
Applied a total of 467 rules in 61 ms. Remains 104 /532 variables (removed 428) and now considering 273/918 (removed 645) transitions.
[2025-06-07 20:21:26] [INFO ] Flow matrix only has 107 transitions (discarded 166 similar events)
// Phase 1: matrix 107 rows 104 cols
[2025-06-07 20:21:26] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:21:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-07 20:21:26] [INFO ] Flow matrix only has 107 transitions (discarded 166 similar events)
[2025-06-07 20:21:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:21:26] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:21:26] [INFO ] Redundant transitions in 3 ms returned []
Running 175 sub problems to find dead transitions.
[2025-06-07 20:21:26] [INFO ] Flow matrix only has 107 transitions (discarded 166 similar events)
[2025-06-07 20:21: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/100 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 106/210 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/211 variables, and 141 constraints, problems are : Problem set: 0 solved, 175 unsolved in 4771 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 106/210 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 175/316 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/211 variables, and 316 constraints, problems are : Problem set: 0 solved, 175 unsolved in 4958 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9745ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 9746ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/532 places, 273/918 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9970 ms. Remains : 104/532 places, 273/918 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-09 finished in 10070 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(p0))&&F(p1))))&&F(p2)))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 520 transition count 906
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 520 transition count 906
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 511 transition count 897
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 511 transition count 897
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 507 transition count 893
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 507 transition count 893
Applied a total of 50 rules in 33 ms. Remains 507 /532 variables (removed 25) and now considering 893/918 (removed 25) transitions.
// Phase 1: matrix 893 rows 507 cols
[2025-06-07 20:21:36] [INFO ] Computed 37 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:21:36] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-07 20:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:21:36] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 892 sub problems to find dead transitions.
[2025-06-07 20:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/1400 variables, and 37 constraints, problems are : Problem set: 0 solved, 892 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/507 constraints, PredecessorRefiner: 892/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 892 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 3 (OVERLAPS) 893/1400 variables, 507/544 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1400 variables, 892/1436 constraints. Problems are: Problem set: 0 solved, 892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1400/1400 variables, and 1436 constraints, problems are : Problem set: 0 solved, 892 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 892/892 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 892 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Starting structural reductions in LTL mode, iteration 1 : 507/532 places, 893/918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60747 ms. Remains : 507/532 places, 893/918 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-10
Entered a terminal (fully accepting) state of product in 253 steps with 1 reset in 1 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-10 finished in 61084 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)&&F(G(p1)))))'
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Graph (trivial) has 552 edges and 532 vertex of which 278 / 532 are part of one of the 37 SCC in 1 ms
Free SCC test removed 241 places
Ensure Unique test removed 265 transitions
Reduce isomorphic transitions removed 265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 290 transition count 601
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 118 rules applied. Total rules applied 170 place count 239 transition count 534
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 33 rules applied. Total rules applied 203 place count 207 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 204 place count 206 transition count 533
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 234 place count 176 transition count 375
Iterating global reduction 4 with 30 rules applied. Total rules applied 264 place count 176 transition count 375
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 289 place count 176 transition count 350
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 423 place count 109 transition count 283
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 425 place count 107 transition count 273
Iterating global reduction 5 with 2 rules applied. Total rules applied 427 place count 107 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 429 place count 107 transition count 271
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 431 place count 105 transition count 269
Applied a total of 431 rules in 34 ms. Remains 105 /532 variables (removed 427) and now considering 269/918 (removed 649) transitions.
[2025-06-07 20:22:37] [INFO ] Flow matrix only has 97 transitions (discarded 172 similar events)
// Phase 1: matrix 97 rows 105 cols
[2025-06-07 20:22:37] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:22:37] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-07 20:22:37] [INFO ] Flow matrix only has 97 transitions (discarded 172 similar events)
[2025-06-07 20:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:22:37] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:22:37] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2025-06-07 20:22:37] [INFO ] Flow matrix only has 97 transitions (discarded 172 similar events)
[2025-06-07 20:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 96/201 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/202 variables, and 142 constraints, problems are : Problem set: 0 solved, 175 unsolved in 4773 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 96/201 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 175/317 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:44] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:48] [INFO ] Deduced a trap along path composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/201 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/202 variables, and 319 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9866 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 14666ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 14666ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/532 places, 269/918 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14861 ms. Remains : 105/532 places, 269/918 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-11
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-11 finished in 15007 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((F(p0) U (p1||X(X(G(p1)))))))))'
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 522 transition count 908
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 522 transition count 908
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 514 transition count 900
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 514 transition count 900
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 511 transition count 897
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 511 transition count 897
Applied a total of 42 rules in 35 ms. Remains 511 /532 variables (removed 21) and now considering 897/918 (removed 21) transitions.
// Phase 1: matrix 897 rows 511 cols
[2025-06-07 20:22:52] [INFO ] Computed 37 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:22:52] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-07 20:22:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:22:53] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 896 sub problems to find dead transitions.
[2025-06-07 20:22:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 1/511 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/1408 variables, and 37 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/511 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 1/511 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 3 (OVERLAPS) 897/1408 variables, 511/548 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1408 variables, 896/1444 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1408/1408 variables, and 1444 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 511/511 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 511/532 places, 897/918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60741 ms. Remains : 511/532 places, 897/918 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-12
Stuttering criterion allowed to conclude after 962 steps with 1 reset in 4 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-12 finished in 61084 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 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 918/918 transitions.
Graph (trivial) has 549 edges and 532 vertex of which 271 / 532 are part of one of the 36 SCC in 1 ms
Free SCC test removed 235 places
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 296 transition count 605
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 120 rules applied. Total rules applied 174 place count 243 transition count 538
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 206 place count 211 transition count 538
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 206 place count 211 transition count 536
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 209 transition count 536
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 239 place count 180 transition count 382
Iterating global reduction 3 with 29 rules applied. Total rules applied 268 place count 180 transition count 382
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 291 place count 180 transition count 359
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 433 place count 109 transition count 288
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 435 place count 107 transition count 278
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 107 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 439 place count 107 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 441 place count 106 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 444 place count 106 transition count 275
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 445 place count 105 transition count 272
Iterating global reduction 5 with 1 rules applied. Total rules applied 446 place count 105 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 447 place count 105 transition count 271
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 449 place count 103 transition count 269
Applied a total of 449 rules in 45 ms. Remains 103 /532 variables (removed 429) and now considering 269/918 (removed 649) transitions.
[2025-06-07 20:23:53] [INFO ] Flow matrix only has 100 transitions (discarded 169 similar events)
// Phase 1: matrix 100 rows 103 cols
[2025-06-07 20:23:53] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:23:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-07 20:23:53] [INFO ] Flow matrix only has 100 transitions (discarded 169 similar events)
[2025-06-07 20:23:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:23:53] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:23:53] [INFO ] Redundant transitions in 0 ms returned []
Running 169 sub problems to find dead transitions.
[2025-06-07 20:23:53] [INFO ] Flow matrix only has 100 transitions (discarded 169 similar events)
[2025-06-07 20:23:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 3/103 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 99/202 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/203 variables, and 140 constraints, problems are : Problem set: 0 solved, 169 unsolved in 4566 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 3/103 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 99/202 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 169/309 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/203 variables, and 309 constraints, problems are : Problem set: 0 solved, 169 unsolved in 4726 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9310ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 9310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/532 places, 269/918 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9526 ms. Remains : 103/532 places, 269/918 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-14
Stuttering criterion allowed to conclude after 509 steps with 6 reset in 4 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-14 finished in 9624 ms.
All properties solved by simple procedures.
Total runtime 671158 ms.
BK_STOP 1749327843276
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="Champagne-PT-H08T1U"
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 Champagne-PT-H08T1U, 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 r254-tall-174931339300108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H08T1U.tgz
mv Champagne-PT-H08T1U 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 ;