About the Execution of ITS-Tools for Champagne-PT-H05T2O
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 446854.00 | 0.00 | 0.00 | FTFFFFFTTFFFFTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339100043.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-H05T2O, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339100043
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.3K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K 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:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 11:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 6 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:36 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 101K 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-H05T2O-LTLCardinality-00
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-01
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-02
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-03
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-04
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-05
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-06
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-07
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-08
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-09
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-10
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-11
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-12
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-13
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-14
FORMULA_NAME Champagne-PT-H05T2O-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749319118740
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-H05T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 17:58:39] [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:58:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:58:40] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-06-07 17:58:40] [INFO ] Transformed 569 places.
[2025-06-07 17:58:40] [INFO ] Transformed 686 transitions.
[2025-06-07 17:58:40] [INFO ] Found NUPN structural information;
[2025-06-07 17:58:40] [INFO ] Parsed PT model containing 569 places and 686 transitions and 1566 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H05T2O-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T2O-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T2O-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T2O-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T2O-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T2O-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 686/686 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 473 transition count 590
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 473 transition count 590
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 255 place count 410 transition count 527
Iterating global reduction 0 with 63 rules applied. Total rules applied 318 place count 410 transition count 527
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 352 place count 376 transition count 493
Iterating global reduction 0 with 34 rules applied. Total rules applied 386 place count 376 transition count 493
Applied a total of 386 rules in 125 ms. Remains 376 /569 variables (removed 193) and now considering 493/686 (removed 193) transitions.
// Phase 1: matrix 493 rows 376 cols
[2025-06-07 17:58:40] [INFO ] Computed 15 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:40] [INFO ] Implicit Places using invariants in 327 ms returned []
[2025-06-07 17:58:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:41] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Running 492 sub problems to find dead transitions.
[2025-06-07 17:58:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:50] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 4 (OVERLAPS) 493/869 variables, 376/392 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/869 variables, and 392 constraints, problems are : Problem set: 0 solved, 492 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 492 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 4 (OVERLAPS) 493/869 variables, 376/392 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 492/884 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:27] [INFO ] Deduced a trap along path composed of 24 places in 58 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/869 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:41] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 8 ms to minimize.
SMT process timed out in 60180ms, After SMT, problems are : Problem set: 0 solved, 492 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 376/569 places, 493/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60923 ms. Remains : 376/569 places, 493/686 transitions.
Support contains 33 out of 376 places after structural reductions.
[2025-06-07 17:59:41] [INFO ] Flatten gal took : 49 ms
[2025-06-07 17:59:41] [INFO ] Flatten gal took : 23 ms
[2025-06-07 17:59:41] [INFO ] Input system was already deterministic with 493 transitions.
Support contains 32 out of 376 places (down from 33) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 26030 steps (71 resets) in 713 ms. (36 steps per ms) remains 0/17 properties
FORMULA Champagne-PT-H05T2O-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 20 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 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 493/493 transitions.
Graph (trivial) has 399 edges and 376 vertex of which 248 / 376 are part of one of the 15 SCC in 2 ms
Free SCC test removed 233 places
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 142 transition count 190
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 69 rules applied. Total rules applied 113 place count 99 transition count 164
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 126 place count 86 transition count 164
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 139 place count 73 transition count 132
Iterating global reduction 3 with 13 rules applied. Total rules applied 152 place count 73 transition count 132
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 160 place count 73 transition count 124
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 208 place count 49 transition count 100
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 211 place count 46 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 214 place count 46 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 217 place count 46 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 44 transition count 84
Applied a total of 219 rules in 33 ms. Remains 44 /376 variables (removed 332) and now considering 84/493 (removed 409) transitions.
[2025-06-07 17:59:42] [INFO ] Flow matrix only has 43 transitions (discarded 41 similar events)
// Phase 1: matrix 43 rows 44 cols
[2025-06-07 17:59:42] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:59:42] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 17:59:42] [INFO ] Flow matrix only has 43 transitions (discarded 41 similar events)
[2025-06-07 17:59:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:59:42] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:59:42] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-07 17:59:42] [INFO ] Flow matrix only has 43 transitions (discarded 41 similar events)
[2025-06-07 17:59:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 3/44 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 42/86 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/86 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/87 variables, and 59 constraints, problems are : Problem set: 0 solved, 47 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 3/44 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 42/86 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:43] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/87 variables, and 107 constraints, problems are : Problem set: 0 solved, 47 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1664ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1666ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/376 places, 84/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1791 ms. Remains : 44/376 places, 84/493 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H05T2O-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLCardinality-00 finished in 2037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)||(p1&&F(!p2))))||p0)))'
Support contains 5 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 493/493 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 363 transition count 480
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 363 transition count 480
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 354 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 354 transition count 471
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 349 transition count 466
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 349 transition count 466
Applied a total of 54 rules in 38 ms. Remains 349 /376 variables (removed 27) and now considering 466/493 (removed 27) transitions.
// Phase 1: matrix 466 rows 349 cols
[2025-06-07 17:59:44] [INFO ] Computed 15 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:59:44] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-07 17:59:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:59:44] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-07 17:59:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (OVERLAPS) 466/815 variables, 349/364 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 815/815 variables, and 364 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (OVERLAPS) 466/815 variables, 349/364 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 465/829 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:00:30] [INFO ] Deduced a trap along path composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:00:38] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:00:40] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/815 variables, and 832 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 349/376 places, 466/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60409 ms. Remains : 349/376 places, 466/493 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND p2 (NOT p1))]
Running random walk in product with property : Champagne-PT-H05T2O-LTLCardinality-03
Stuttering criterion allowed to conclude after 349 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H05T2O-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLCardinality-03 finished in 60705 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(G(p0))||(p0&&G(p1)))))'
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 493/493 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 363 transition count 480
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 363 transition count 480
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 353 transition count 470
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 353 transition count 470
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 349 transition count 466
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 349 transition count 466
Applied a total of 54 rules in 27 ms. Remains 349 /376 variables (removed 27) and now considering 466/493 (removed 27) transitions.
// Phase 1: matrix 466 rows 349 cols
[2025-06-07 18:00:44] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:00:44] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-07 18:00:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:00:45] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-07 18:00: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/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (OVERLAPS) 466/815 variables, 349/364 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 815/815 variables, and 364 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (OVERLAPS) 466/815 variables, 349/364 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 465/829 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:01:31] [INFO ] Deduced a trap along path composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:01:41] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 1/831 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/815 variables, and 831 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 349/376 places, 466/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60375 ms. Remains : 349/376 places, 466/493 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H05T2O-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 132 steps with 0 reset in 5 ms.
FORMULA Champagne-PT-H05T2O-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLCardinality-05 finished in 60593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&(F(!p0) U (F(p1) U p2))))'
Support contains 6 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 493/493 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 365 transition count 482
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 365 transition count 482
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 357 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 357 transition count 474
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 354 transition count 471
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 354 transition count 471
Applied a total of 44 rules in 29 ms. Remains 354 /376 variables (removed 22) and now considering 471/493 (removed 22) transitions.
// Phase 1: matrix 471 rows 354 cols
[2025-06-07 18:01:45] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:01:45] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-07 18:01:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:01:45] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2025-06-07 18:01: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/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (OVERLAPS) 471/825 variables, 354/369 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 825/825 variables, and 369 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (OVERLAPS) 471/825 variables, 354/369 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 470/839 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:32] [INFO ] Deduced a trap along path composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:41] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:42] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 825/825 variables, and 842 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 354/376 places, 471/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60393 ms. Remains : 354/376 places, 471/493 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p1) p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 230 ms.
Product exploration explored 100000 steps with 25000 reset in 163 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 130 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2869 steps (7 resets) in 38 ms. (73 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 136 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 354 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 471/471 transitions.
Applied a total of 0 rules in 7 ms. Remains 354 /354 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2025-06-07 18:02:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:02:47] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-07 18:02:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:02:47] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2025-06-07 18:02: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/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (OVERLAPS) 471/825 variables, 354/369 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 825/825 variables, and 369 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (OVERLAPS) 471/825 variables, 354/369 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 470/839 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:33] [INFO ] Deduced a trap along path composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:42] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:43] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 825/825 variables, and 842 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Finished structural reductions in LTL mode , in 1 iterations and 60338 ms. Remains : 354/354 places, 471/471 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 8567 steps (22 resets) in 49 ms. (171 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Product exploration explored 100000 steps with 25000 reset in 184 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 354/354 places, 471/471 transitions.
Graph (trivial) has 376 edges and 354 vertex of which 232 / 354 are part of one of the 15 SCC in 2 ms
Free SCC test removed 217 places
Ensure Unique test removed 243 transitions
Reduce isomorphic transitions removed 243 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 137 transition count 228
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 52 place count 137 transition count 216
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 52 place count 137 transition count 216
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 65 place count 137 transition count 216
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 93 place count 109 transition count 164
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 109 transition count 164
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 131 place count 109 transition count 154
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 141 place count 99 transition count 144
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 151 place count 99 transition count 144
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 178 place count 99 transition count 144
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 191 place count 86 transition count 131
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 204 place count 86 transition count 131
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 204 rules in 44 ms. Remains 86 /354 variables (removed 268) and now considering 131/471 (removed 340) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:03:49] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2025-06-07 18:03:49] [INFO ] Flow matrix only has 91 transitions (discarded 40 similar events)
// Phase 1: matrix 91 rows 86 cols
[2025-06-07 18:03:49] [INFO ] Computed 15 invariants in 1 ms
[2025-06-07 18:03:49] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:49] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:49] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:49] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:49] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:49] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:50] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:50] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:50] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 15/30 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/30 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 90/176 variables, 86/116 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 12/128 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/128 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/177 variables, 1/129 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/129 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/129 constraints. Problems are: Problem set: 39 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 129 constraints, problems are : Problem set: 39 solved, 91 unsolved in 3785 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 86/86 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 39 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 40/86 variables, 15/15 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 15/30 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/30 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 90/176 variables, 86/116 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 12/128 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 91/219 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/219 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/177 variables, 1/220 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/220 constraints. Problems are: Problem set: 39 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/220 constraints. Problems are: Problem set: 39 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 220 constraints, problems are : Problem set: 39 solved, 91 unsolved in 4983 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 86/86 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 91/130 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8792ms problems are : Problem set: 39 solved, 91 unsolved
Search for dead transitions found 39 dead transitions in 8792ms
Found 39 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 39 transitions
Dead transitions reduction (with SMT) removed 39 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 86/354 places, 92/471 transitions.
Graph (complete) has 385 edges and 86 vertex of which 47 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.3 ms
Discarding 39 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 47 /86 variables (removed 39) and now considering 92/92 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/354 places, 92/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8861 ms. Remains : 47/354 places, 92/471 transitions.
Built C files in :
/tmp/ltsmin6402696606095337531
[2025-06-07 18:03:57] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6402696606095337531
Running compilation step : cd /tmp/ltsmin6402696606095337531;'/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 781 ms.
Running link step : cd /tmp/ltsmin6402696606095337531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6402696606095337531;'/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/stateBased11846904562375802762.hoa' '--buchi-type=spotba'
LTSmin run took 218 ms.
FORMULA Champagne-PT-H05T2O-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H05T2O-LTLCardinality-07 finished in 133664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 493/493 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 361 transition count 478
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 361 transition count 478
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 349 transition count 466
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 349 transition count 466
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 345 transition count 462
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 345 transition count 462
Applied a total of 62 rules in 32 ms. Remains 345 /376 variables (removed 31) and now considering 462/493 (removed 31) transitions.
// Phase 1: matrix 462 rows 345 cols
[2025-06-07 18:03:59] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:59] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-07 18:03:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:59] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2025-06-07 18:03:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/807 variables, 345/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/807 variables, and 360 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/807 variables, 345/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 461/821 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:44] [INFO ] Deduced a trap along path composed of 22 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:48] [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/807 variables, 2/823 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:53] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:54] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/807 variables, and 825 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 345/376 places, 462/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60378 ms. Remains : 345/376 places, 462/493 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 142 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H05T2O-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H05T2O-LTLCardinality-08 finished in 60803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 493/493 transitions.
Graph (trivial) has 400 edges and 376 vertex of which 247 / 376 are part of one of the 16 SCC in 1 ms
Free SCC test removed 231 places
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 144 transition count 193
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 69 rules applied. Total rules applied 113 place count 101 transition count 167
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 126 place count 88 transition count 167
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 140 place count 74 transition count 134
Iterating global reduction 3 with 14 rules applied. Total rules applied 154 place count 74 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 162 place count 74 transition count 126
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 212 place count 49 transition count 101
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 215 place count 46 transition count 90
Iterating global reduction 4 with 3 rules applied. Total rules applied 218 place count 46 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 221 place count 46 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 44 transition count 85
Applied a total of 223 rules in 20 ms. Remains 44 /376 variables (removed 332) and now considering 85/493 (removed 408) transitions.
[2025-06-07 18:04:59] [INFO ] Flow matrix only has 43 transitions (discarded 42 similar events)
// Phase 1: matrix 43 rows 44 cols
[2025-06-07 18:04:59] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:04:59] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 18:04:59] [INFO ] Flow matrix only has 43 transitions (discarded 42 similar events)
[2025-06-07 18:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:04:59] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:04:59] [INFO ] Redundant transitions in 2 ms returned []
Running 43 sub problems to find dead transitions.
[2025-06-07 18:04:59] [INFO ] Flow matrix only has 43 transitions (discarded 42 similar events)
[2025-06-07 18:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 42/86 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 0/86 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/87 variables, and 59 constraints, problems are : Problem set: 0 solved, 43 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 42/86 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 43/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/87 variables, and 102 constraints, problems are : Problem set: 0 solved, 43 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1241ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/376 places, 85/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1346 ms. Remains : 44/376 places, 85/493 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLCardinality-10
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H05T2O-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLCardinality-10 finished in 1401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(X(X((F(p1)&&p0))))&&X(p1)))))'
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 493/493 transitions.
Graph (trivial) has 396 edges and 376 vertex of which 247 / 376 are part of one of the 15 SCC in 2 ms
Free SCC test removed 232 places
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 143 transition count 193
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 65 rules applied. Total rules applied 107 place count 102 transition count 169
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 121 place count 90 transition count 167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 125 place count 88 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 87 transition count 165
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 138 place count 75 transition count 137
Iterating global reduction 5 with 12 rules applied. Total rules applied 150 place count 75 transition count 137
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 157 place count 75 transition count 130
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 203 place count 52 transition count 107
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 206 place count 49 transition count 96
Iterating global reduction 6 with 3 rules applied. Total rules applied 209 place count 49 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 212 place count 49 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 214 place count 47 transition count 91
Applied a total of 214 rules in 23 ms. Remains 47 /376 variables (removed 329) and now considering 91/493 (removed 402) transitions.
[2025-06-07 18:05:01] [INFO ] Flow matrix only has 52 transitions (discarded 39 similar events)
// Phase 1: matrix 52 rows 47 cols
[2025-06-07 18:05:01] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:05:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-07 18:05:01] [INFO ] Flow matrix only has 52 transitions (discarded 39 similar events)
[2025-06-07 18:05:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:05:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 18:05:01] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:05:01] [INFO ] Redundant transitions in 2 ms returned []
Running 53 sub problems to find dead transitions.
[2025-06-07 18:05:01] [INFO ] Flow matrix only has 52 transitions (discarded 39 similar events)
[2025-06-07 18:05:01] [INFO ] Invariant cache hit.
[2025-06-07 18:05:01] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 51/98 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/99 variables, and 64 constraints, problems are : Problem set: 0 solved, 53 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 51/98 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 53 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1679ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1680ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/376 places, 91/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1798 ms. Remains : 47/376 places, 91/493 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T2O-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLCardinality-11 finished in 1950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 493/493 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 362 transition count 479
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 362 transition count 479
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 351 transition count 468
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 351 transition count 468
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 347 transition count 464
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 347 transition count 464
Applied a total of 58 rules in 24 ms. Remains 347 /376 variables (removed 29) and now considering 464/493 (removed 29) transitions.
// Phase 1: matrix 464 rows 347 cols
[2025-06-07 18:05:03] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:05:03] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-07 18:05:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:05:03] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-06-07 18:05: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/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/811 variables, 347/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 362 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/811 variables, 347/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 463/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:05:49] [INFO ] Deduced a trap along path composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 826 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in LTL mode, iteration 1 : 347/376 places, 464/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60366 ms. Remains : 347/376 places, 464/493 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 562 steps with 1 reset in 10 ms.
FORMULA Champagne-PT-H05T2O-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLCardinality-12 finished in 60572 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(p1)||p0) U G(!p1)))'
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 493/493 transitions.
Graph (trivial) has 397 edges and 376 vertex of which 233 / 376 are part of one of the 15 SCC in 1 ms
Free SCC test removed 218 places
Ensure Unique test removed 243 transitions
Reduce isomorphic transitions removed 243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 157 transition count 200
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 75 rules applied. Total rules applied 125 place count 108 transition count 174
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 139 place count 95 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 94 transition count 173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 140 place count 94 transition count 171
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 144 place count 92 transition count 171
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 156 place count 80 transition count 143
Iterating global reduction 4 with 12 rules applied. Total rules applied 168 place count 80 transition count 143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 175 place count 80 transition count 136
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 231 place count 52 transition count 108
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 233 place count 50 transition count 101
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 50 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 237 place count 50 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 239 place count 49 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 243 place count 49 transition count 98
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 244 place count 48 transition count 94
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 48 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 246 place count 48 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 46 transition count 91
Applied a total of 248 rules in 24 ms. Remains 46 /376 variables (removed 330) and now considering 91/493 (removed 402) transitions.
[2025-06-07 18:06:03] [INFO ] Flow matrix only has 47 transitions (discarded 44 similar events)
// Phase 1: matrix 47 rows 46 cols
[2025-06-07 18:06:03] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:06:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-07 18:06:03] [INFO ] Flow matrix only has 47 transitions (discarded 44 similar events)
[2025-06-07 18:06:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:06:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:06:03] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-07 18:06:03] [INFO ] Flow matrix only has 47 transitions (discarded 44 similar events)
[2025-06-07 18:06: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/44 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 46/92 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/93 variables, and 61 constraints, problems are : Problem set: 0 solved, 48 unsolved in 738 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 46/92 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/93 variables, and 109 constraints, problems are : Problem set: 0 solved, 48 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1505ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1505ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/376 places, 91/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1625 ms. Remains : 46/376 places, 91/493 transitions.
Stuttering acceptance computed with spot in 150 ms :[p1, (NOT p1), p1, true]
Running random walk in product with property : Champagne-PT-H05T2O-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T2O-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLCardinality-15 finished in 1791 ms.
All properties solved by simple procedures.
Total runtime 445595 ms.
BK_STOP 1749319565594
--------------------
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-H05T2O"
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-H05T2O, 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-174931339100043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H05T2O.tgz
mv Champagne-PT-H05T2O execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;