Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 173K May 29 14:32 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 HirschbergSinclair-PT-15-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748775671433

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 11:01:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 11:01:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:01:13] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-06-01 11:01:13] [INFO ] Transformed 330 places.
[2025-06-01 11:01:13] [INFO ] Transformed 296 transitions.
[2025-06-01 11:01:13] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-15-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 315 transition count 296
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 27 place count 303 transition count 284
Iterating global reduction 1 with 12 rules applied. Total rules applied 39 place count 303 transition count 284
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 295 transition count 276
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 295 transition count 276
Applied a total of 55 rules in 73 ms. Remains 295 /330 variables (removed 35) and now considering 276/296 (removed 20) transitions.
// Phase 1: matrix 276 rows 295 cols
[2025-06-01 11:01:13] [INFO ] Computed 19 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:01:13] [INFO ] Implicit Places using invariants in 352 ms returned []
[2025-06-01 11:01:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:01:15] [INFO ] Implicit Places using invariants and state equation in 1744 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-06-01 11:01:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 15/295 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 276/571 variables, 295/314 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/571 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 314 constraints, problems are : Problem set: 0 solved, 261 unsolved in 28779 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 15/295 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 276/571 variables, 295/314 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 261/575 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 575 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58899ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 58912ms
Starting structural reductions in LTL mode, iteration 1 : 295/330 places, 276/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61146 ms. Remains : 295/330 places, 276/296 transitions.
Support contains 45 out of 295 places after structural reductions.
[2025-06-01 11:02:14] [INFO ] Flatten gal took : 76 ms
[2025-06-01 11:02:14] [INFO ] Flatten gal took : 23 ms
[2025-06-01 11:02:14] [INFO ] Input system was already deterministic with 276 transitions.
Reduction of identical properties reduced properties to check from 33 to 31
RANDOM walk for 6885 steps (23 resets) in 326 ms. (21 steps per ms) remains 0/31 properties
Computed a total of 295 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 295 transition count 276
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(!p1)) U (X(p2)&&G(p3))))'
Support contains 6 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 288 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 285 transition count 266
Applied a total of 20 rules in 26 ms. Remains 285 /295 variables (removed 10) and now considering 266/276 (removed 10) transitions.
// Phase 1: matrix 266 rows 285 cols
[2025-06-01 11:02:15] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:02:15] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-01 11:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:02:17] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-01 11:02:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 27133 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57236ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 57240ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 266/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58743 ms. Remains : 285/295 places, 266/276 transitions.
Stuttering acceptance computed with spot in 610 ms :[(OR (NOT p3) (NOT p2)), p1, p1, (AND p3 p1 (NOT p2)), (NOT p2), (AND (NOT p3) p1), (NOT p3), (AND p1 (NOT p2) p3), true, (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-00
Product exploration explored 100000 steps with 33305 reset in 387 ms.
Product exploration explored 100000 steps with 33295 reset in 283 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND p3 p0 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p3 p1))), (X (NOT p3)), (X (NOT (AND p3 p0))), (X (NOT (AND p3 p0 p1 (NOT p2)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p3 p1 (NOT p2)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 47 factoid took 156 ms. Reduced automaton from 10 states, 32 edges and 4 AP (stutter sensitive) to 15 states, 52 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 676 ms :[(OR (NOT p3) (NOT p2)), (OR (AND p1 p2 p3) (AND p0 p1)), p1, (AND p0 p3 p1 (NOT p2)), (NOT p2), (AND p0 (NOT p3) p1), (NOT p3), true, (NOT p3), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (132 resets) in 981 ms. (40 steps per ms) remains 11/30 properties
BEST_FIRST walk for 40004 steps (20 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 193 ms. (206 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 220 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
[2025-06-01 11:03:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf27 is UNSAT
Problem apf28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 249/255 variables, 18/18 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/258 variables, 1/19 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem apf2 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf11 is UNSAT
Problem apf12 is UNSAT
Problem apf19 is UNSAT
Problem apf24 is UNSAT
Problem apf29 is UNSAT
After SMT solving in domain Real declared 524/551 variables, and 277 constraints, problems are : Problem set: 11 solved, 0 unsolved in 452 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 258/285 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 470ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 11 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND p3 p0 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p3 p1))), (X (NOT p3)), (X (NOT (AND p3 p0))), (X (NOT (AND p3 p0 p1 (NOT p2)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p3 p1 (NOT p2)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p1))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (G (AND (OR (NOT p0) (NOT p2) (NOT p3)) (OR p1 (NOT p2) (NOT p3)))), (G (AND (OR (NOT p0) (NOT p1)) (OR (NOT p1) (NOT p2) (NOT p3)))), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p1) p3)), (G (OR (NOT p0) (NOT p1) p2 (NOT p3))), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p0) (NOT p1) (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1 (NOT p3)) (OR p0 (NOT p2) (NOT p3))))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (AND (OR p0 (NOT p1) p2) (OR p0 (NOT p1) p3)))), (F (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))))), (F (NOT (AND (OR (NOT p0) (NOT p3)) (OR p1 (NOT p3)) (OR (NOT p2) (NOT p3))))), (F (NOT (OR p0 p1 (NOT p3)))), (F p2), (F p3), (F (NOT (AND (OR (NOT p0) (NOT p1) p2) (OR (NOT p0) p3)))), (F (NOT (AND (OR (NOT p0) (NOT p3)) (OR p1 (NOT p3))))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) p3))), (F (NOT (AND (OR (NOT p0) (NOT p1) p2) (OR (NOT p0) p2 p3)))), (F (NOT (OR (AND p0 (NOT p3)) (AND (NOT p1) (NOT p3))))), (F (NOT (AND (OR (NOT p0) p2 (NOT p3)) (OR p1 p2 (NOT p3))))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Property proved to be false thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 58 factoid took 146 ms. Reduced automaton from 15 states, 52 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-00 finished in 62537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 288 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 285 transition count 266
Applied a total of 20 rules in 21 ms. Remains 285 /295 variables (removed 10) and now considering 266/276 (removed 10) transitions.
[2025-06-01 11:03:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:03:18] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-01 11:03:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:03:19] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-01 11:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26724 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56790ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56792ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 266/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58546 ms. Remains : 285/295 places, 266/276 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-01
Entered a terminal (fully accepting) state of product in 160 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-01 finished in 58701 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' '!((p0 U X((F(p0)&&(!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 288 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 285 transition count 266
Applied a total of 20 rules in 18 ms. Remains 285 /295 variables (removed 10) and now considering 266/276 (removed 10) transitions.
[2025-06-01 11:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:04:16] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-01 11:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:04:18] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-01 11:04:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26583 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56631ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56633ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 266/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58734 ms. Remains : 285/295 places, 266/276 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (AND p1 (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-03
Product exploration explored 100000 steps with 563 reset in 319 ms.
Product exploration explored 100000 steps with 565 reset in 373 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 129 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 696 steps (0 resets) in 12 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 24 factoid took 182 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 11:05:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 11:05:17] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 104 ms returned sat
[2025-06-01 11:05:24] [INFO ] [Real]Absence check using state equation in 7181 ms returned sat
[2025-06-01 11:05:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 11:05:24] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 62 ms returned sat
[2025-06-01 11:05:29] [INFO ] [Nat]Absence check using state equation in 4318 ms returned sat
[2025-06-01 11:05:29] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 20 ms.
[2025-06-01 11:05:33] [INFO ] Added : 101 causal constraints over 21 iterations in 4184 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 285 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2025-06-01 11:05:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:05:33] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-01 11:05:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:05:35] [INFO ] Implicit Places using invariants and state equation in 1856 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-01 11:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26942 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57006ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 57013ms
Finished structural reductions in LTL mode , in 1 iterations and 59010 ms. Remains : 285/285 places, 266/266 transitions.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 698 steps (0 resets) in 8 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 11:06:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 11:06:33] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 101 ms returned sat
[2025-06-01 11:06:40] [INFO ] [Real]Absence check using state equation in 7147 ms returned sat
[2025-06-01 11:06:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 11:06:40] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 62 ms returned sat
[2025-06-01 11:06:44] [INFO ] [Nat]Absence check using state equation in 4253 ms returned sat
[2025-06-01 11:06:44] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 18 ms.
[2025-06-01 11:06:49] [INFO ] Added : 101 causal constraints over 21 iterations in 4198 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 565 reset in 225 ms.
Product exploration explored 100000 steps with 564 reset in 261 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 285 transition count 266
Deduced a syphon composed of 109 places in 0 ms
Applied a total of 109 rules in 41 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:06:50] [INFO ] Redundant transitions in 11 ms returned []
Running 251 sub problems to find dead transitions.
// Phase 1: matrix 266 rows 285 cols
[2025-06-01 11:06:50] [INFO ] Computed 19 invariants in 6 ms
[2025-06-01 11:06:50] [INFO ] State equation strengthened by 109 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 109 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 109/413 constraints. Problems are: Problem set: 109 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/413 constraints. Problems are: Problem set: 109 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 413 constraints, problems are : Problem set: 109 solved, 142 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 109 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 109 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 124/285 variables, 19/19 constraints. Problems are: Problem set: 109 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 109 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 109 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 109/413 constraints. Problems are: Problem set: 109 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 142/555 constraints. Problems are: Problem set: 109 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 109 solved, 142 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 142/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 109 solved, 142 unsolved
Search for dead transitions found 109 dead transitions in 60078ms
Found 109 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 109 transitions
Dead transitions reduction (with SMT) removed 109 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 285/285 places, 157/266 transitions.
Graph (complete) has 431 edges and 285 vertex of which 176 are kept as prefixes of interest. Removing 109 places using SCC suffix rule.2 ms
Discarding 109 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 176 /285 variables (removed 109) and now considering 157/157 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 176/285 places, 157/266 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60161 ms. Remains : 176/285 places, 157/266 transitions.
Built C files in :
/tmp/ltsmin10462639542410262599
[2025-06-01 11:07:50] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10462639542410262599
Running compilation step : cd /tmp/ltsmin10462639542410262599;'/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 582 ms.
Running link step : cd /tmp/ltsmin10462639542410262599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin10462639542410262599;'/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/stateBased12646184583162062316.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Applied a total of 0 rules in 14 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 285 cols
[2025-06-01 11:08:05] [INFO ] Computed 19 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:08:05] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-01 11:08:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:08:07] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 1696 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-01 11:08:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26666 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56726ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56729ms
Finished structural reductions in LTL mode , in 1 iterations and 58442 ms. Remains : 285/285 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin5644450396898584618
[2025-06-01 11:09:03] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5644450396898584618
Running compilation step : cd /tmp/ltsmin5644450396898584618;'/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 415 ms.
Running link step : cd /tmp/ltsmin5644450396898584618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5644450396898584618;'/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/stateBased9073245651320427285.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 11:09:19] [INFO ] Flatten gal took : 15 ms
[2025-06-01 11:09:19] [INFO ] Flatten gal took : 14 ms
[2025-06-01 11:09:19] [INFO ] Time to serialize gal into /tmp/LTL14152128753781537506.gal : 4 ms
[2025-06-01 11:09:19] [INFO ] Time to serialize properties into /tmp/LTL17900815570875931866.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14152128753781537506.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1990518135060202920.hoa' '-atoms' '/tmp/LTL17900815570875931866.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17900815570875931866.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1990518135060202920.hoa
Detected timeout of ITS tools.
[2025-06-01 11:09:34] [INFO ] Flatten gal took : 13 ms
[2025-06-01 11:09:34] [INFO ] Flatten gal took : 13 ms
[2025-06-01 11:09:34] [INFO ] Time to serialize gal into /tmp/LTL17186224724482527510.gal : 3 ms
[2025-06-01 11:09:34] [INFO ] Time to serialize properties into /tmp/LTL9877026037162513858.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17186224724482527510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9877026037162513858.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("((newmsg6>=1)&&(election_15_3_6_to_right_5>=1))")U(X((F("((newmsg6>=1)&&(election_15_3_6_to_right_5>=1))"))&&((!("((reply_15_1_le...353
Formula 0 simplified : !"((newmsg6>=1)&&(election_15_3_6_to_right_5>=1))" R X(G!"((newmsg6>=1)&&(election_15_3_6_to_right_5>=1))" | ("((reply_15_1_left15>=...280
Detected timeout of ITS tools.
[2025-06-01 11:09:49] [INFO ] Flatten gal took : 25 ms
[2025-06-01 11:09:49] [INFO ] Applying decomposition
[2025-06-01 11:09:49] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1241102850644476679.txt' '-o' '/tmp/graph1241102850644476679.bin' '-w' '/tmp/graph1241102850644476679.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1241102850644476679.bin' '-l' '-1' '-v' '-w' '/tmp/graph1241102850644476679.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:09:49] [INFO ] Decomposing Gal with order
[2025-06-01 11:09:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:09:49] [INFO ] Removed a total of 21 redundant transitions.
[2025-06-01 11:09:49] [INFO ] Flatten gal took : 292 ms
[2025-06-01 11:09:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-01 11:09:49] [INFO ] Time to serialize gal into /tmp/LTL13367854912153999047.gal : 5 ms
[2025-06-01 11:09:49] [INFO ] Time to serialize properties into /tmp/LTL11208006633467396568.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13367854912153999047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11208006633467396568.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((("((i2.u14.newmsg6>=1)&&(i2.u14.election_15_3_6_to_right_5>=1))")U(X((F("((i2.u14.newmsg6>=1)&&(i2.u14.election_15_3_6_to_right_5>=...433
Formula 0 simplified : !"((i2.u14.newmsg6>=1)&&(i2.u14.election_15_3_6_to_right_5>=1))" R X(G!"((i2.u14.newmsg6>=1)&&(i2.u14.election_15_3_6_to_right_5>=1)...346
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t8, t10, t12, t13, t14, t26, t35, t260, t275, i0.u0.t20, i0.u0.t230, ...554
Computing Next relation with stutter on 1.09863e+11 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-03 finished in 348165 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((p0||X(X(G(p1))))))))'
Support contains 3 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 289 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 289 transition count 270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 286 transition count 267
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 286 transition count 267
Applied a total of 18 rules in 43 ms. Remains 286 /295 variables (removed 9) and now considering 267/276 (removed 9) transitions.
// Phase 1: matrix 267 rows 286 cols
[2025-06-01 11:10:04] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:10:05] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-06-01 11:10:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:10:07] [INFO ] Implicit Places using invariants and state equation in 1689 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-01 11:10:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 305 constraints, problems are : Problem set: 0 solved, 252 unsolved in 26032 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 252/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 557 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56086ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 56087ms
Starting structural reductions in LTL mode, iteration 1 : 286/295 places, 267/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58237 ms. Remains : 286/295 places, 267/276 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-04
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-04 finished in 58477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 13 places and 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 282 transition count 158
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 177 transition count 158
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 216 place count 171 transition count 152
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 171 transition count 152
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 225 place count 171 transition count 149
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 228 place count 168 transition count 149
Applied a total of 228 rules in 17 ms. Remains 168 /295 variables (removed 127) and now considering 149/276 (removed 127) transitions.
// Phase 1: matrix 149 rows 168 cols
[2025-06-01 11:11:03] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:11:03] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-01 11:11:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:11:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 11:11:04] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:11:04] [INFO ] Redundant transitions in 1 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-01 11:11:04] [INFO ] Invariant cache hit.
[2025-06-01 11:11:04] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 3/145 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 126/271 variables, 145/164 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 2/273 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/317 variables, and 173 constraints, problems are : Problem set: 0 solved, 123 unsolved in 15013 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 146/168 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 3/145 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 126/271 variables, 145/164 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 110/282 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 2/273 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 13/296 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/273 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/317 variables, and 296 constraints, problems are : Problem set: 0 solved, 123 unsolved in 23500 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 146/168 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38532ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 38533ms
Starting structural reductions in SI_LTL mode, iteration 1 : 168/295 places, 149/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39352 ms. Remains : 168/295 places, 149/276 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-05
Product exploration explored 100000 steps with 4051 reset in 273 ms.
Product exploration explored 100000 steps with 4015 reset in 315 ms.
Computed a total of 168 stabilizing places and 149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 68 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2025-06-01 11:11:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 11:11:44] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 52 ms returned sat
[2025-06-01 11:11:45] [INFO ] [Real]Absence check using state equation in 1282 ms returned sat
[2025-06-01 11:11:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 11:11:45] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 20 ms returned sat
[2025-06-01 11:11:45] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2025-06-01 11:11:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 11:11:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 30 ms returned sat
[2025-06-01 11:11:45] [INFO ] Computed and/alt/rep : 111/136/111 causal constraints (skipped 12 transitions) in 9 ms.
[2025-06-01 11:11:46] [INFO ] Added : 10 causal constraints over 2 iterations in 152 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 149/149 transitions.
Applied a total of 0 rules in 9 ms. Remains 168 /168 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2025-06-01 11:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:11:46] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-01 11:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:11:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 11:11:46] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:11:46] [INFO ] Redundant transitions in 1 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-01 11:11:46] [INFO ] Invariant cache hit.
[2025-06-01 11:11:46] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 3/145 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 126/271 variables, 145/164 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 2/273 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/317 variables, and 173 constraints, problems are : Problem set: 0 solved, 123 unsolved in 15543 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 146/168 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 3/145 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 126/271 variables, 145/164 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 110/282 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 2/273 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 13/296 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/273 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/317 variables, and 296 constraints, problems are : Problem set: 0 solved, 123 unsolved in 23924 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 146/168 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39480ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 39480ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40247 ms. Remains : 168/168 places, 149/149 transitions.
Computed a total of 168 stabilizing places and 149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 73 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2025-06-01 11:12:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 11:12:26] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 53 ms returned sat
[2025-06-01 11:12:28] [INFO ] [Real]Absence check using state equation in 1284 ms returned sat
[2025-06-01 11:12:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 11:12:28] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 22 ms returned sat
[2025-06-01 11:12:28] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2025-06-01 11:12:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 11:12:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 31 ms returned sat
[2025-06-01 11:12:28] [INFO ] Computed and/alt/rep : 111/136/111 causal constraints (skipped 12 transitions) in 8 ms.
[2025-06-01 11:12:29] [INFO ] Added : 10 causal constraints over 2 iterations in 164 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4022 reset in 245 ms.
Product exploration explored 100000 steps with 4020 reset in 266 ms.
Built C files in :
/tmp/ltsmin12518440076766325314
[2025-06-01 11:12:29] [INFO ] Computing symmetric may disable matrix : 149 transitions.
[2025-06-01 11:12:29] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:12:29] [INFO ] Computing symmetric may enable matrix : 149 transitions.
[2025-06-01 11:12:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:12:29] [INFO ] Computing Do-Not-Accords matrix : 149 transitions.
[2025-06-01 11:12:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:12:29] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12518440076766325314
Running compilation step : cd /tmp/ltsmin12518440076766325314;'/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 305 ms.
Running link step : cd /tmp/ltsmin12518440076766325314;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12518440076766325314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15600730411875576515.hoa' '--buchi-type=spotba'
LTSmin run took 2088 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-15-LTLFireability-05 finished in 88777 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) U X((p1||X(((!p1 U p2) U (p1&&(!p1 U p2))))))))'
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 288 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 285 transition count 266
Applied a total of 20 rules in 19 ms. Remains 285 /295 variables (removed 10) and now considering 266/276 (removed 10) transitions.
// Phase 1: matrix 266 rows 285 cols
[2025-06-01 11:12:32] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:12:32] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-01 11:12:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:12:33] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-01 11:12: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/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 27017 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57066ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 57068ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 266/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58868 ms. Remains : 285/295 places, 266/276 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), p0, (OR (NOT p1) (AND p0 (NOT p2))), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-07
Stuttering criterion allowed to conclude after 308 steps with 8 reset in 3 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-07 finished in 59137 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||F(p1))) U ((G(p0)||F(p3))&&p2)))'
Support contains 7 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 11 places and 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 284 transition count 169
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 188 transition count 169
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 197 place count 183 transition count 164
Iterating global reduction 2 with 5 rules applied. Total rules applied 202 place count 183 transition count 164
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 205 place count 183 transition count 161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 208 place count 180 transition count 161
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 209 place count 179 transition count 160
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 179 transition count 160
Applied a total of 210 rules in 26 ms. Remains 179 /295 variables (removed 116) and now considering 160/276 (removed 116) transitions.
// Phase 1: matrix 160 rows 179 cols
[2025-06-01 11:13:31] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:13:31] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-01 11:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:13:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-01 11:13:32] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:13:32] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2025-06-01 11:13:32] [INFO ] Invariant cache hit.
[2025-06-01 11:13:32] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 4/163 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 144/307 variables, 163/182 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 16/198 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/339 variables, and 198 constraints, problems are : Problem set: 0 solved, 140 unsolved in 13654 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 163/179 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 4/163 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 144/307 variables, 163/182 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 16/198 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 140/338 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/339 variables, and 338 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 163/179 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43679ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 43680ms
Starting structural reductions in SI_LTL mode, iteration 1 : 179/295 places, 160/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44491 ms. Remains : 179/295 places, 160/276 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 729 reset in 174 ms.
Product exploration explored 100000 steps with 731 reset in 173 ms.
Computed a total of 179 stabilizing places and 160 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 179 transition count 160
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p3)), (X (NOT (AND p2 (NOT p0) (NOT p3) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))), (X (AND (NOT p3) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND p2 p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be false thanks to negative knowledge :(X (X (AND p2 (NOT p0) (NOT p3) (NOT p1))))
Knowledge based reduction with 24 factoid took 187 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-08 finished in 45370 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 ((G(p1) U p2) U X(p3))))'
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 289 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 289 transition count 270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 287 transition count 268
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 287 transition count 268
Applied a total of 16 rules in 19 ms. Remains 287 /295 variables (removed 8) and now considering 268/276 (removed 8) transitions.
// Phase 1: matrix 268 rows 287 cols
[2025-06-01 11:14:16] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:14:16] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-01 11:14:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:14:18] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-06-01 11:14:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 27013 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57056ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 57058ms
Starting structural reductions in LTL mode, iteration 1 : 287/295 places, 268/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58872 ms. Remains : 287/295 places, 268/276 transitions.
Stuttering acceptance computed with spot in 482 ms :[(NOT p3), (NOT p3), (AND p0 (NOT p3)), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), true, p0, (NOT p1), (AND p0 (NOT p1)), (NOT p2), (AND p1 (NOT p2) p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-09 finished in 59382 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 3 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 281 transition count 159
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 206 place count 178 transition count 159
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 213 place count 171 transition count 152
Iterating global reduction 2 with 7 rules applied. Total rules applied 220 place count 171 transition count 152
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 224 place count 171 transition count 148
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 228 place count 167 transition count 148
Applied a total of 228 rules in 15 ms. Remains 167 /295 variables (removed 128) and now considering 148/276 (removed 128) transitions.
// Phase 1: matrix 148 rows 167 cols
[2025-06-01 11:15:16] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:15:16] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-01 11:15:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:15:16] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:15:16] [INFO ] Redundant transitions in 1 ms returned []
Running 121 sub problems to find dead transitions.
[2025-06-01 11:15:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 2/142 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 123/265 variables, 142/161 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 2/267 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/315 variables, and 162 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8187 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 143/167 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 2/142 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 123/265 variables, 142/161 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 109/270 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 2/267 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/267 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/315 variables, and 283 constraints, problems are : Problem set: 0 solved, 121 unsolved in 29246 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 143/167 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37442ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 37445ms
Starting structural reductions in SI_LTL mode, iteration 1 : 167/295 places, 148/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38167 ms. Remains : 167/295 places, 148/276 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-10
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-10 finished in 38209 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(((p1 U p2)&&p0))))'
Support contains 6 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 10 places and 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 285 transition count 175
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 182 place count 194 transition count 175
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 189 place count 187 transition count 168
Iterating global reduction 2 with 7 rules applied. Total rules applied 196 place count 187 transition count 168
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 200 place count 187 transition count 164
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 204 place count 183 transition count 164
Applied a total of 204 rules in 20 ms. Remains 183 /295 variables (removed 112) and now considering 164/276 (removed 112) transitions.
// Phase 1: matrix 164 rows 183 cols
[2025-06-01 11:15:54] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:15:54] [INFO ] Implicit Places using invariants in 327 ms returned []
[2025-06-01 11:15:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:15:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 11:15:55] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:15:55] [INFO ] Redundant transitions in 0 ms returned []
Running 143 sub problems to find dead transitions.
[2025-06-01 11:15:55] [INFO ] Invariant cache hit.
[2025-06-01 11:15:55] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 6/168 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 149/317 variables, 168/187 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 14/201 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 2/319 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/319 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/347 variables, and 202 constraints, problems are : Problem set: 0 solved, 143 unsolved in 26890 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 169/183 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 6/168 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 149/317 variables, 168/187 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 14/201 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 131/332 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 2/319 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 12/345 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/347 variables, and 345 constraints, problems are : Problem set: 0 solved, 143 unsolved in 30009 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 169/183 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56924ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 56925ms
Starting structural reductions in SI_LTL mode, iteration 1 : 183/295 places, 164/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57902 ms. Remains : 183/295 places, 164/276 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-11
Stuttering criterion allowed to conclude after 180 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-11 finished in 58015 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(G(p0)))'
Support contains 1 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 288 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 285 transition count 266
Applied a total of 20 rules in 16 ms. Remains 285 /295 variables (removed 10) and now considering 266/276 (removed 10) transitions.
// Phase 1: matrix 266 rows 285 cols
[2025-06-01 11:16:52] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:16:52] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-01 11:16:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:16:54] [INFO ] Implicit Places using invariants and state equation in 1902 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-01 11:16: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/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26504 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56564ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56565ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 266/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58621 ms. Remains : 285/295 places, 266/276 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-13
Entered a terminal (fully accepting) state of product in 209 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-13 finished in 58707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((X(p0) U p1)||p1) U X((G(F(p3))&&p2))))))'
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 290 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 290 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 288 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 288 transition count 269
Applied a total of 14 rules in 15 ms. Remains 288 /295 variables (removed 7) and now considering 269/276 (removed 7) transitions.
// Phase 1: matrix 269 rows 288 cols
[2025-06-01 11:17:50] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:17:51] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-01 11:17:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:17:52] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2025-06-01 11:17: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/273 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 15/288 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 269/557 variables, 288/307 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 307 constraints, problems are : Problem set: 0 solved, 254 unsolved in 27332 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 15/288 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 269/557 variables, 288/307 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 254/561 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 561 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57374ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 57375ms
Starting structural reductions in LTL mode, iteration 1 : 288/295 places, 269/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59364 ms. Remains : 288/295 places, 269/276 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-14
Stuttering criterion allowed to conclude after 296 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-14 finished in 59720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))&&F(p2)))'
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 288 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 285 transition count 266
Applied a total of 20 rules in 16 ms. Remains 285 /295 variables (removed 10) and now considering 266/276 (removed 10) transitions.
// Phase 1: matrix 266 rows 285 cols
[2025-06-01 11:18:50] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:18:50] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-06-01 11:18:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:18:52] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1719 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-01 11:18: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/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 25863 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55913ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 55913ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 266/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57649 ms. Remains : 285/295 places, 266/276 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1339 steps with 4 reset in 8 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-15 finished in 57886 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' '!((p0 U X((F(p0)&&(!p1 U (p2||G(!p1)))))))'
[2025-06-01 11:19:48] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11257746285969042555
[2025-06-01 11:19:48] [INFO ] Computing symmetric may disable matrix : 276 transitions.
[2025-06-01 11:19:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:19:48] [INFO ] Computing symmetric may enable matrix : 276 transitions.
[2025-06-01 11:19:48] [INFO ] Applying decomposition
[2025-06-01 11:19:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:19:48] [INFO ] Flatten gal took : 12 ms
[2025-06-01 11:19:48] [INFO ] Computing Do-Not-Accords matrix : 276 transitions.
[2025-06-01 11:19:48] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12286505839220100140.txt' '-o' '/tmp/graph12286505839220100140.bin' '-w' '/tmp/graph12286505839220100140.weights'
[2025-06-01 11:19:48] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11257746285969042555
Running compilation step : cd /tmp/ltsmin11257746285969042555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12286505839220100140.bin' '-l' '-1' '-v' '-w' '/tmp/graph12286505839220100140.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:19:48] [INFO ] Decomposing Gal with order
[2025-06-01 11:19:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:19:48] [INFO ] Removed a total of 47 redundant transitions.
[2025-06-01 11:19:48] [INFO ] Flatten gal took : 25 ms
[2025-06-01 11:19:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-01 11:19:48] [INFO ] Time to serialize gal into /tmp/LTLFireability2755079993018102905.gal : 4 ms
[2025-06-01 11:19:48] [INFO ] Time to serialize properties into /tmp/LTLFireability12545306046428727666.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2755079993018102905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12545306046428727666.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("((i1.u18.newmsg6>=1)&&(i1.u28.election_15_3_6_to_right_5>=1))")U(X((F("((i1.u18.newmsg6>=1)&&(i1.u28.election_15_3_6_to_right_5>=...433
Formula 0 simplified : !"((i1.u18.newmsg6>=1)&&(i1.u28.election_15_3_6_to_right_5>=1))" R X(G!"((i1.u18.newmsg6>=1)&&(i1.u28.election_15_3_6_to_right_5>=1)...346
Compilation finished in 575 ms.
Running link step : cd /tmp/ltsmin11257746285969042555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11257746285969042555;'/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' '--ltl' '((LTLAPp0==true) U X((<>((LTLAPp0==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t8, t9, t11, t12, t13, t14, t26, t260, t275, i0.t230, i0.u1.t18, ...578
Computing Next relation with stutter on 4.374e+11 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9839 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,98.4333,1328276,1,0,2.67647e+06,132107,4221,4.28588e+06,1734,959066,1940799
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-15-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1359186 ms.

BK_STOP 1748777032437

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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