Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.4K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 11:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 11:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 11:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 6 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 74K 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-H05T1U-LTLCardinality-00
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-01
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-02
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-03
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-04
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-05
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-06
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-07
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-08
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-09
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-10
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-11
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-12
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-13
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-14
FORMULA_NAME Champagne-PT-H05T1U-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749318638227

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H05T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 17:50:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 17:50:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:50:39] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2025-06-07 17:50:39] [INFO ] Transformed 389 places.
[2025-06-07 17:50:39] [INFO ] Transformed 491 transitions.
[2025-06-07 17:50:39] [INFO ] Found NUPN structural information;
[2025-06-07 17:50:39] [INFO ] Parsed PT model containing 389 places and 491 transitions and 1176 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H05T1U-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T1U-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T1U-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T1U-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T1U-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T1U-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 491/491 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 312 transition count 414
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 312 transition count 414
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 198 place count 268 transition count 370
Iterating global reduction 0 with 44 rules applied. Total rules applied 242 place count 268 transition count 370
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 265 place count 245 transition count 347
Iterating global reduction 0 with 23 rules applied. Total rules applied 288 place count 245 transition count 347
Applied a total of 288 rules in 75 ms. Remains 245 /389 variables (removed 144) and now considering 347/491 (removed 144) transitions.
// Phase 1: matrix 347 rows 245 cols
[2025-06-07 17:50:39] [INFO ] Computed 15 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:40] [INFO ] Implicit Places using invariants in 292 ms returned []
[2025-06-07 17:50:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:40] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2025-06-07 17:50:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (OVERLAPS) 347/592 variables, 245/260 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (OVERLAPS) 0/592 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 346 unsolved
No progress, stopping.
After SMT solving in domain Real declared 592/592 variables, and 260 constraints, problems are : Problem set: 0 solved, 346 unsolved in 21396 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (OVERLAPS) 347/592 variables, 245/260 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 346/606 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:10] [INFO ] Deduced a trap along path composed of 13 places in 43 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:16] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:21] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:21] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:26] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:31] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:31] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/592 variables, and 613 constraints, problems are : Problem set: 0 solved, 346 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51524ms problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 51534ms
Starting structural reductions in LTL mode, iteration 1 : 245/389 places, 347/491 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52133 ms. Remains : 245/389 places, 347/491 transitions.
Support contains 33 out of 245 places after structural reductions.
[2025-06-07 17:51:32] [INFO ] Flatten gal took : 41 ms
[2025-06-07 17:51:32] [INFO ] Flatten gal took : 20 ms
[2025-06-07 17:51:32] [INFO ] Input system was already deterministic with 347 transitions.
RANDOM walk for 10673 steps (41 resets) in 340 ms. (31 steps per ms) remains 0/19 properties
Computed a total of 20 stabilizing places and 20 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(p2)&&(p0 U (p1||G(p0)))))))))'
Support contains 5 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 347/347 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 229 transition count 331
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 229 transition count 331
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 218 transition count 320
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 218 transition count 320
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 214 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 214 transition count 316
Applied a total of 62 rules in 15 ms. Remains 214 /245 variables (removed 31) and now considering 316/347 (removed 31) transitions.
// Phase 1: matrix 316 rows 214 cols
[2025-06-07 17:51:32] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:51:32] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-07 17:51:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:51:33] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2025-06-07 17:51:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/530 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (OVERLAPS) 0/530 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 229 constraints, problems are : Problem set: 0 solved, 315 unsolved in 16654 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/530 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 315/544 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:56] [INFO ] Deduced a trap along path composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:00] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:01] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:01] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:02] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 4/549 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:05] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:18] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:19] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/530 variables, and 552 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46717ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 46719ms
Starting structural reductions in LTL mode, iteration 1 : 214/245 places, 316/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47268 ms. Remains : 214/245 places, 316/347 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H05T1U-LTLCardinality-01
Product exploration explored 100000 steps with 448 reset in 320 ms.
Stack based approach found an accepted trace after 49034 steps with 217 reset with depth 124 and stack size 124 in 95 ms.
FORMULA Champagne-PT-H05T1U-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H05T1U-LTLCardinality-01 finished in 48052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(p1)))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 347/347 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 227 transition count 329
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 227 transition count 329
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 50 place count 213 transition count 315
Iterating global reduction 0 with 14 rules applied. Total rules applied 64 place count 213 transition count 315
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 208 transition count 310
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 208 transition count 310
Applied a total of 74 rules in 20 ms. Remains 208 /245 variables (removed 37) and now considering 310/347 (removed 37) transitions.
// Phase 1: matrix 310 rows 208 cols
[2025-06-07 17:52:20] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:52:20] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-07 17:52:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:52:20] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-07 17:52:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 310/518 variables, 208/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 0/518 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 223 constraints, problems are : Problem set: 0 solved, 309 unsolved in 15629 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 310/518 variables, 208/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 309/532 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:43] [INFO ] Deduced a trap along path composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:46] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:50] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:55] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:55] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 537 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45679ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 45680ms
Starting structural reductions in LTL mode, iteration 1 : 208/245 places, 310/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45881 ms. Remains : 208/245 places, 310/347 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLCardinality-03
Product exploration explored 100000 steps with 25000 reset in 102 ms.
Product exploration explored 100000 steps with 25000 reset in 143 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 12848 steps (56 resets) in 119 ms. (107 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 310/310 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2025-06-07 17:53:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:53:08] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-07 17:53:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:53:08] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-07 17:53: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/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 310/518 variables, 208/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 0/518 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 223 constraints, problems are : Problem set: 0 solved, 309 unsolved in 16051 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 310/518 variables, 208/223 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 309/532 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:31] [INFO ] Deduced a trap along path composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:34] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:38] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:43] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:43] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 537 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46089ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 46090ms
Finished structural reductions in LTL mode , in 1 iterations and 46309 ms. Remains : 208/208 places, 310/310 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 21441 steps (90 resets) in 63 ms. (335 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 92 ms.
Product exploration explored 100000 steps with 25000 reset in 122 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 310/310 transitions.
Graph (trivial) has 214 edges and 208 vertex of which 115 / 208 are part of one of the 15 SCC in 5 ms
Free SCC test removed 100 places
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 108 transition count 199
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 108 transition count 186
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 28 place count 108 transition count 186
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 108 transition count 186
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 63 place count 85 transition count 136
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 86 place count 85 transition count 136
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 97 place count 85 transition count 125
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 123 place count 85 transition count 125
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 136 place count 72 transition count 112
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 149 place count 72 transition count 112
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 149 rules in 40 ms. Remains 72 /208 variables (removed 136) and now considering 112/310 (removed 198) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:53:56] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-07 17:53:56] [INFO ] Flow matrix only has 73 transitions (discarded 39 similar events)
// Phase 1: matrix 73 rows 72 cols
[2025-06-07 17:53:56] [INFO ] Computed 15 invariants in 0 ms
[2025-06-07 17:53:56] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:53:57] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 14/29 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/29 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 72/144 variables, 72/101 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 11/112 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/112 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/113 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/113 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/113 constraints. Problems are: Problem set: 27 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 113 constraints, problems are : Problem set: 27 solved, 84 unsolved in 2979 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 72/72 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 27 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 28/72 variables, 15/15 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 14/29 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/29 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 72/144 variables, 72/101 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 11/112 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 84/196 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/196 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/197 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/197 constraints. Problems are: Problem set: 27 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/197 constraints. Problems are: Problem set: 27 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 197 constraints, problems are : Problem set: 27 solved, 84 unsolved in 4159 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 72/72 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 84/111 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7165ms problems are : Problem set: 27 solved, 84 unsolved
Search for dead transitions found 27 dead transitions in 7165ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 72/208 places, 85/310 transitions.
Graph (complete) has 373 edges and 72 vertex of which 45 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 45 /72 variables (removed 27) and now considering 85/85 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/208 places, 85/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7227 ms. Remains : 45/208 places, 85/310 transitions.
Built C files in :
/tmp/ltsmin3704931457050479294
[2025-06-07 17:54:03] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3704931457050479294
Running compilation step : cd /tmp/ltsmin3704931457050479294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 511 ms.
Running link step : cd /tmp/ltsmin3704931457050479294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin3704931457050479294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15313125875396372586.hoa' '--buchi-type=spotba'
LTSmin run took 2602 ms.
FORMULA Champagne-PT-H05T1U-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H05T1U-LTLCardinality-03 finished in 105839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 347/347 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 226 transition count 328
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 226 transition count 328
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 53 place count 211 transition count 313
Iterating global reduction 0 with 15 rules applied. Total rules applied 68 place count 211 transition count 313
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 205 transition count 307
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 205 transition count 307
Applied a total of 80 rules in 17 ms. Remains 205 /245 variables (removed 40) and now considering 307/347 (removed 40) transitions.
// Phase 1: matrix 307 rows 205 cols
[2025-06-07 17:54:06] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:54:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-07 17:54:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:54:06] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-07 17:54: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/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/512 variables, 205/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 0/512 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 220 constraints, problems are : Problem set: 0 solved, 306 unsolved in 15448 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/512 variables, 205/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 306/526 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:54:28] [INFO ] Deduced a trap along path composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:54:32] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:54:32] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:54:36] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:54:48] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 5 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/512 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:54:52] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 532 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45489ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 45490ms
Starting structural reductions in LTL mode, iteration 1 : 205/245 places, 307/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45699 ms. Remains : 205/245 places, 307/347 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Champagne-PT-H05T1U-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H05T1U-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H05T1U-LTLCardinality-04 finished in 46055 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))||(p0 U G(!p1))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 347/347 transitions.
Graph (trivial) has 250 edges and 245 vertex of which 110 / 245 are part of one of the 13 SCC in 2 ms
Free SCC test removed 97 places
Ensure Unique test removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 147 transition count 207
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 56 rules applied. Total rules applied 87 place count 117 transition count 181
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 100 place count 104 transition count 181
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 100 place count 104 transition count 177
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 100 transition count 177
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 119 place count 89 transition count 155
Iterating global reduction 3 with 11 rules applied. Total rules applied 130 place count 89 transition count 155
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 135 place count 89 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 88 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 88 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 88 transition count 146
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 202 place count 56 transition count 114
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 53 transition count 103
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 53 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 211 place count 53 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 215 place count 51 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 222 place count 51 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 49 transition count 97
Applied a total of 224 rules in 69 ms. Remains 49 /245 variables (removed 196) and now considering 97/347 (removed 250) transitions.
[2025-06-07 17:54:52] [INFO ] Flow matrix only has 51 transitions (discarded 46 similar events)
// Phase 1: matrix 51 rows 49 cols
[2025-06-07 17:54:52] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:54:52] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-07 17:54:52] [INFO ] Flow matrix only has 51 transitions (discarded 46 similar events)
[2025-06-07 17:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:54:52] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:54:52] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-07 17:54:52] [INFO ] Flow matrix only has 51 transitions (discarded 46 similar events)
[2025-06-07 17:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 50/99 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 0/99 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/100 variables, and 64 constraints, problems are : Problem set: 0 solved, 55 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 50/99 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 55/119 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/100 variables, and 119 constraints, problems are : Problem set: 0 solved, 55 unsolved in 897 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1754ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1757ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/245 places, 97/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2039 ms. Remains : 49/245 places, 97/347 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLCardinality-05 finished in 2147 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(G(p1)))))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 347/347 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 227 transition count 329
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 227 transition count 329
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 49 place count 214 transition count 316
Iterating global reduction 0 with 13 rules applied. Total rules applied 62 place count 214 transition count 316
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 209 transition count 311
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 209 transition count 311
Applied a total of 72 rules in 17 ms. Remains 209 /245 variables (removed 36) and now considering 311/347 (removed 36) transitions.
// Phase 1: matrix 311 rows 209 cols
[2025-06-07 17:54:54] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:54:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 17:54:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:54:54] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2025-06-07 17:54:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/520 variables, 209/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 0/520 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 224 constraints, problems are : Problem set: 0 solved, 310 unsolved in 16261 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/520 variables, 209/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 310/534 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:18] [INFO ] Deduced a trap along path composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:21] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:25] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:25] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 538 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46302ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 46303ms
Starting structural reductions in LTL mode, iteration 1 : 209/245 places, 311/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46510 ms. Remains : 209/245 places, 311/347 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Champagne-PT-H05T1U-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLCardinality-06 finished in 46687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 347/347 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 226 transition count 328
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 226 transition count 328
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 53 place count 211 transition count 313
Iterating global reduction 0 with 15 rules applied. Total rules applied 68 place count 211 transition count 313
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 205 transition count 307
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 205 transition count 307
Applied a total of 80 rules in 11 ms. Remains 205 /245 variables (removed 40) and now considering 307/347 (removed 40) transitions.
// Phase 1: matrix 307 rows 205 cols
[2025-06-07 17:55:41] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:55:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-07 17:55:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:55:41] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-07 17:55: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/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/512 variables, 205/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 0/512 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 220 constraints, problems are : Problem set: 0 solved, 306 unsolved in 15818 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/512 variables, 205/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 306/526 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:04] [INFO ] Deduced a trap along path composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:07] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:07] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:11] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:24] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 6 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/512 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 531 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45861ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 45861ms
Starting structural reductions in LTL mode, iteration 1 : 205/245 places, 307/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46062 ms. Remains : 205/245 places, 307/347 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H05T1U-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLCardinality-08 finished in 46251 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 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 347/347 transitions.
Graph (trivial) has 250 edges and 245 vertex of which 121 / 245 are part of one of the 16 SCC in 0 ms
Free SCC test removed 105 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 139 transition count 204
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 53 rules applied. Total rules applied 81 place count 112 transition count 178
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 94 place count 99 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 94 place count 99 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 98 transition count 177
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 107 place count 87 transition count 155
Iterating global reduction 3 with 11 rules applied. Total rules applied 118 place count 87 transition count 155
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 123 place count 87 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 86 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 86 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 86 transition count 146
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 184 place count 57 transition count 117
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 188 place count 53 transition count 102
Iterating global reduction 5 with 4 rules applied. Total rules applied 192 place count 53 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 196 place count 53 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 198 place count 51 transition count 96
Applied a total of 198 rules in 25 ms. Remains 51 /245 variables (removed 194) and now considering 96/347 (removed 251) transitions.
[2025-06-07 17:56:27] [INFO ] Flow matrix only has 51 transitions (discarded 45 similar events)
// Phase 1: matrix 51 rows 51 cols
[2025-06-07 17:56:27] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:56:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-07 17:56:27] [INFO ] Flow matrix only has 51 transitions (discarded 45 similar events)
[2025-06-07 17:56:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:56:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 17:56:27] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:56:27] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2025-06-07 17:56:27] [INFO ] Flow matrix only has 51 transitions (discarded 45 similar events)
[2025-06-07 17:56:27] [INFO ] Invariant cache hit.
[2025-06-07 17:56:27] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 2/51 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/102 variables, and 68 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 2/51 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/102 variables, and 134 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2128ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/245 places, 96/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2233 ms. Remains : 51/245 places, 96/347 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T1U-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLCardinality-09 finished in 2279 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((p1 U p2)))))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 347/347 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 230 transition count 332
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 230 transition count 332
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 43 place count 217 transition count 319
Iterating global reduction 0 with 13 rules applied. Total rules applied 56 place count 217 transition count 319
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 212 transition count 314
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 212 transition count 314
Applied a total of 66 rules in 5 ms. Remains 212 /245 variables (removed 33) and now considering 314/347 (removed 33) transitions.
// Phase 1: matrix 314 rows 212 cols
[2025-06-07 17:56:29] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:56:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-07 17:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:56:30] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2025-06-07 17:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 314/526 variables, 212/227 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 0/526 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 227 constraints, problems are : Problem set: 0 solved, 313 unsolved in 16421 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 314/526 variables, 212/227 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 313/540 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:53] [INFO ] Deduced a trap along path composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 541 constraints, problems are : Problem set: 0 solved, 313 unsolved in 26643 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43096ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 43097ms
Starting structural reductions in LTL mode, iteration 1 : 212/245 places, 314/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43273 ms. Remains : 212/245 places, 314/347 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : Champagne-PT-H05T1U-LTLCardinality-11
Stuttering criterion allowed to conclude after 188 steps with 8 reset in 1 ms.
FORMULA Champagne-PT-H05T1U-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLCardinality-11 finished in 43439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 347/347 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 227 transition count 329
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 227 transition count 329
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 212 transition count 314
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 212 transition count 314
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 206 transition count 308
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 206 transition count 308
Applied a total of 78 rules in 10 ms. Remains 206 /245 variables (removed 39) and now considering 308/347 (removed 39) transitions.
// Phase 1: matrix 308 rows 206 cols
[2025-06-07 17:57:13] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:13] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 17:57:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:13] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-07 17:57:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 308/514 variables, 206/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 0/514 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 221 constraints, problems are : Problem set: 0 solved, 307 unsolved in 15638 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 308/514 variables, 206/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 307/528 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:35] [INFO ] Deduced a trap along path composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:39] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:40] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:40] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:42] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:43] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:54] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:56] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 4 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/514 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 307 unsolved
(s84 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 536 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45673ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 45673ms
Starting structural reductions in LTL mode, iteration 1 : 206/245 places, 308/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45855 ms. Remains : 206/245 places, 308/347 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLCardinality-12
Product exploration explored 100000 steps with 20000 reset in 161 ms.
Product exploration explored 100000 steps with 20000 reset in 124 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 222 steps (0 resets) in 5 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 308/308 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2025-06-07 17:58:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-07 17:58:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:00] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-07 17:58:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 308/514 variables, 206/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 0/514 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 221 constraints, problems are : Problem set: 0 solved, 307 unsolved in 15736 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 308/514 variables, 206/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 307/528 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:22] [INFO ] Deduced a trap along path composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:26] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:27] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:27] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:29] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:30] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:41] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:43] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 5 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/514 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 536 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45775ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 45775ms
Finished structural reductions in LTL mode , in 1 iterations and 45967 ms. Remains : 206/206 places, 308/308 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 173 steps (0 resets) in 4 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 156 ms.
Product exploration explored 100000 steps with 20000 reset in 189 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 308/308 transitions.
Graph (trivial) has 211 edges and 206 vertex of which 108 / 206 are part of one of the 15 SCC in 0 ms
Free SCC test removed 93 places
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 113 transition count 205
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 113 transition count 192
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 28 place count 113 transition count 192
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 41 place count 113 transition count 192
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 64 place count 90 transition count 145
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 87 place count 90 transition count 145
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 97 place count 90 transition count 135
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 3 with 29 rules applied. Total rules applied 126 place count 90 transition count 135
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 142 place count 74 transition count 119
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 158 place count 74 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 74 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 73 transition count 123
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 73 transition count 123
Deduced a syphon composed of 27 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 73 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 72 transition count 115
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 72 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 72 transition count 114
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 168 rules in 23 ms. Remains 72 /206 variables (removed 134) and now considering 114/308 (removed 194) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:58:47] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2025-06-07 17:58:47] [INFO ] Flow matrix only has 76 transitions (discarded 38 similar events)
// Phase 1: matrix 76 rows 72 cols
[2025-06-07 17:58:47] [INFO ] Computed 15 invariants in 1 ms
[2025-06-07 17:58:47] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:48] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 14/29 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/29 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 75/147 variables, 72/101 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 11/112 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/112 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/148 variables, 1/113 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/113 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/148 variables, 0/113 constraints. Problems are: Problem set: 28 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 113 constraints, problems are : Problem set: 28 solved, 85 unsolved in 3067 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 72/72 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 28/72 variables, 15/15 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 14/29 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/29 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 75/147 variables, 72/101 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 11/112 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 85/197 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/197 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/198 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/198 constraints. Problems are: Problem set: 28 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/198 constraints. Problems are: Problem set: 28 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 198 constraints, problems are : Problem set: 28 solved, 85 unsolved in 3896 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 72/72 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 85/113 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6973ms problems are : Problem set: 28 solved, 85 unsolved
Search for dead transitions found 28 dead transitions in 6975ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 72/206 places, 86/308 transitions.
Graph (complete) has 373 edges and 72 vertex of which 45 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 45 /72 variables (removed 27) and now considering 86/86 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/206 places, 86/308 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7009 ms. Remains : 45/206 places, 86/308 transitions.
Built C files in :
/tmp/ltsmin9869198625792049802
[2025-06-07 17:58:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9869198625792049802
Running compilation step : cd /tmp/ltsmin9869198625792049802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 401 ms.
Running link step : cd /tmp/ltsmin9869198625792049802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9869198625792049802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12989256004921462267.hoa' '--buchi-type=spotba'
LTSmin run took 163 ms.
FORMULA Champagne-PT-H05T1U-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H05T1U-LTLCardinality-12 finished in 102138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 347/347 transitions.
Graph (trivial) has 249 edges and 245 vertex of which 121 / 245 are part of one of the 16 SCC in 0 ms
Free SCC test removed 105 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 139 transition count 204
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 51 rules applied. Total rules applied 79 place count 112 transition count 180
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 92 place count 100 transition count 179
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 95 place count 99 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 98 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 96 place count 98 transition count 176
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 97 transition count 176
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 109 place count 86 transition count 154
Iterating global reduction 5 with 11 rules applied. Total rules applied 120 place count 86 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 125 place count 86 transition count 149
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 127 place count 84 transition count 142
Iterating global reduction 6 with 2 rules applied. Total rules applied 129 place count 84 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 131 place count 84 transition count 140
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 191 place count 54 transition count 110
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 194 place count 51 transition count 99
Iterating global reduction 7 with 3 rules applied. Total rules applied 197 place count 51 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 200 place count 51 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 202 place count 49 transition count 94
Applied a total of 202 rules in 22 ms. Remains 49 /245 variables (removed 196) and now considering 94/347 (removed 253) transitions.
[2025-06-07 17:58:55] [INFO ] Flow matrix only has 57 transitions (discarded 37 similar events)
// Phase 1: matrix 57 rows 49 cols
[2025-06-07 17:58:55] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:55] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 17:58:55] [INFO ] Flow matrix only has 57 transitions (discarded 37 similar events)
[2025-06-07 17:58:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:55] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:58:55] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-07 17:58:55] [INFO ] Flow matrix only has 57 transitions (discarded 37 similar events)
[2025-06-07 17:58:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/49 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 56/105 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 64 constraints, problems are : Problem set: 0 solved, 51 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/49 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 56/105 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 51/115 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 115 constraints, problems are : Problem set: 0 solved, 51 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1665ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1666ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/245 places, 94/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1780 ms. Remains : 49/245 places, 94/347 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T1U-LTLCardinality-13
Stuttering criterion allowed to conclude after 66 steps with 1 reset in 1 ms.
FORMULA Champagne-PT-H05T1U-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T1U-LTLCardinality-13 finished in 1861 ms.
All properties solved by simple procedures.
Total runtime 497973 ms.

BK_STOP 1749319137458

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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