Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 927K 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 Anderson-PT-09-LTLCardinality-00
FORMULA_NAME Anderson-PT-09-LTLCardinality-01
FORMULA_NAME Anderson-PT-09-LTLCardinality-02
FORMULA_NAME Anderson-PT-09-LTLCardinality-03
FORMULA_NAME Anderson-PT-09-LTLCardinality-04
FORMULA_NAME Anderson-PT-09-LTLCardinality-05
FORMULA_NAME Anderson-PT-09-LTLCardinality-06
FORMULA_NAME Anderson-PT-09-LTLCardinality-07
FORMULA_NAME Anderson-PT-09-LTLCardinality-08
FORMULA_NAME Anderson-PT-09-LTLCardinality-09
FORMULA_NAME Anderson-PT-09-LTLCardinality-10
FORMULA_NAME Anderson-PT-09-LTLCardinality-11
FORMULA_NAME Anderson-PT-09-LTLCardinality-12
FORMULA_NAME Anderson-PT-09-LTLCardinality-13
FORMULA_NAME Anderson-PT-09-LTLCardinality-14
FORMULA_NAME Anderson-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748545871103

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 19:11:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 19:11:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:11:12] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2025-05-29 19:11:12] [INFO ] Transformed 505 places.
[2025-05-29 19:11:12] [INFO ] Transformed 1845 transitions.
[2025-05-29 19:11:12] [INFO ] Found NUPN structural information;
[2025-05-29 19:11:12] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-09-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 134 place count 371 transition count 623
Iterating global reduction 0 with 134 rules applied. Total rules applied 268 place count 371 transition count 623
Applied a total of 268 rules in 84 ms. Remains 371 /505 variables (removed 134) and now considering 623/1845 (removed 1222) transitions.
// Phase 1: matrix 623 rows 371 cols
[2025-05-29 19:11:12] [INFO ] Computed 21 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:11:13] [INFO ] Implicit Places using invariants in 660 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 691 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 370/505 places, 623/1845 transitions.
Applied a total of 0 rules in 15 ms. Remains 370 /370 variables (removed 0) and now considering 623/623 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 804 ms. Remains : 370/505 places, 623/1845 transitions.
Support contains 21 out of 370 places after structural reductions.
[2025-05-29 19:11:13] [INFO ] Flatten gal took : 68 ms
[2025-05-29 19:11:13] [INFO ] Flatten gal took : 45 ms
[2025-05-29 19:11:13] [INFO ] Input system was already deterministic with 623 transitions.
Support contains 20 out of 370 places (down from 21) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1144 ms. (34 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
// Phase 1: matrix 623 rows 370 cols
[2025-05-29 19:11:14] [INFO ] Computed 20 invariants in 12 ms
[2025-05-29 19:11:14] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 343/345 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/352 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/370 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 623/993 variables, 370/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/993 variables, 72/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/993 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/993 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 993/993 variables, and 462 constraints, problems are : Problem set: 0 solved, 1 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 370/370 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 343/345 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/352 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/370 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 623/993 variables, 370/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/993 variables, 72/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/993 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/993 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/993 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 993/993 variables, and 463 constraints, problems are : Problem set: 0 solved, 1 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 370/370 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 981ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 623/623 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 370 transition count 542
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 289 transition count 542
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 162 place count 289 transition count 472
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 302 place count 219 transition count 472
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 310 place count 211 transition count 400
Iterating global reduction 2 with 8 rules applied. Total rules applied 318 place count 211 transition count 400
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 322 place count 209 transition count 398
Applied a total of 322 rules in 61 ms. Remains 209 /370 variables (removed 161) and now considering 398/623 (removed 225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 209/370 places, 398/623 transitions.
RANDOM walk for 40000 steps (8 resets) in 546 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 328529 steps, run visited all 1 properties in 819 ms. (steps per millisecond=401 )
Probabilistic random walk after 328529 steps, saw 231885 distinct states, run finished after 822 ms. (steps per millisecond=399 ) properties seen :1
FORMULA Anderson-PT-09-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-09-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 623/623 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 362 transition count 583
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 362 transition count 583
Applied a total of 16 rules in 26 ms. Remains 362 /370 variables (removed 8) and now considering 583/623 (removed 40) transitions.
// Phase 1: matrix 583 rows 362 cols
[2025-05-29 19:11:20] [INFO ] Computed 20 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:11:21] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-05-29 19:11:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:11:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:11:22] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
Running 574 sub problems to find dead transitions.
[2025-05-29 19:11:22] [INFO ] Invariant cache hit.
[2025-05-29 19:11:22] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:28] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:28] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:29] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:31] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:33] [INFO ] Deduced a trap composed of 63 places in 184 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:33] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:34] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:35] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:35] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:35] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:43] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:11:46] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 574 unsolved
((s0 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0timeout
)
(s1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/945 variables, and 32 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/362 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/945 variables, and 32 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/362 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/574 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60302ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Starting structural reductions in LTL mode, iteration 1 : 362/370 places, 583/623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62236 ms. Remains : 362/370 places, 583/623 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-09-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-00 finished in 66041 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(G(!p1))))'
Support contains 3 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 623/623 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 361 transition count 550
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 361 transition count 550
Applied a total of 18 rules in 11 ms. Remains 361 /370 variables (removed 9) and now considering 550/623 (removed 73) transitions.
// Phase 1: matrix 550 rows 361 cols
[2025-05-29 19:12:23] [INFO ] Computed 20 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:12:23] [INFO ] Implicit Places using invariants in 451 ms returned []
[2025-05-29 19:12:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:12:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:12:25] [INFO ] Implicit Places using invariants and state equation in 2024 ms returned []
Implicit Place search using SMT with State Equation took 2485 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2025-05-29 19:12:25] [INFO ] Invariant cache hit.
[2025-05-29 19:12:25] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:12:31] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:12:33] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:12:33] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:12:47] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:12:50] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:12:54] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:12:54] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/911 variables, and 27 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 541 unsolved
SMT process timed out in 60293ms, After SMT, problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Starting structural reductions in LTL mode, iteration 1 : 361/370 places, 550/623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62794 ms. Remains : 361/370 places, 550/623 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-03
Product exploration explored 100000 steps with 32 reset in 357 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 78 in 1 ms.
FORMULA Anderson-PT-09-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-03 finished in 63328 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(X(X((p1&&X(p1)))))))'
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 623/623 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 362 transition count 551
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 362 transition count 551
Applied a total of 16 rules in 11 ms. Remains 362 /370 variables (removed 8) and now considering 551/623 (removed 72) transitions.
// Phase 1: matrix 551 rows 362 cols
[2025-05-29 19:13:26] [INFO ] Computed 20 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:13:26] [INFO ] Implicit Places using invariants in 306 ms returned []
[2025-05-29 19:13:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:13:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:13:28] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2025-05-29 19:13:28] [INFO ] Invariant cache hit.
[2025-05-29 19:13:28] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:13:33] [INFO ] Deduced a trap composed of 79 places in 178 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:13:35] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:13:36] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 4 (OVERLAPS) 1/362 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)timeout

(s265 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 551/913 variables, 362/385 constraints. Problems are: Problem set: 0 solved, 542 unsolved
SMT process timed out in 30127ms, After SMT, problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 30131ms
Starting structural reductions in LTL mode, iteration 1 : 362/370 places, 551/623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32128 ms. Remains : 362/370 places, 551/623 transitions.
Stuttering acceptance computed with spot in 552 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-05
Product exploration explored 100000 steps with 22222 reset in 585 ms.
Product exploration explored 100000 steps with 22241 reset in 216 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 12 states, 20 edges and 2 AP (stutter sensitive) to 12 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 521 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (8 resets) in 445 ms. (89 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
[2025-05-29 19:14:00] [INFO ] Invariant cache hit.
[2025-05-29 19:14:00] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 335/339 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/353 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/362 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 551/913 variables, 362/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/913 variables, 72/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/913 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 335/339 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/353 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:01] [INFO ] Deduced a trap composed of 263 places in 200 ms of which 66 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/362 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 551/913 variables, 362/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 72/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/913 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 457 constraints, problems are : Problem set: 0 solved, 2 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1209ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 551/551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 362 transition count 472
Reduce places removed 79 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 283 transition count 470
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 281 transition count 470
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 162 place count 281 transition count 400
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 302 place count 211 transition count 400
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 306 place count 209 transition count 398
Applied a total of 306 rules in 42 ms. Remains 209 /362 variables (removed 153) and now considering 398/551 (removed 153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 209/362 places, 398/551 transitions.
RANDOM walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 328529 steps, run visited all 2 properties in 2071 ms. (steps per millisecond=158 )
Probabilistic random walk after 328529 steps, saw 231885 distinct states, run finished after 2071 ms. (steps per millisecond=158 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 12 states, 20 edges and 2 AP (stutter sensitive) to 12 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 502 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 515 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 551/551 transitions.
Applied a total of 0 rules in 8 ms. Remains 362 /362 variables (removed 0) and now considering 551/551 (removed 0) transitions.
[2025-05-29 19:14:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:14:06] [INFO ] Implicit Places using invariants in 316 ms returned []
[2025-05-29 19:14:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:14:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:14:07] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2025-05-29 19:14:07] [INFO ] Invariant cache hit.
[2025-05-29 19:14:07] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:13] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:15] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:15] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 4 (OVERLAPS) 1/362 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 6 (OVERLAPS) 551/913 variables, 362/385 constraints. Problems are: Problem set: 0 solved, 542 unsolved
SMT process timed out in 30142ms, After SMT, problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 30148ms
Finished structural reductions in LTL mode , in 1 iterations and 32213 ms. Remains : 362/362 places, 551/551 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 12 states, 20 edges and 2 AP (stutter sensitive) to 12 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 506 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
[2025-05-29 19:14:38] [INFO ] Invariant cache hit.
[2025-05-29 19:14:38] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 335/339 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/353 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/362 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 551/913 variables, 362/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/913 variables, 72/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/913 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 335/339 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/353 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:39] [INFO ] Deduced a trap composed of 263 places in 205 ms of which 67 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/362 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 551/913 variables, 362/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 72/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/913 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 457 constraints, problems are : Problem set: 0 solved, 2 unsolved in 865 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1191ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 551/551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 362 transition count 472
Reduce places removed 79 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 283 transition count 470
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 281 transition count 470
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 162 place count 281 transition count 400
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 302 place count 211 transition count 400
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 306 place count 209 transition count 398
Applied a total of 306 rules in 31 ms. Remains 209 /362 variables (removed 153) and now considering 398/551 (removed 153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 209/362 places, 398/551 transitions.
RANDOM walk for 40000 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 328529 steps, run visited all 2 properties in 2038 ms. (steps per millisecond=161 )
Probabilistic random walk after 328529 steps, saw 231885 distinct states, run finished after 2039 ms. (steps per millisecond=161 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 226 ms. Reduced automaton from 12 states, 20 edges and 2 AP (stutter sensitive) to 12 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 507 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 526 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 523 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 22214 reset in 188 ms.
Product exploration explored 100000 steps with 22214 reset in 182 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 486 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 551/551 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 362 transition count 551
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 70 Pre rules applied. Total rules applied 81 place count 362 transition count 551
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 151 place count 362 transition count 551
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 153 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 362 transition count 551
Deduced a syphon composed of 153 places in 1 ms
Applied a total of 153 rules in 43 ms. Remains 362 /362 variables (removed 0) and now considering 551/551 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:14:45] [INFO ] Redundant transitions in 30 ms returned []
Running 542 sub problems to find dead transitions.
// Phase 1: matrix 551 rows 362 cols
[2025-05-29 19:14:45] [INFO ] Computed 20 invariants in 8 ms
[2025-05-29 19:14:45] [INFO ] State equation strengthened by 133 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:48] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:48] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:48] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:49] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:49] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:49] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:50] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 18 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:51] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:14:51] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 12/31 constraints. Problems are: Problem set: 153 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/31 constraints. Problems are: Problem set: 153 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 1/362 variables, 1/32 constraints. Problems are: Problem set: 153 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/32 constraints. Problems are: Problem set: 153 solved, 389 unsolved
At refinement iteration 6 (OVERLAPS) 551/913 variables, 362/394 constraints. Problems are: Problem set: 153 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/913 variables, 133/527 constraints. Problems are: Problem set: 153 solved, 389 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:15:14] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 913/913 variables, and 528 constraints, problems are : Problem set: 153 solved, 389 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 362/362 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 153 solved, 389 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 12/12 constraints. Problems are: Problem set: 153 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/12 constraints. Problems are: Problem set: 153 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 153/361 variables, 10/22 constraints. Problems are: Problem set: 153 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 9/31 constraints. Problems are: Problem set: 153 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/31 constraints. Problems are: Problem set: 153 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 1/362 variables, 1/32 constraints. Problems are: Problem set: 153 solved, 389 unsolved
SMT process timed out in 60178ms, After SMT, problems are : Problem set: 153 solved, 389 unsolved
Search for dead transitions found 153 dead transitions in 60179ms
Found 153 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 153 transitions
Dead transitions reduction (with SMT) removed 153 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 362/362 places, 398/551 transitions.
Graph (complete) has 1092 edges and 362 vertex of which 209 are kept as prefixes of interest. Removing 153 places using SCC suffix rule.3 ms
Discarding 153 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 209 /362 variables (removed 153) and now considering 398/398 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/362 places, 398/551 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60278 ms. Remains : 209/362 places, 398/551 transitions.
Built C files in :
/tmp/ltsmin11102939824414943259
[2025-05-29 19:15:45] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11102939824414943259
Running compilation step : cd /tmp/ltsmin11102939824414943259;'/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 1026 ms.
Running link step : cd /tmp/ltsmin11102939824414943259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11102939824414943259;'/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/stateBased11249306519958347956.hoa' '--buchi-type=spotba'
LTSmin run took 664 ms.
FORMULA Anderson-PT-09-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-09-LTLCardinality-05 finished in 140458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 623/623 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 361 transition count 550
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 361 transition count 550
Applied a total of 18 rules in 28 ms. Remains 361 /370 variables (removed 9) and now considering 550/623 (removed 73) transitions.
// Phase 1: matrix 550 rows 361 cols
[2025-05-29 19:15:47] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:15:47] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-05-29 19:15:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:15:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:15:48] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2025-05-29 19:15:48] [INFO ] Invariant cache hit.
[2025-05-29 19:15:48] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:15:54] [INFO ] Deduced a trap composed of 79 places in 178 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:15:55] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:15:56] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:16:00] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:16:00] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 41 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 1/361 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:16:12] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 31 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/911 variables, and 26 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 541 unsolved
SMT process timed out in 60141ms, After SMT, problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 361/370 places, 550/623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61851 ms. Remains : 361/370 places, 550/623 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-07 finished in 61949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 623/623 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 361 transition count 566
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 361 transition count 566
Applied a total of 18 rules in 11 ms. Remains 361 /370 variables (removed 9) and now considering 566/623 (removed 57) transitions.
// Phase 1: matrix 566 rows 361 cols
[2025-05-29 19:16:49] [INFO ] Computed 20 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:16:49] [INFO ] Implicit Places using invariants in 441 ms returned []
[2025-05-29 19:16:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:16:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:16:51] [INFO ] Implicit Places using invariants and state equation in 1931 ms returned []
Implicit Place search using SMT with State Equation took 2382 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2025-05-29 19:16:51] [INFO ] Invariant cache hit.
[2025-05-29 19:16:51] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:16:56] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:16:57] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:16:57] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:16:58] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:16:58] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:00] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 55 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (OVERLAPS) 566/927 variables, 361/387 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/927 variables, 72/459 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:17] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:18] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:18] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 927/927 variables, and 462 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:28] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/927 variables, and 30 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/557 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 361/370 places, 566/623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62557 ms. Remains : 361/370 places, 566/623 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-14 finished in 62690 ms.
All properties solved by simple procedures.
Total runtime 399346 ms.

BK_STOP 1748546271733

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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