Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339100019.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-H04T2O, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339100019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.0K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 13K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:35 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 71K 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-H04T2O-LTLCardinality-00
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-01
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-02
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-03
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-04
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-05
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-06
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-07
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-08
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-09
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-10
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-11
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-12
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-13
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-14
FORMULA_NAME Champagne-PT-H04T2O-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749317999919

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-H04T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 17:40:01] [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 17:40:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:40:01] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2025-06-07 17:40:01] [INFO ] Transformed 417 places.
[2025-06-07 17:40:01] [INFO ] Transformed 494 transitions.
[2025-06-07 17:40:01] [INFO ] Found NUPN structural information;
[2025-06-07 17:40:01] [INFO ] Parsed PT model containing 417 places and 494 transitions and 1106 arcs in 161 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 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H04T2O-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T2O-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 494/494 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 351 transition count 428
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 351 transition count 428
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 178 place count 305 transition count 382
Iterating global reduction 0 with 46 rules applied. Total rules applied 224 place count 305 transition count 382
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 248 place count 281 transition count 358
Iterating global reduction 0 with 24 rules applied. Total rules applied 272 place count 281 transition count 358
Applied a total of 272 rules in 93 ms. Remains 281 /417 variables (removed 136) and now considering 358/494 (removed 136) transitions.
// Phase 1: matrix 358 rows 281 cols
[2025-06-07 17:40:01] [INFO ] Computed 11 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:40:01] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-06-07 17:40:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:40:02] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2025-06-07 17:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:07] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:07] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:07] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:08] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:08] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:08] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:10] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:10] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:10] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:10] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:11] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (OVERLAPS) 358/639 variables, 281/303 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 303 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 358/639 variables, 281/303 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 357/660 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:38] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:39] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:39] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 3/663 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:43] [INFO ] Deduced a trap composed of 90 places in 66 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:51] [INFO ] Deduced a trap along path composed of 22 places in 52 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:58] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 666 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 281/417 places, 358/494 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60737 ms. Remains : 281/417 places, 358/494 transitions.
Support contains 30 out of 281 places after structural reductions.
[2025-06-07 17:41:02] [INFO ] Flatten gal took : 42 ms
[2025-06-07 17:41:02] [INFO ] Flatten gal took : 21 ms
[2025-06-07 17:41:02] [INFO ] Input system was already deterministic with 358 transitions.
Support contains 29 out of 281 places (down from 30) after GAL structural reductions.
RANDOM walk for 30714 steps (99 resets) in 580 ms. (52 steps per ms) remains 0/15 properties
Computed a total of 18 stabilizing places and 18 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' '!(F(p0))'
Support contains 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 358/358 transitions.
Graph (trivial) has 301 edges and 281 vertex of which 185 / 281 are part of one of the 11 SCC in 2 ms
Free SCC test removed 174 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 106 transition count 124
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 52 rules applied. Total rules applied 89 place count 70 transition count 108
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 96 place count 63 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 96 place count 63 transition count 107
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 98 place count 62 transition count 107
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 109 place count 51 transition count 82
Iterating global reduction 3 with 11 rules applied. Total rules applied 120 place count 51 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 126 place count 51 transition count 76
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 160 place count 34 transition count 59
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 33 transition count 57
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 33 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 33 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 31 transition count 54
Applied a total of 165 rules in 30 ms. Remains 31 /281 variables (removed 250) and now considering 54/358 (removed 304) transitions.
[2025-06-07 17:41:03] [INFO ] Flow matrix only has 31 transitions (discarded 23 similar events)
// Phase 1: matrix 31 rows 31 cols
[2025-06-07 17:41:03] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-07 17:41:03] [INFO ] Flow matrix only has 31 transitions (discarded 23 similar events)
[2025-06-07 17:41:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:41:03] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2025-06-07 17:41:03] [INFO ] Flow matrix only has 31 transitions (discarded 23 similar events)
[2025-06-07 17:41:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 30/61 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/62 variables, and 42 constraints, problems are : Problem set: 0 solved, 25 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 30/61 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 25 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 654ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/281 places, 54/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 795 ms. Remains : 31/281 places, 54/358 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H04T2O-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLCardinality-01 finished in 1017 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(F(p0))))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 358/358 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 265 transition count 342
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 265 transition count 342
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 258 transition count 335
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 258 transition count 335
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 256 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 256 transition count 333
Applied a total of 50 rules in 15 ms. Remains 256 /281 variables (removed 25) and now considering 333/358 (removed 25) transitions.
// Phase 1: matrix 333 rows 256 cols
[2025-06-07 17:41:03] [INFO ] Computed 11 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:04] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-07 17:41:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:04] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-07 17:41:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 333/589 variables, 256/267 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 0/589 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 267 constraints, problems are : Problem set: 0 solved, 332 unsolved in 20165 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 333/589 variables, 256/267 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 332/599 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:33] [INFO ] Deduced a trap along path composed of 22 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:37] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 332 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: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 601 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50210ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 50211ms
Starting structural reductions in LTL mode, iteration 1 : 256/281 places, 333/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50420 ms. Remains : 256/281 places, 333/358 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 190 ms.
Product exploration explored 100000 steps with 33333 reset in 139 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H04T2O-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H04T2O-LTLCardinality-02 finished in 50912 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(F(p0))))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 358/358 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 264 transition count 341
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 264 transition count 341
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 255 transition count 332
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 255 transition count 332
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 253 transition count 330
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 253 transition count 330
Applied a total of 56 rules in 19 ms. Remains 253 /281 variables (removed 28) and now considering 330/358 (removed 28) transitions.
// Phase 1: matrix 330 rows 253 cols
[2025-06-07 17:41:54] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:54] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 17:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:55] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2025-06-07 17:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 330/583 variables, 253/264 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (OVERLAPS) 0/583 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 264 constraints, problems are : Problem set: 0 solved, 329 unsolved in 19594 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 330/583 variables, 253/264 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 329/593 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:42:22] [INFO ] Deduced a trap along path composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 0/583 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 594 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49633ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 49634ms
Starting structural reductions in LTL mode, iteration 1 : 253/281 places, 330/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49833 ms. Remains : 253/281 places, 330/358 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 99 ms.
Product exploration explored 100000 steps with 33333 reset in 99 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 9 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H04T2O-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H04T2O-LTLCardinality-03 finished in 50151 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 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 358/358 transitions.
Graph (trivial) has 299 edges and 281 vertex of which 185 / 281 are part of one of the 11 SCC in 1 ms
Free SCC test removed 174 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 106 transition count 126
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 83 place count 72 transition count 112
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 89 place count 66 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 89 place count 66 transition count 111
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 91 place count 65 transition count 111
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 102 place count 54 transition count 86
Iterating global reduction 3 with 11 rules applied. Total rules applied 113 place count 54 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 119 place count 54 transition count 80
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 153 place count 37 transition count 63
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 36 transition count 61
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 36 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 36 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 35 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 160 place count 33 transition count 58
Applied a total of 160 rules in 38 ms. Remains 33 /281 variables (removed 248) and now considering 58/358 (removed 300) transitions.
[2025-06-07 17:42:45] [INFO ] Flow matrix only has 36 transitions (discarded 22 similar events)
// Phase 1: matrix 36 rows 33 cols
[2025-06-07 17:42:45] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-07 17:42:45] [INFO ] Flow matrix only has 36 transitions (discarded 22 similar events)
[2025-06-07 17:42:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:42:45] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
[2025-06-07 17:42:45] [INFO ] Flow matrix only has 36 transitions (discarded 22 similar events)
[2025-06-07 17:42:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 35/68 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/68 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/69 variables, and 44 constraints, problems are : Problem set: 0 solved, 29 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 35/68 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/69 variables, and 73 constraints, problems are : Problem set: 0 solved, 29 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 753ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 754ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/281 places, 58/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 863 ms. Remains : 33/281 places, 58/358 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLCardinality-05
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H04T2O-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLCardinality-05 finished in 916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 358/358 transitions.
Graph (trivial) has 293 edges and 281 vertex of which 175 / 281 are part of one of the 11 SCC in 1 ms
Free SCC test removed 164 places
Ensure Unique test removed 183 transitions
Reduce isomorphic transitions removed 183 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 116 transition count 137
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 54 rules applied. Total rules applied 92 place count 79 transition count 120
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 100 place count 71 transition count 120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 100 place count 71 transition count 118
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 69 transition count 118
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 114 place count 59 transition count 94
Iterating global reduction 3 with 10 rules applied. Total rules applied 124 place count 59 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 130 place count 59 transition count 88
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 168 place count 40 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 39 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 39 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 39 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 37 transition count 64
Applied a total of 173 rules in 17 ms. Remains 37 /281 variables (removed 244) and now considering 64/358 (removed 294) transitions.
[2025-06-07 17:42:45] [INFO ] Flow matrix only has 39 transitions (discarded 25 similar events)
// Phase 1: matrix 39 rows 37 cols
[2025-06-07 17:42:45] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:45] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 17:42:45] [INFO ] Flow matrix only has 39 transitions (discarded 25 similar events)
[2025-06-07 17:42:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:42:46] [INFO ] Redundant transitions in 1 ms returned []
Running 35 sub problems to find dead transitions.
[2025-06-07 17:42:46] [INFO ] Flow matrix only has 39 transitions (discarded 25 similar events)
[2025-06-07 17:42:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 38/75 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/76 variables, and 48 constraints, problems are : Problem set: 0 solved, 35 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 38/75 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 35/83 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/76 variables, and 83 constraints, problems are : Problem set: 0 solved, 35 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 929ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 929ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/281 places, 64/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1017 ms. Remains : 37/281 places, 64/358 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T2O-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T2O-LTLCardinality-06 finished in 1137 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((X(X(X(F(p0))))||(p1&&(p2||F(p3))))))'
Support contains 8 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 358/358 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 268 transition count 345
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 268 transition count 345
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 261 transition count 338
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 261 transition count 338
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 259 transition count 336
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 259 transition count 336
Applied a total of 44 rules in 11 ms. Remains 259 /281 variables (removed 22) and now considering 336/358 (removed 22) transitions.
// Phase 1: matrix 336 rows 259 cols
[2025-06-07 17:42:47] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 17:42:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:47] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2025-06-07 17:42:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:42:51] [INFO ] Deduced a trap composed of 48 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 17:42:51] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:42:52] [INFO ] Deduced a trap composed of 48 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 17:42:52] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:42:52] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/595 variables, 259/275 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 0/595 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 275 constraints, problems are : Problem set: 0 solved, 335 unsolved in 24139 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/595 variables, 259/275 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 335/610 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:19] [INFO ] Deduced a trap along path composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:24] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:28] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:33] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/595 variables, and 614 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54178ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 54179ms
Starting structural reductions in LTL mode, iteration 1 : 259/281 places, 336/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54407 ms. Remains : 259/281 places, 336/358 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : Champagne-PT-H04T2O-LTLCardinality-12
Product exploration explored 100000 steps with 1358 reset in 200 ms.
Product exploration explored 100000 steps with 1318 reset in 186 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p3 p0), (X (NOT p3))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 7 states, 9 edges and 4 AP (stutter sensitive) to 7 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (139 resets) in 111 ms. (357 steps per ms) remains 1/6 properties
BEST_FIRST walk for 10871 steps (9 resets) in 23 ms. (452 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2) p3 p0), (X (NOT p3))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p3))), (F (NOT (OR p3 (NOT p1) p2))), (F (NOT p3)), (F p2)]
Knowledge based reduction with 2 factoid took 343 ms. Reduced automaton from 7 states, 9 edges and 4 AP (stutter sensitive) to 7 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Support contains 8 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 336/336 transitions.
Applied a total of 0 rules in 7 ms. Remains 259 /259 variables (removed 0) and now considering 336/336 (removed 0) transitions.
[2025-06-07 17:43:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:43:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-07 17:43:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:43:43] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2025-06-07 17:43:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:47] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:48] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:48] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:48] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:48] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/595 variables, 259/275 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 0/595 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 275 constraints, problems are : Problem set: 0 solved, 335 unsolved in 23727 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/595 variables, 259/275 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 335/610 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:15] [INFO ] Deduced a trap along path composed of 23 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:20] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:24] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:29] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/595 variables, and 614 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53763ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 53764ms
Finished structural reductions in LTL mode , in 1 iterations and 53966 ms. Remains : 259/259 places, 336/336 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p3 (NOT p2) p0), (X (NOT p3))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 7 states, 9 edges and 4 AP (stutter sensitive) to 7 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (132 resets) in 108 ms. (366 steps per ms) remains 1/6 properties
BEST_FIRST walk for 4165 steps (3 resets) in 8 ms. (462 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p3 (NOT p2) p0), (X (NOT p3))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p3))), (F (NOT (OR p3 (NOT p1) p2))), (F (NOT p3)), (F p2)]
Knowledge based reduction with 2 factoid took 325 ms. Reduced automaton from 7 states, 9 edges and 4 AP (stutter sensitive) to 7 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 265 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 1517 reset in 125 ms.
Product exploration explored 100000 steps with 1348 reset in 256 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 278 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Support contains 8 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 336/336 transitions.
Graph (trivial) has 269 edges and 259 vertex of which 164 / 259 are part of one of the 11 SCC in 1 ms
Free SCC test removed 153 places
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 106 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 37 place count 106 transition count 154
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 37 place count 106 transition count 154
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 46 place count 106 transition count 154
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 62 place count 90 transition count 124
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 78 place count 90 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 90 transition count 118
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 90 place count 84 transition count 112
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 84 transition count 112
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 114 place count 84 transition count 112
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 126 place count 72 transition count 100
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 138 place count 72 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 72 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 71 transition count 102
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 71 transition count 102
Deduced a syphon composed of 26 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 71 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 70 transition count 98
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 70 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 69 transition count 97
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 69 transition count 97
Deduced a syphon composed of 25 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 69 transition count 95
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 149 rules in 38 ms. Remains 69 /259 variables (removed 190) and now considering 95/336 (removed 241) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:44:39] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2025-06-07 17:44:39] [INFO ] Flow matrix only has 70 transitions (discarded 25 similar events)
// Phase 1: matrix 70 rows 69 cols
[2025-06-07 17:44:39] [INFO ] Computed 11 invariants in 1 ms
[2025-06-07 17:44:39] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 4 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 12/23 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/23 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 69/138 variables, 69/92 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 7/99 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/99 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 1/139 variables, 1/100 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/100 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/139 variables, 0/100 constraints. Problems are: Problem set: 25 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 100 constraints, problems are : Problem set: 25 solved, 69 unsolved in 2335 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 25 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 26/69 variables, 11/11 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 12/23 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/23 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 69/138 variables, 69/92 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 7/99 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 69/168 constraints. Problems are: Problem set: 25 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:43] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/169 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/169 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/170 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/170 constraints. Problems are: Problem set: 25 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/170 constraints. Problems are: Problem set: 25 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 170 constraints, problems are : Problem set: 25 solved, 69 unsolved in 4272 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 69/94 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6615ms problems are : Problem set: 25 solved, 69 unsolved
Search for dead transitions found 25 dead transitions in 6616ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 69/259 places, 70/336 transitions.
Graph (complete) has 229 edges and 69 vertex of which 44 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 ms
Discarding 25 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 44 /69 variables (removed 25) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/259 places, 70/336 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6678 ms. Remains : 44/259 places, 70/336 transitions.
Built C files in :
/tmp/ltsmin17938385658604562553
[2025-06-07 17:44:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17938385658604562553
Running compilation step : cd /tmp/ltsmin17938385658604562553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 551 ms.
Running link step : cd /tmp/ltsmin17938385658604562553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17938385658604562553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8187448973569190447.hoa' '--buchi-type=spotba'
LTSmin run took 333 ms.
FORMULA Champagne-PT-H04T2O-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H04T2O-LTLCardinality-12 finished in 120545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 358/358 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 264 transition count 341
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 264 transition count 341
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 256 transition count 333
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 256 transition count 333
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 255 transition count 332
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 255 transition count 332
Applied a total of 52 rules in 20 ms. Remains 255 /281 variables (removed 26) and now considering 332/358 (removed 26) transitions.
// Phase 1: matrix 332 rows 255 cols
[2025-06-07 17:44:47] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:44:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-07 17:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:44:47] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2025-06-07 17:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/255 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 332/587 variables, 255/266 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (OVERLAPS) 0/587 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 266 constraints, problems are : Problem set: 0 solved, 331 unsolved in 20201 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/255 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 332/587 variables, 255/266 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 331/597 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:16] [INFO ] Deduced a trap along path composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 0/587 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 598 constraints, problems are : Problem set: 0 solved, 331 unsolved in 29224 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49445ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 49445ms
Starting structural reductions in LTL mode, iteration 1 : 255/281 places, 332/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49672 ms. Remains : 255/281 places, 332/358 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Champagne-PT-H04T2O-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 10 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H04T2O-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H04T2O-LTLCardinality-14 finished in 50160 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(p0)&&F(p1)&&(G(p0) U X(p2)))))'
Support contains 6 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 358/358 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 266 transition count 343
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 266 transition count 343
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 259 transition count 336
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 259 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 258 transition count 335
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 258 transition count 335
Applied a total of 46 rules in 21 ms. Remains 258 /281 variables (removed 23) and now considering 335/358 (removed 23) transitions.
// Phase 1: matrix 335 rows 258 cols
[2025-06-07 17:45:37] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:37] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 17:45:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:37] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2025-06-07 17:45:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 1/258 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:42] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:42] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:43] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 335/593 variables, 258/272 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/593 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 272 constraints, problems are : Problem set: 0 solved, 334 unsolved in 23644 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 1/258 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 335/593 variables, 258/272 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 334/606 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:06] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:12] [INFO ] Deduced a trap along path composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/593 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 608 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53680ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 53681ms
Starting structural reductions in LTL mode, iteration 1 : 258/281 places, 335/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53884 ms. Remains : 258/281 places, 335/358 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND p0 (NOT p2)), (NOT p2), true, (NOT p0)]
Running random walk in product with property : Champagne-PT-H04T2O-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Product exploration explored 100000 steps with 33333 reset in 113 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 14 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H04T2O-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H04T2O-LTLCardinality-15 finished in 54424 ms.
All properties solved by simple procedures.
Total runtime 391068 ms.

BK_STOP 1749318392238

--------------------
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-H04T2O"
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-H04T2O, 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-174931339100019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H04T2O.tgz
mv Champagne-PT-H04T2O 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;