About the Execution of ITS-Tools for Champagne-PT-H07T1U
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 395408.00 | 0.00 | 0.00 | TTFTFFFFTFTFFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200083.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-H07T1U, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200083
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.4K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 6 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:40 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 144K 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-H07T1U-LTLCardinality-00
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-01
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-02
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-03
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-04
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-05
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-06
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-07
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-08
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-09
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-10
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-11
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-12
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-13
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-14
FORMULA_NAME Champagne-PT-H07T1U-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749323766815
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 19:16:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 19:16:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:16:08] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-06-07 19:16:08] [INFO ] Transformed 701 places.
[2025-06-07 19:16:08] [INFO ] Transformed 931 transitions.
[2025-06-07 19:16:08] [INFO ] Found NUPN structural information;
[2025-06-07 19:16:08] [INFO ] Parsed PT model containing 701 places and 931 transitions and 2312 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H07T1U-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T1U-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T1U-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T1U-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T1U-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T1U-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 701/701 places, 931/931 transitions.
Discarding 152 places :
Symmetric choice reduction at 0 with 152 rule applications. Total rules 152 place count 549 transition count 779
Iterating global reduction 0 with 152 rules applied. Total rules applied 304 place count 549 transition count 779
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 398 place count 455 transition count 685
Iterating global reduction 0 with 94 rules applied. Total rules applied 492 place count 455 transition count 685
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 543 place count 404 transition count 634
Iterating global reduction 0 with 51 rules applied. Total rules applied 594 place count 404 transition count 634
Applied a total of 594 rules in 118 ms. Remains 404 /701 variables (removed 297) and now considering 634/931 (removed 297) transitions.
// Phase 1: matrix 634 rows 404 cols
[2025-06-07 19:16:08] [INFO ] Computed 27 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:16:08] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-07 19:16:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:16:09] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 633 sub problems to find dead transitions.
[2025-06-07 19:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:22] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:22] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:22] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:23] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 4 (OVERLAPS) 634/1038 variables, 404/435 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1038/1038 variables, and 435 constraints, problems are : Problem set: 0 solved, 633 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 633/633 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 633 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 4 (OVERLAPS) 634/1038 variables, 404/435 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 633/1068 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:52] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:53] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:53] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:54] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:54] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:55] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:16:55] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 26 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1038 variables, 7/1075 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:17:04] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:17:06] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:17:09] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 8 ms to minimize.
SMT process timed out in 60237ms, After SMT, problems are : Problem set: 0 solved, 633 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Starting structural reductions in LTL mode, iteration 1 : 404/701 places, 634/931 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60973 ms. Remains : 404/701 places, 634/931 transitions.
Support contains 32 out of 404 places after structural reductions.
[2025-06-07 19:17:09] [INFO ] Flatten gal took : 59 ms
[2025-06-07 19:17:09] [INFO ] Flatten gal took : 55 ms
[2025-06-07 19:17:09] [INFO ] Input system was already deterministic with 634 transitions.
RANDOM walk for 17427 steps (38 resets) in 451 ms. (38 steps per ms) remains 0/17 properties
Computed a total of 32 stabilizing places and 32 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' '!(((p0||F((G(F(!p1))||(F(!p1)&&X(G(p2)))))) U X(p2)))'
Support contains 5 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 634/634 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 387 transition count 617
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 387 transition count 617
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 379 transition count 609
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 379 transition count 609
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 377 transition count 607
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 377 transition count 607
Applied a total of 54 rules in 34 ms. Remains 377 /404 variables (removed 27) and now considering 607/634 (removed 27) transitions.
// Phase 1: matrix 607 rows 377 cols
[2025-06-07 19:17:10] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:17:10] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-07 19:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:17:10] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2025-06-07 19:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (OVERLAPS) 607/984 variables, 377/404 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/984 variables, and 404 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (OVERLAPS) 607/984 variables, 377/404 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 606/1010 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:18:03] [INFO ] Deduced a trap along path composed of 13 places in 51 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 1011 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 377/404 places, 607/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60560 ms. Remains : 377/404 places, 607/634 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), p1]
Running random walk in product with property : Champagne-PT-H07T1U-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 27 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H07T1U-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H07T1U-LTLCardinality-00 finished in 61396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 634/634 transitions.
Graph (trivial) has 419 edges and 404 vertex of which 202 / 404 are part of one of the 27 SCC in 3 ms
Free SCC test removed 175 places
Ensure Unique test removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 228 transition count 402
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 91 rules applied. Total rules applied 132 place count 188 transition count 351
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 157 place count 163 transition count 351
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 179 place count 141 transition count 291
Iterating global reduction 3 with 22 rules applied. Total rules applied 201 place count 141 transition count 291
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 212 place count 141 transition count 280
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 320 place count 87 transition count 226
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 329 place count 78 transition count 182
Iterating global reduction 4 with 9 rules applied. Total rules applied 338 place count 78 transition count 182
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 347 place count 78 transition count 173
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 349 place count 76 transition count 171
Applied a total of 349 rules in 79 ms. Remains 76 /404 variables (removed 328) and now considering 171/634 (removed 463) transitions.
[2025-06-07 19:18:11] [INFO ] Flow matrix only has 72 transitions (discarded 99 similar events)
// Phase 1: matrix 72 rows 76 cols
[2025-06-07 19:18:11] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:18:11] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-07 19:18:11] [INFO ] Flow matrix only has 72 transitions (discarded 99 similar events)
[2025-06-07 19:18:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:18:11] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:18:11] [INFO ] Redundant transitions in 4 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-07 19:18:11] [INFO ] Flow matrix only has 72 transitions (discarded 99 similar events)
[2025-06-07 19:18:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 71/147 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/148 variables, and 103 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2068 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 71/147 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 96/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/148 variables, and 199 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2150 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4237ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4237ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/404 places, 171/634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4457 ms. Remains : 76/404 places, 171/634 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLCardinality-02 finished in 4541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 634/634 transitions.
Graph (trivial) has 412 edges and 404 vertex of which 192 / 404 are part of one of the 25 SCC in 2 ms
Free SCC test removed 167 places
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 236 transition count 409
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 88 rules applied. Total rules applied 129 place count 196 transition count 361
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 152 place count 173 transition count 361
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 152 place count 173 transition count 358
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 170 transition count 358
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 177 place count 151 transition count 304
Iterating global reduction 3 with 19 rules applied. Total rules applied 196 place count 151 transition count 304
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 206 place count 151 transition count 294
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 316 place count 96 transition count 239
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 323 place count 89 transition count 203
Iterating global reduction 4 with 7 rules applied. Total rules applied 330 place count 89 transition count 203
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 337 place count 89 transition count 196
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 341 place count 87 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 348 place count 87 transition count 195
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 349 place count 86 transition count 191
Iterating global reduction 5 with 1 rules applied. Total rules applied 350 place count 86 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 351 place count 86 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 353 place count 84 transition count 188
Applied a total of 353 rules in 61 ms. Remains 84 /404 variables (removed 320) and now considering 188/634 (removed 446) transitions.
[2025-06-07 19:18:16] [INFO ] Flow matrix only has 84 transitions (discarded 104 similar events)
// Phase 1: matrix 84 rows 84 cols
[2025-06-07 19:18:16] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:18:16] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-07 19:18:16] [INFO ] Flow matrix only has 84 transitions (discarded 104 similar events)
[2025-06-07 19:18:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:18:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-07 19:18:16] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:18:16] [INFO ] Redundant transitions in 6 ms returned []
Running 157 sub problems to find dead transitions.
[2025-06-07 19:18:16] [INFO ] Flow matrix only has 84 transitions (discarded 104 similar events)
[2025-06-07 19:18:16] [INFO ] Invariant cache hit.
[2025-06-07 19:18:16] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 83/167 variables, 84/111 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/168 variables, and 124 constraints, problems are : Problem set: 0 solved, 157 unsolved in 3717 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 84/84 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 83/167 variables, 84/111 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 157/281 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/168 variables, and 281 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4448 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 84/84 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8185ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 8185ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/404 places, 188/634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8423 ms. Remains : 84/404 places, 188/634 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T1U-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLCardinality-04 finished in 8468 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(F(p1))))'
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 634/634 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 387 transition count 617
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 387 transition count 617
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 377 transition count 607
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 377 transition count 607
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 374 transition count 604
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 374 transition count 604
Applied a total of 60 rules in 41 ms. Remains 374 /404 variables (removed 30) and now considering 604/634 (removed 30) transitions.
// Phase 1: matrix 604 rows 374 cols
[2025-06-07 19:18:24] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:18:24] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-07 19:18:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:18:25] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2025-06-07 19:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/374 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (OVERLAPS) 604/978 variables, 374/401 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 401 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/374 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (OVERLAPS) 604/978 variables, 374/401 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/978 variables, 603/1004 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:19:16] [INFO ] Deduced a trap along path composed of 13 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1005 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 374/404 places, 604/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60543 ms. Remains : 374/404 places, 604/634 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLCardinality-05
Stuttering criterion allowed to conclude after 1268 steps with 2 reset in 6 ms.
FORMULA Champagne-PT-H07T1U-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLCardinality-05 finished in 60656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 634/634 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 384 transition count 614
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 384 transition count 614
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 373 transition count 603
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 373 transition count 603
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 370 transition count 600
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 370 transition count 600
Applied a total of 68 rules in 17 ms. Remains 370 /404 variables (removed 34) and now considering 600/634 (removed 34) transitions.
// Phase 1: matrix 600 rows 370 cols
[2025-06-07 19:19:25] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:19:25] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-07 19:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:19:25] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2025-06-07 19:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/970 variables, 370/397 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 970/970 variables, and 397 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/970 variables, 370/397 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/970 variables, 599/996 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:20:17] [INFO ] Deduced a trap along path composed of 13 places in 37 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 1)
(t5 1)
(t6 1)
(t7 3)
(t8 1)
(t9 1)
(t10 0)
(t11 1)
(t12 1)
(t13 0)
(t14 1)
(t15 1)
(t16 1)
(t17 0)
(t18 3)
(t19 0)
(t20 3)
(t21 1)
(t22 0)
(t23 0)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 0)
(t31 0)
(t32 1)
(t33 0)
(t34 1)
(t35 1)
(t36 1)
(t37 0)
(t38 0)
(t39 0)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 0)
(t46 1)
(t47 1)
(t48 0)
(t49 1)
(t50 2)
(t51 0)
(t52 0)
(t53 0)
(t54 0)
(t55 1)
(t56 0)
(t57 1)
(t58 1)
(t59 1)
(t60 1)
(t61 2)
(t62 0)
(t63 2)
(t64 1)
(t65 1)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 1)
(t77 0)
(t78 1)
(t79 1)
(t80 1)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 1)
(t92 0)
(t93 1)
(t94 1)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 1)
(t106 0)
(t107 1)
(t108 1)
(t109 1)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 2)
(t116 2)
(t117 2)
(t118 0)
(t119 0)
(t120 1)
(t121 0)
(t122 1)
(t123 1)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 3)
(t131 3)
(t132 3)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 1)
(t139 1)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 1)
(t146 1)
(t147 1)
(t148 0)
(t149 0)
(t150 1)
(t151 0)
(t152 1)
(t153 1)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 2)
(t160 2)
(t161 2)
(t162 0)
(t163 0)
(t164 1)
(t165 0)
(t166 1)
(t167 1)
(t168 4)
(t169 1)
(t170 1)
(t171 1)
(t172 2)
(t173 2)
(t174 1)
(t175 2)
(t176 2)
(t177 1)
(t178 0)
(t179 4)
(t180 0)
(t181 4)
(t182 1)
(t183 5)
(t184 1)
(t185 1)
(t186 2)
(t187 3)
(t188 1)
(t189 0)
(t190 1)
(t191 1)
(t192 1)
(t193 1)
(t194 5)
(t195 0)
(t196 5)
(t197 1)
(t198 3)
(t199 1)
(t200 1)
(t201 0)
(t202 1)
(t203 2)
(t204 1)
(t205 2)
(t206 2)
(t207 1)
(t208 0)
(t209 3)
(t210 0)
(t211 3)
(t212 4)
(t213 1)
(t214 1)
(t215 1)
(t216 2)
(t217 2)
(t218 1)
(t219 2)
(t220 2)
(t221 1)
(t222 0)
(t223 4)
(t224 0)
(t225 4)
(t226 1)
(t227 1)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 4)
(t234 4)
(t235 4)
(t236 0)
(t237 0)
(t238 1)
(t239 0)
(t240 1)
(t241 1)
(t242 1)
(t243 0)
(t244 0)
(t245 0)
(t246 0)
(t247 0)
(t248 6)
(t249 6)
(t250 6)
(t251 0)
(t252 0)
(t253 1)
(t254 0)
(t255 1)
(t256 1)
(t257 1)
(t258 0)
(t259 0)
(t260 0)
(t261 0)
(t262 0)
(t263 4)
(t264 4)
(t265 4)
(t266 0)
(t267 0)
(t268 1)
(t269 0)
(t270 1)
(t271 1)
(t272 1)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 3)
(t279 3)
(t280 3)
(t281 0)
(t282 0)
(t283 1)
(t284 0)
(t285 1)
(t286 1)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 2)
(t293 2)
(t294 2)
(t295 0)
(t296 0)
(t297 1)
(t298 0)
(t299 1)
(t300 1)
(t301 6)
(t302 3)
(t303 3)
(t304 0)
(t305 3)
(t306 1)
(t307 1)
(t308 2)
(t309 2)
(t310 1)
(t311 1)
(t312 6)
(t313 1)
(t314 6)
(t315 1)
(t316 5)
(t317 2)
(t318 2)
(t319 0)
(t320 2)
(t321 1)
(t322 1)
(t323 2)
(t324 2)
(t325 1)
(t326 1)
(t327 5)
(t328 1)
(t329 5)
(t330 1)
(t331 4)
(t332 1)
(t333 1)
(t334 timeout
0)
(t335 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 970/970 variables, and 997 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 370/404 places, 600/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60463 ms. Remains : 370/404 places, 600/634 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLCardinality-06
Stuttering criterion allowed to conclude after 535 steps with 4 reset in 5 ms.
FORMULA Champagne-PT-H07T1U-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLCardinality-06 finished in 60591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 634/634 transitions.
Graph (trivial) has 418 edges and 404 vertex of which 207 / 404 are part of one of the 27 SCC in 1 ms
Free SCC test removed 180 places
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 223 transition count 398
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 85 rules applied. Total rules applied 123 place count 186 transition count 350
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 146 place count 163 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 146 place count 163 transition count 349
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 162 transition count 349
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 168 place count 142 transition count 294
Iterating global reduction 3 with 20 rules applied. Total rules applied 188 place count 142 transition count 294
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 198 place count 142 transition count 284
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 306 place count 88 transition count 230
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 315 place count 79 transition count 186
Iterating global reduction 4 with 9 rules applied. Total rules applied 324 place count 79 transition count 186
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 333 place count 79 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 335 place count 77 transition count 175
Applied a total of 335 rules in 29 ms. Remains 77 /404 variables (removed 327) and now considering 175/634 (removed 459) transitions.
[2025-06-07 19:20:25] [INFO ] Flow matrix only has 73 transitions (discarded 102 similar events)
// Phase 1: matrix 73 rows 77 cols
[2025-06-07 19:20:25] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:20:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-07 19:20:25] [INFO ] Flow matrix only has 73 transitions (discarded 102 similar events)
[2025-06-07 19:20:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:20:25] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:20:25] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-07 19:20:25] [INFO ] Flow matrix only has 73 transitions (discarded 102 similar events)
[2025-06-07 19:20:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 3/77 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 72/149 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/150 variables, and 104 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 3/77 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 72/149 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 102/206 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/150 variables, and 206 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2255 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4380ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 4380ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/404 places, 175/634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4529 ms. Remains : 77/404 places, 175/634 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLCardinality-07 finished in 4579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 634/634 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 385 transition count 615
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 385 transition count 615
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 374 transition count 604
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 374 transition count 604
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 371 transition count 601
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 371 transition count 601
Applied a total of 66 rules in 19 ms. Remains 371 /404 variables (removed 33) and now considering 601/634 (removed 33) transitions.
// Phase 1: matrix 601 rows 371 cols
[2025-06-07 19:20:30] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:20:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-07 19:20:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:20:30] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-07 19:20:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/972 variables, 371/398 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 972/972 variables, and 398 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/972 variables, 371/398 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 600/998 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:21:22] [INFO ] Deduced a trap along path composed of 13 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 999 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 371/404 places, 601/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60423 ms. Remains : 371/404 places, 601/634 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H07T1U-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H07T1U-LTLCardinality-08 finished in 60821 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(((X(X((!p0&&X(F(!p0)))))&&G(p1))||G(!p0)))))'
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 634/634 transitions.
Graph (trivial) has 417 edges and 404 vertex of which 193 / 404 are part of one of the 25 SCC in 1 ms
Free SCC test removed 168 places
Ensure Unique test removed 186 transitions
Reduce isomorphic transitions removed 186 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 235 transition count 408
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 87 rules applied. Total rules applied 127 place count 196 transition count 360
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 150 place count 173 transition count 360
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 150 place count 173 transition count 357
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 156 place count 170 transition count 357
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 176 place count 150 transition count 299
Iterating global reduction 3 with 20 rules applied. Total rules applied 196 place count 150 transition count 299
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 207 place count 150 transition count 288
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 323 place count 92 transition count 230
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 330 place count 85 transition count 195
Iterating global reduction 4 with 7 rules applied. Total rules applied 337 place count 85 transition count 195
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 344 place count 85 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 348 place count 83 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 356 place count 83 transition count 187
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 357 place count 82 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 358 place count 82 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 359 place count 82 transition count 181
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 361 place count 80 transition count 179
Applied a total of 361 rules in 40 ms. Remains 80 /404 variables (removed 324) and now considering 179/634 (removed 455) transitions.
[2025-06-07 19:21:31] [INFO ] Flow matrix only has 78 transitions (discarded 101 similar events)
// Phase 1: matrix 78 rows 80 cols
[2025-06-07 19:21:31] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:21:31] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 19:21:31] [INFO ] Flow matrix only has 78 transitions (discarded 101 similar events)
[2025-06-07 19:21:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:21:31] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:21:31] [INFO ] Redundant transitions in 2 ms returned []
Running 113 sub problems to find dead transitions.
[2025-06-07 19:21:31] [INFO ] Flow matrix only has 78 transitions (discarded 101 similar events)
[2025-06-07 19:21:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 3/80 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 77/157 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/158 variables, and 107 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2449 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 3/80 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 77/157 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 113/220 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/157 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/158 variables, and 220 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2571 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5030ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 5031ms
Starting structural reductions in SI_LTL mode, iteration 1 : 80/404 places, 179/634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5214 ms. Remains : 80/404 places, 179/634 transitions.
Stuttering acceptance computed with spot in 315 ms :[p0, p0, p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : Champagne-PT-H07T1U-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T1U-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLCardinality-09 finished in 5551 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)&&(p1||X(X(p2)))))))'
Support contains 6 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 634/634 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 388 transition count 618
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 388 transition count 618
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 380 transition count 610
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 380 transition count 610
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 377 transition count 607
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 377 transition count 607
Applied a total of 54 rules in 23 ms. Remains 377 /404 variables (removed 27) and now considering 607/634 (removed 27) transitions.
// Phase 1: matrix 607 rows 377 cols
[2025-06-07 19:21:36] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:21:36] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-07 19:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:21:37] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2025-06-07 19:21: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/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:21:48] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:21:48] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:21:48] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:21:49] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 4 (OVERLAPS) 607/984 variables, 377/408 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/984 variables, and 408 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 4 (OVERLAPS) 607/984 variables, 377/408 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/984 variables, 606/1014 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:19] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:19] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:20] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:20] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:21] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:21] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:21] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 8/1022 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:29] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:29] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:30] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:22:32] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 1026 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 377/404 places, 607/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60441 ms. Remains : 377/404 places, 607/634 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 194 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T1U-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLCardinality-11 finished in 60703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 634/634 transitions.
Graph (trivial) has 418 edges and 404 vertex of which 206 / 404 are part of one of the 28 SCC in 0 ms
Free SCC test removed 178 places
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 225 transition count 400
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 87 rules applied. Total rules applied 127 place count 186 transition count 352
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 150 place count 163 transition count 352
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 171 place count 142 transition count 293
Iterating global reduction 3 with 21 rules applied. Total rules applied 192 place count 142 transition count 293
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 203 place count 142 transition count 282
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 311 place count 88 transition count 228
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 319 place count 80 transition count 191
Iterating global reduction 4 with 8 rules applied. Total rules applied 327 place count 80 transition count 191
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 335 place count 80 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 337 place count 78 transition count 181
Applied a total of 337 rules in 24 ms. Remains 78 /404 variables (removed 326) and now considering 181/634 (removed 453) transitions.
[2025-06-07 19:22:37] [INFO ] Flow matrix only has 75 transitions (discarded 106 similar events)
// Phase 1: matrix 75 rows 78 cols
[2025-06-07 19:22:37] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:22:37] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-07 19:22:37] [INFO ] Flow matrix only has 75 transitions (discarded 106 similar events)
[2025-06-07 19:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:22:37] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:22:37] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-07 19:22:37] [INFO ] Flow matrix only has 75 transitions (discarded 106 similar events)
[2025-06-07 19: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/76 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 74/152 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/153 variables, and 105 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2149 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 74/152 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 105/210 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/153 variables, and 210 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2328 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4486ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 4486ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/404 places, 181/634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4644 ms. Remains : 78/404 places, 181/634 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLCardinality-12
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLCardinality-12 finished in 4693 ms.
All properties solved by simple procedures.
Total runtime 394215 ms.
BK_STOP 1749324162223
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-H07T1U"
export BK_EXAMINATION="LTLCardinality"
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-H07T1U, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339200083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H07T1U.tgz
mv Champagne-PT-H07T1U execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;