Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.3K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 11:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:41 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 179K 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-H08T0R-LTLFireability-00
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-01
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-02
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-03
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-04
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-05
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-06
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-07
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-08
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-09
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-10
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-11
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-12
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-13
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-14
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749326439128

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H08T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 20:00:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 20:00:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 20:00:40] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2025-06-07 20:00:40] [INFO ] Transformed 739 places.
[2025-06-07 20:00:40] [INFO ] Transformed 1088 transitions.
[2025-06-07 20:00:40] [INFO ] Found NUPN structural information;
[2025-06-07 20:00:40] [INFO ] Parsed PT model containing 739 places and 1088 transitions and 2936 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Champagne-PT-H08T0R-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H08T0R-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H08T0R-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H08T0R-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 739 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 739/739 places, 1088/1088 transitions.
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 180 place count 559 transition count 908
Iterating global reduction 0 with 180 rules applied. Total rules applied 360 place count 559 transition count 908
Discarding 102 places :
Symmetric choice reduction at 0 with 102 rule applications. Total rules 462 place count 457 transition count 806
Iterating global reduction 0 with 102 rules applied. Total rules applied 564 place count 457 transition count 806
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 631 place count 390 transition count 651
Iterating global reduction 0 with 67 rules applied. Total rules applied 698 place count 390 transition count 651
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 724 place count 390 transition count 625
Applied a total of 724 rules in 136 ms. Remains 390 /739 variables (removed 349) and now considering 625/1088 (removed 463) transitions.
// Phase 1: matrix 625 rows 390 cols
[2025-06-07 20:00:40] [INFO ] Computed 37 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:00:41] [INFO ] Implicit Places using invariants in 300 ms returned []
[2025-06-07 20:00:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:00:41] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 624 sub problems to find dead transitions.
[2025-06-07 20:00: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/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:00:52] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 4 (OVERLAPS) 625/1015 variables, 390/428 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1015/1015 variables, and 428 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 624 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 4 (OVERLAPS) 625/1015 variables, 390/428 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1015 variables, 624/1052 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:26] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1015 variables, 1/1053 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:40] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1015/1015 variables, and 1054 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 624 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in LTL mode, iteration 1 : 390/739 places, 625/1088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61028 ms. Remains : 390/739 places, 625/1088 transitions.
Support contains 37 out of 390 places after structural reductions.
[2025-06-07 20:01:41] [INFO ] Flatten gal took : 58 ms
[2025-06-07 20:01:41] [INFO ] Flatten gal took : 31 ms
[2025-06-07 20:01:42] [INFO ] Input system was already deterministic with 625 transitions.
RANDOM walk for 40000 steps (99 resets) in 918 ms. (43 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
[2025-06-07 20:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 328/390 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 625/1015 variables, 390/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1015 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1015 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1015/1015 variables, and 427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 328/390 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 625/1015 variables, 390/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1015 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1015 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1015 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1015/1015 variables, and 428 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 474ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 115 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 11 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 47 stabilizing places and 47 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' '!(G((X(!F(p0)) U F((X(p1) U !p0)))))'
Support contains 1 out of 390 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Graph (trivial) has 363 edges and 390 vertex of which 57 / 390 are part of one of the 12 SCC in 2 ms
Free SCC test removed 45 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 344 transition count 528
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 114 rules applied. Total rules applied 163 place count 296 transition count 462
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 34 rules applied. Total rules applied 197 place count 263 transition count 461
Reduce places removed 1 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 3 rules applied. Total rules applied 200 place count 262 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 261 transition count 459
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 201 place count 261 transition count 436
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 247 place count 238 transition count 436
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 261 place count 224 transition count 387
Iterating global reduction 5 with 14 rules applied. Total rules applied 275 place count 224 transition count 387
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 282 place count 224 transition count 380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 282 place count 224 transition count 378
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 286 place count 222 transition count 378
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 287 place count 221 transition count 371
Iterating global reduction 6 with 1 rules applied. Total rules applied 288 place count 221 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 289 place count 221 transition count 370
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 7 with 226 rules applied. Total rules applied 515 place count 108 transition count 257
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 517 place count 106 transition count 248
Iterating global reduction 7 with 2 rules applied. Total rules applied 519 place count 106 transition count 248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 521 place count 106 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 523 place count 104 transition count 244
Applied a total of 523 rules in 109 ms. Remains 104 /390 variables (removed 286) and now considering 244/625 (removed 381) transitions.
[2025-06-07 20:01:43] [INFO ] Flow matrix only has 107 transitions (discarded 137 similar events)
// Phase 1: matrix 107 rows 104 cols
[2025-06-07 20:01:43] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:01:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-07 20:01:43] [INFO ] Flow matrix only has 107 transitions (discarded 137 similar events)
[2025-06-07 20:01:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:01:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:01:43] [INFO ] Redundant transitions in 10 ms returned []
Running 168 sub problems to find dead transitions.
[2025-06-07 20:01:43] [INFO ] Flow matrix only has 107 transitions (discarded 137 similar events)
[2025-06-07 20:01:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 2/104 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 106/210 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/211 variables, and 141 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4501 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 2/104 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 106/210 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 168/309 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/211 variables, and 309 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4864 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9390ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 9391ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/390 places, 244/625 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9684 ms. Remains : 104/390 places, 244/625 transitions.
Stuttering acceptance computed with spot in 189 ms :[p0, p0]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-00 finished in 9935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(F(p0)))) U (F(p1) U X(p0)))))'
Support contains 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Graph (trivial) has 360 edges and 390 vertex of which 53 / 390 are part of one of the 11 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 347 transition count 528
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 121 rules applied. Total rules applied 173 place count 296 transition count 458
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 208 place count 261 transition count 458
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 208 place count 261 transition count 436
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 252 place count 239 transition count 436
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 266 place count 225 transition count 396
Iterating global reduction 3 with 14 rules applied. Total rules applied 280 place count 225 transition count 396
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 286 place count 225 transition count 390
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 286 place count 225 transition count 388
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 290 place count 223 transition count 388
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 291 place count 222 transition count 381
Iterating global reduction 4 with 1 rules applied. Total rules applied 292 place count 222 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 293 place count 222 transition count 380
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 5 with 228 rules applied. Total rules applied 521 place count 108 transition count 266
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 523 place count 106 transition count 257
Iterating global reduction 5 with 2 rules applied. Total rules applied 525 place count 106 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 527 place count 106 transition count 255
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 529 place count 104 transition count 253
Applied a total of 529 rules in 60 ms. Remains 104 /390 variables (removed 286) and now considering 253/625 (removed 372) transitions.
[2025-06-07 20:01:53] [INFO ] Flow matrix only has 108 transitions (discarded 145 similar events)
// Phase 1: matrix 108 rows 104 cols
[2025-06-07 20:01:53] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:01:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-07 20:01:53] [INFO ] Flow matrix only has 108 transitions (discarded 145 similar events)
[2025-06-07 20:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:01:53] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:01:53] [INFO ] Redundant transitions in 11 ms returned []
Running 178 sub problems to find dead transitions.
[2025-06-07 20:01:53] [INFO ] Flow matrix only has 108 transitions (discarded 145 similar events)
[2025-06-07 20:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 107/211 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/212 variables, and 141 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4939 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 107/211 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 178/319 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/212 variables, and 319 constraints, problems are : Problem set: 0 solved, 178 unsolved in 5077 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10050ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 10051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/390 places, 253/625 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10284 ms. Remains : 104/390 places, 253/625 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-01 finished in 10553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(p1)||p0))&&X(p2))))'
Support contains 5 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 376 transition count 589
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 376 transition count 589
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 376 transition count 584
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 368 transition count 570
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 368 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 368 transition count 569
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 364 transition count 558
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 364 transition count 558
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 364 transition count 556
Applied a total of 60 rules in 30 ms. Remains 364 /390 variables (removed 26) and now considering 556/625 (removed 69) transitions.
// Phase 1: matrix 556 rows 364 cols
[2025-06-07 20:02:03] [INFO ] Computed 37 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:02:03] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-07 20:02:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:02:04] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 555 sub problems to find dead transitions.
[2025-06-07 20:02:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (OVERLAPS) 556/920 variables, 364/401 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 1.0)
(t8 1.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 1.0)
(t15 0.0)
(t16 0.0)
(t17 1.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 1.0)
(t24 0.0)
(t25 0.0)
(t26 1.0)
(t27 1.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 1.0)
(t34 0.0)
(t35 0.0)
(t36 1.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 1.0)
(t43 0.0)
(t44 0.0)
(t45 1.0)
(t46 1.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 1.0)
(t53 0.0)
(t54 0.0)
(t55 1.0)
(t56 1.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 1.0)
(t63 0.0)
(t64 0.0)
(t65 1.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 1.0)
(t72 0.0)
(t73 0.0)
(t74 1.0)
(t75 1.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 1.0)
(t82 0.0)
(t83 0.0)
(t84 1.0)
(t85 1.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 1.0)
(t92 0.0)
(t93 0.0)
(t94 1.0)
(t95 1.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 1.0)
(t102 0.0)
(t103 0.0)
(t104 1.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 1.0)
(t111 0.0)
(t112 0.0)
(t113 1.0)
(t114 1.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 1.0)
(t121 0.0)
(t122 0.0)
(t123 1.0)
(t124 1.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 1.0)
(t131 0.0)
(t132 0.0)
(t133 1.0)
(t134 1.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 1.0)
(t142 0.0)
(t143 0.0)
(t144 1.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 1.0)
(t151 0.0)
(t152 0.0)
(t153 1.0)
(t154 1.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 1.0)
(t161 0.0)
(t162 0.0)
(t163 1.0)
(t164 1.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 1.0)
(t171 0.0)
(t172 0.0)
(t173 1.0)
(t174 1.0)
(t175 0.0)
(t176 0.0)
(t177 0.0)
(t178 0.0)
(t179 0.0)
(t180 1.0)
(t181 0.0)
(t182 0.0)
(t183 1.0)
(t184 1.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 0.0)
(t189 0.0)
(t190 1.0)
(t191 0.0)
(t192 0.0)
(t193 1.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 1.0)
(t200 0.0)
(t201 0.0)
(t202 1.0)
(t203 1.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 1.0)
(t210 0.0)
(t211 0.0)
(t212 1.0)
(t213 1.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 1.0)
(t220 0.0)
(t221 0.0)
(t222 1.0)
(t223 1.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 1.0)
(t230 0.0)
(t231 0.0)
(t232 1.0)
(t233 1.0)
(t234 0.0)
(t235 0.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 1.0)
(t241 0.0)
(t242 0.0)
(t243 1.0)
(t244 1.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 1.0)
(t251 0.0)
(t252 1.0)
(t253 1.0)
(t254 1.0)
(t255 0.0)
(t256 0.0)
(t257 0.0)
(t258 0.0)
(t259 1.0)
(t260 1.0)
(t261 0.0)
(t262 1.0)
(t263 1.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 1.0)
(t269 1.0)
(t270 0.0)
(t271 1.0)
(t272 1.0)
(t273 1.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 1.0)
(t280 0.0)
(t281 1.0)
(t282 1.0)
(t283 1.0)
(t284 0.0)
(t285 0.0)
(t286 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 920/920 variables, and 401 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (OVERLAPS) 556/920 variables, 364/401 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 555/956 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:02:53] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/920 variables, 1/957 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 920/920 variables, and 957 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 364/390 places, 556/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60466 ms. Remains : 364/390 places, 556/625 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-02
Product exploration explored 100000 steps with 253 reset in 334 ms.
Stack based approach found an accepted trace after 7774 steps with 18 reset with depth 490 and stack size 490 in 26 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-02 finished in 61024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 375 transition count 575
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 375 transition count 575
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 37 place count 375 transition count 568
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 367 transition count 554
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 367 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 367 transition count 553
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 362 transition count 541
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 362 transition count 541
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 362 transition count 538
Applied a total of 67 rules in 25 ms. Remains 362 /390 variables (removed 28) and now considering 538/625 (removed 87) transitions.
// Phase 1: matrix 538 rows 362 cols
[2025-06-07 20:03:04] [INFO ] Computed 37 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:03:04] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-07 20:03:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:03:05] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-07 20:03:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (OVERLAPS) 538/900 variables, 362/399 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/900 variables, and 399 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (OVERLAPS) 538/900 variables, 362/399 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 537/936 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:03:53] [INFO ] Deduced a trap along path composed of 9 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:03:55] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 2/938 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:04:03] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:04:03] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:04:04] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:04:04] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/900 variables, and 942 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 362/390 places, 538/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60468 ms. Remains : 362/390 places, 538/625 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-06
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-06 finished in 60616 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((F((p0||G(p1)))&&((p2||G(p3)) U X(p1)))))'
Support contains 5 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 374 transition count 577
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 374 transition count 577
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 374 transition count 571
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 366 transition count 557
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 366 transition count 557
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 366 transition count 556
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 362 transition count 545
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 362 transition count 545
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 362 transition count 542
Applied a total of 66 rules in 21 ms. Remains 362 /390 variables (removed 28) and now considering 542/625 (removed 83) transitions.
// Phase 1: matrix 542 rows 362 cols
[2025-06-07 20:04:05] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:04:05] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-07 20:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:04:05] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2025-06-07 20:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (OVERLAPS) 542/904 variables, 362/399 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/904 variables, and 399 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (OVERLAPS) 542/904 variables, 362/399 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 541/940 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:04:54] [INFO ] Deduced a trap along path composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/904 variables, 1/941 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:05:05] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/904 variables, and 942 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 362/390 places, 542/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60441 ms. Remains : 362/390 places, 542/625 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-07
Stuttering criterion allowed to conclude after 570 steps with 1 reset in 9 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-07 finished in 60730 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(X(F(p1)))&&F(p2)))'
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 377 transition count 593
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 377 transition count 593
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 377 transition count 589
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 369 transition count 575
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 369 transition count 575
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 369 transition count 574
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 52 place count 364 transition count 562
Iterating global reduction 2 with 5 rules applied. Total rules applied 57 place count 364 transition count 562
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 364 transition count 559
Applied a total of 60 rules in 23 ms. Remains 364 /390 variables (removed 26) and now considering 559/625 (removed 66) transitions.
// Phase 1: matrix 559 rows 364 cols
[2025-06-07 20:05:06] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:05:06] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-07 20:05:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:05:06] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 558 sub problems to find dead transitions.
[2025-06-07 20:05:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (OVERLAPS) 559/923 variables, 364/401 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 923/923 variables, and 401 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (OVERLAPS) 559/923 variables, 364/401 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 558/959 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:05:55] [INFO ] Deduced a trap along path composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/923 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 960 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 364/390 places, 559/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60487 ms. Remains : 364/390 places, 559/625 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 192 ms.
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X p2), (X (X p1)), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 12 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H08T0R-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H08T0R-LTLFireability-09 finished in 61080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0) U p1))&&X(p2)))'
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 376 transition count 579
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 376 transition count 579
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 376 transition count 573
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 369 transition count 566
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 369 transition count 566
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 365 transition count 555
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 365 transition count 555
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 365 transition count 552
Applied a total of 59 rules in 18 ms. Remains 365 /390 variables (removed 25) and now considering 552/625 (removed 73) transitions.
// Phase 1: matrix 552 rows 365 cols
[2025-06-07 20:06:07] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:06:07] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-07 20:06:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:06:07] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 551 sub problems to find dead transitions.
[2025-06-07 20:06:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/365 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 552/917 variables, 365/402 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/917 variables, and 402 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 551 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/365 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 552/917 variables, 365/402 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/917 variables, 551/953 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:06:56] [INFO ] Deduced a trap along path composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/917 variables, 1/954 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:07:07] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/917 variables, and 955 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 365/390 places, 552/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60548 ms. Remains : 365/390 places, 552/625 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-11
Entered a terminal (fully accepting) state of product in 84 steps with 1 reset in 1 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-11 finished in 60726 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 390 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Graph (trivial) has 365 edges and 390 vertex of which 57 / 390 are part of one of the 12 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 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 344 transition count 527
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 119 rules applied. Total rules applied 169 place count 295 transition count 457
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 204 place count 260 transition count 457
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 204 place count 260 transition count 434
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 250 place count 237 transition count 434
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 263 place count 224 transition count 386
Iterating global reduction 3 with 13 rules applied. Total rules applied 276 place count 224 transition count 386
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 283 place count 224 transition count 379
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 283 place count 224 transition count 377
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 287 place count 222 transition count 377
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 288 place count 221 transition count 370
Iterating global reduction 4 with 1 rules applied. Total rules applied 289 place count 221 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 290 place count 221 transition count 369
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 5 with 228 rules applied. Total rules applied 518 place count 107 transition count 255
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 520 place count 105 transition count 246
Iterating global reduction 5 with 2 rules applied. Total rules applied 522 place count 105 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 524 place count 105 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 526 place count 103 transition count 242
Applied a total of 526 rules in 50 ms. Remains 103 /390 variables (removed 287) and now considering 242/625 (removed 383) transitions.
[2025-06-07 20:07:08] [INFO ] Flow matrix only has 95 transitions (discarded 147 similar events)
// Phase 1: matrix 95 rows 103 cols
[2025-06-07 20:07:08] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:07:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-07 20:07:08] [INFO ] Flow matrix only has 95 transitions (discarded 147 similar events)
[2025-06-07 20:07:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:07:08] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:07:08] [INFO ] Redundant transitions in 2 ms returned []
Running 167 sub problems to find dead transitions.
[2025-06-07 20:07:08] [INFO ] Flow matrix only has 95 transitions (discarded 147 similar events)
[2025-06-07 20:07:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 3/103 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 94/197 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/198 variables, and 140 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4465 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 3/103 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 94/197 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 167/307 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/198 variables, and 307 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4786 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9264ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 9265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/390 places, 242/625 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9472 ms. Remains : 103/390 places, 242/625 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-12 finished in 9530 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&&(p0 U X(p0))))&&X(G(p1))))'
Support contains 2 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 373 transition count 573
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 373 transition count 573
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 41 place count 373 transition count 566
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 364 transition count 551
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 364 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 364 transition count 550
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 359 transition count 538
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 359 transition count 538
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 359 transition count 535
Applied a total of 73 rules in 24 ms. Remains 359 /390 variables (removed 31) and now considering 535/625 (removed 90) transitions.
// Phase 1: matrix 535 rows 359 cols
[2025-06-07 20:07:17] [INFO ] Computed 37 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:07:17] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-07 20:07:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:07:17] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 534 sub problems to find dead transitions.
[2025-06-07 20:07:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 1/359 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/894 variables, 359/396 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 894/894 variables, and 396 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 1/359 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/894 variables, 359/396 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/894 variables, 534/930 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:08:05] [INFO ] Deduced a trap along path composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/894 variables, 1/931 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:08:16] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:08:17] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 894/894 variables, and 933 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 359/390 places, 535/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60467 ms. Remains : 359/390 places, 535/625 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-13 finished in 60728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((F(p1) U (p2&&G(p3))))||p0))))'
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 375 transition count 579
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 375 transition count 579
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 375 transition count 573
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 367 transition count 559
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 367 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 367 transition count 558
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 363 transition count 553
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 363 transition count 553
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 363 transition count 551
Applied a total of 63 rules in 27 ms. Remains 363 /390 variables (removed 27) and now considering 551/625 (removed 74) transitions.
// Phase 1: matrix 551 rows 363 cols
[2025-06-07 20:08:18] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:08:18] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-07 20:08:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:08:18] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 550 sub problems to find dead transitions.
[2025-06-07 20:08:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (OVERLAPS) 551/914 variables, 363/400 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)timeout

(s205 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 914/914 variables, and 400 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (OVERLAPS) 551/914 variables, 363/400 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/914 variables, 550/950 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:09:07] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/914 variables, 1/951 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 914/914 variables, and 951 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 363/390 places, 551/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60457 ms. Remains : 363/390 places, 551/625 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-14
Stuttering criterion allowed to conclude after 697 steps with 2 reset in 10 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-14 finished in 60823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 390/390 places, 625/625 transitions.
Graph (trivial) has 360 edges and 390 vertex of which 57 / 390 are part of one of the 12 SCC in 0 ms
Free SCC test removed 45 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 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 344 transition count 527
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 119 rules applied. Total rules applied 169 place count 295 transition count 457
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 204 place count 260 transition count 457
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 204 place count 260 transition count 435
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 248 place count 238 transition count 435
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 261 place count 225 transition count 390
Iterating global reduction 3 with 13 rules applied. Total rules applied 274 place count 225 transition count 390
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 280 place count 225 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 280 place count 225 transition count 382
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 284 place count 223 transition count 382
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 285 place count 222 transition count 375
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 222 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 287 place count 222 transition count 374
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 5 with 226 rules applied. Total rules applied 513 place count 109 transition count 261
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 514 place count 108 transition count 254
Iterating global reduction 5 with 1 rules applied. Total rules applied 515 place count 108 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 516 place count 108 transition count 253
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 518 place count 106 transition count 251
Applied a total of 518 rules in 40 ms. Remains 106 /390 variables (removed 284) and now considering 251/625 (removed 374) transitions.
[2025-06-07 20:09:19] [INFO ] Flow matrix only has 105 transitions (discarded 146 similar events)
// Phase 1: matrix 105 rows 106 cols
[2025-06-07 20:09:19] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:09:19] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 20:09:19] [INFO ] Flow matrix only has 105 transitions (discarded 146 similar events)
[2025-06-07 20:09:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:09:19] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:09:19] [INFO ] Redundant transitions in 3 ms returned []
Running 174 sub problems to find dead transitions.
[2025-06-07 20:09:19] [INFO ] Flow matrix only has 105 transitions (discarded 146 similar events)
[2025-06-07 20:09:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 3/106 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 104/210 variables, 106/143 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/211 variables, and 143 constraints, problems are : Problem set: 0 solved, 174 unsolved in 4675 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 3/106 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 104/210 variables, 106/143 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 174/317 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/211 variables, and 317 constraints, problems are : Problem set: 0 solved, 174 unsolved in 4907 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9599ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 9599ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/390 places, 251/625 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9796 ms. Remains : 106/390 places, 251/625 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-15 finished in 9945 ms.
All properties solved by simple procedures.
Total runtime 528717 ms.

BK_STOP 1749326969063

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Champagne-PT-H08T0R"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H08T0R, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339300100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H08T0R.tgz
mv Champagne-PT-H08T0R execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;