fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r002-tall-174853728800195
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Anderson-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 F?FFTFFFFTFFTTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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.6K 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 1.3M 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-10-LTLCardinality-00
FORMULA_NAME Anderson-PT-10-LTLCardinality-01
FORMULA_NAME Anderson-PT-10-LTLCardinality-02
FORMULA_NAME Anderson-PT-10-LTLCardinality-03
FORMULA_NAME Anderson-PT-10-LTLCardinality-04
FORMULA_NAME Anderson-PT-10-LTLCardinality-05
FORMULA_NAME Anderson-PT-10-LTLCardinality-06
FORMULA_NAME Anderson-PT-10-LTLCardinality-07
FORMULA_NAME Anderson-PT-10-LTLCardinality-08
FORMULA_NAME Anderson-PT-10-LTLCardinality-09
FORMULA_NAME Anderson-PT-10-LTLCardinality-10
FORMULA_NAME Anderson-PT-10-LTLCardinality-11
FORMULA_NAME Anderson-PT-10-LTLCardinality-12
FORMULA_NAME Anderson-PT-10-LTLCardinality-13
FORMULA_NAME Anderson-PT-10-LTLCardinality-14
FORMULA_NAME Anderson-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748548287002

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 19:51:28] [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:51:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:51:28] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2025-05-29 19:51:28] [INFO ] Transformed 621 places.
[2025-05-29 19:51:28] [INFO ] Transformed 2480 transitions.
[2025-05-29 19:51:28] [INFO ] Found NUPN structural information;
[2025-05-29 19:51:28] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 169 places :
Symmetric choice reduction at 0 with 169 rule applications. Total rules 169 place count 452 transition count 727
Iterating global reduction 0 with 169 rules applied. Total rules applied 338 place count 452 transition count 727
Applied a total of 338 rules in 99 ms. Remains 452 /621 variables (removed 169) and now considering 727/2480 (removed 1753) transitions.
// Phase 1: matrix 727 rows 452 cols
[2025-05-29 19:51:28] [INFO ] Computed 23 invariants in 74 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:51:29] [INFO ] Implicit Places using invariants in 921 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 961 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 451/621 places, 727/2480 transitions.
Applied a total of 0 rules in 9 ms. Remains 451 /451 variables (removed 0) and now considering 727/727 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1086 ms. Remains : 451/621 places, 727/2480 transitions.
Support contains 25 out of 451 places after structural reductions.
[2025-05-29 19:51:29] [INFO ] Flatten gal took : 93 ms
[2025-05-29 19:51:30] [INFO ] Flatten gal took : 48 ms
[2025-05-29 19:51:30] [INFO ] Input system was already deterministic with 727 transitions.
RANDOM walk for 40000 steps (8 resets) in 1162 ms. (34 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 318 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
// Phase 1: matrix 727 rows 451 cols
[2025-05-29 19:51:31] [INFO ] Computed 22 invariants in 13 ms
[2025-05-29 19:51:31] [INFO ] State equation strengthened by 90 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 420/425 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/441 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/451 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 727/1178 variables, 451/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1178 variables, 90/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1178 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1178 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 563 constraints, problems are : Problem set: 0 solved, 3 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 451/451 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 420/425 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/441 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/451 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 727/1178 variables, 451/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1178 variables, 90/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1178 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1178 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1178 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 566 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 451/451 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2109ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 5 out of 451 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 451/451 places, 727/727 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 451 transition count 628
Reduce places removed 99 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 100 rules applied. Total rules applied 199 place count 352 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 351 transition count 627
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 200 place count 351 transition count 541
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 372 place count 265 transition count 541
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 379 place count 258 transition count 498
Iterating global reduction 3 with 7 rules applied. Total rules applied 386 place count 258 transition count 498
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 394 place count 254 transition count 494
Applied a total of 394 rules in 75 ms. Remains 254 /451 variables (removed 197) and now considering 494/727 (removed 233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 254/451 places, 494/727 transitions.
RANDOM walk for 40000 steps (8 resets) in 470 ms. (84 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 94968 steps, run visited all 3 properties in 471 ms. (steps per millisecond=201 )
Probabilistic random walk after 94968 steps, saw 72321 distinct states, run finished after 475 ms. (steps per millisecond=199 ) properties seen :3
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(X((X((X(!p1) U ((p2&&X(!p1))||X(G(!p1)))))&&p0))))'
Support contains 6 out of 451 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 451/451 places, 727/727 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 443 transition count 701
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 443 transition count 701
Applied a total of 16 rules in 24 ms. Remains 443 /451 variables (removed 8) and now considering 701/727 (removed 26) transitions.
// Phase 1: matrix 701 rows 443 cols
[2025-05-29 19:51:34] [INFO ] Computed 22 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:51:34] [INFO ] Implicit Places using invariants in 366 ms returned []
[2025-05-29 19:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:51:35] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 19:51:36] [INFO ] Implicit Places using invariants and state equation in 2071 ms returned []
Implicit Place search using SMT with State Equation took 2443 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2025-05-29 19:51:36] [INFO ] Invariant cache hit.
[2025-05-29 19:51:36] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:44] [INFO ] Deduced a trap composed of 59 places in 247 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:45] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:45] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:46] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:46] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:48] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:49] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:50] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 48 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:53] [INFO ] Deduced a trap composed of 60 places in 229 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:54] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:55] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:58] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1144 variables, and 34 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30244 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/443 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:10] [INFO ] Deduced a trap composed of 70 places in 209 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:14] [INFO ] Deduced a trap composed of 60 places in 235 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1144 variables, and 36 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/443 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/691 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60548ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60553ms
Starting structural reductions in LTL mode, iteration 1 : 443/451 places, 701/727 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63047 ms. Remains : 443/451 places, 701/727 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Anderson-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLCardinality-00 finished in 63436 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||X(p0)))))'
Support contains 1 out of 451 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 451/451 places, 727/727 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 441 transition count 681
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 441 transition count 681
Applied a total of 20 rules in 32 ms. Remains 441 /451 variables (removed 10) and now considering 681/727 (removed 46) transitions.
// Phase 1: matrix 681 rows 441 cols
[2025-05-29 19:52:37] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:52:38] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-05-29 19:52:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:52:38] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 19:52:40] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2025-05-29 19:52:40] [INFO ] Invariant cache hit.
[2025-05-29 19:52:40] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:47] [INFO ] Deduced a trap composed of 88 places in 213 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:50] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:51] [INFO ] Deduced a trap composed of 79 places in 231 ms of which 54 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:56] [INFO ] Deduced a trap composed of 79 places in 231 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:56] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:57] [INFO ] Deduced a trap composed of 80 places in 219 ms of which 46 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:08] [INFO ] Deduced a trap composed of 108 places in 223 ms of which 59 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/1122 variables, and 28 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/441 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:16] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:16] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:17] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:17] [INFO ] Deduced a trap composed of 108 places in 230 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:18] [INFO ] Deduced a trap composed of 108 places in 228 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:18] [INFO ] Deduced a trap composed of 108 places in 228 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:22] [INFO ] Deduced a trap composed of 79 places in 202 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:24] [INFO ] Deduced a trap composed of 80 places in 223 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:26] [INFO ] Deduced a trap composed of 108 places in 231 ms of which 56 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/1122 variables, and 37 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/441 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Starting structural reductions in LTL mode, iteration 1 : 441/451 places, 681/727 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62551 ms. Remains : 441/451 places, 681/727 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 240 ms.
Product exploration explored 100000 steps with 0 reset in 274 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 315016 steps, run visited all 1 properties in 950 ms. (steps per millisecond=331 )
Probabilistic random walk after 315016 steps, saw 234918 distinct states, run finished after 950 ms. (steps per millisecond=331 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 681/681 transitions.
Applied a total of 0 rules in 16 ms. Remains 441 /441 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2025-05-29 19:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:53:43] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-05-29 19:53:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:53:43] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 19:53:44] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2025-05-29 19:53:44] [INFO ] Invariant cache hit.
[2025-05-29 19:53:44] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:52] [INFO ] Deduced a trap composed of 88 places in 219 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:54] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:55] [INFO ] Deduced a trap composed of 79 places in 213 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:01] [INFO ] Deduced a trap composed of 79 places in 230 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:01] [INFO ] Deduced a trap composed of 79 places in 206 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:01] [INFO ] Deduced a trap composed of 80 places in 206 ms of which 45 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:12] [INFO ] Deduced a trap composed of 108 places in 219 ms of which 60 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/1122 variables, and 28 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/441 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:21] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:21] [INFO ] Deduced a trap composed of 79 places in 215 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:22] [INFO ] Deduced a trap composed of 79 places in 206 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:22] [INFO ] Deduced a trap composed of 108 places in 211 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:23] [INFO ] Deduced a trap composed of 108 places in 211 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:23] [INFO ] Deduced a trap composed of 108 places in 206 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:28] [INFO ] Deduced a trap composed of 80 places in 201 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:30] [INFO ] Deduced a trap composed of 108 places in 216 ms of which 55 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/1122 variables, and 37 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/441 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Finished structural reductions in LTL mode , in 1 iterations and 62505 ms. Remains : 441/441 places, 681/681 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 315016 steps, run visited all 1 properties in 929 ms. (steps per millisecond=339 )
Probabilistic random walk after 315016 steps, saw 234918 distinct states, run finished after 929 ms. (steps per millisecond=339 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 177 ms.
Built C files in :
/tmp/ltsmin11382087021556296170
[2025-05-29 19:54:47] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11382087021556296170
Running compilation step : cd /tmp/ltsmin11382087021556296170;'/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 1140 ms.
Running link step : cd /tmp/ltsmin11382087021556296170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11382087021556296170;'/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/stateBased15240306191350628627.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 681/681 transitions.
Applied a total of 0 rules in 15 ms. Remains 441 /441 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2025-05-29 19:55:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:55:02] [INFO ] Implicit Places using invariants in 356 ms returned []
[2025-05-29 19:55:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:55:03] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 19:55:04] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2025-05-29 19:55:04] [INFO ] Invariant cache hit.
[2025-05-29 19:55:04] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:11] [INFO ] Deduced a trap composed of 88 places in 216 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:14] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:15] [INFO ] Deduced a trap composed of 79 places in 222 ms of which 46 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:21] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:21] [INFO ] Deduced a trap composed of 79 places in 203 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:21] [INFO ] Deduced a trap composed of 80 places in 216 ms of which 45 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:32] [INFO ] Deduced a trap composed of 108 places in 234 ms of which 60 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/1122 variables, and 28 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/441 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:41] [INFO ] Deduced a trap composed of 79 places in 213 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:41] [INFO ] Deduced a trap composed of 79 places in 226 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:41] [INFO ] Deduced a trap composed of 79 places in 216 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:42] [INFO ] Deduced a trap composed of 108 places in 222 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:43] [INFO ] Deduced a trap composed of 108 places in 208 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:43] [INFO ] Deduced a trap composed of 108 places in 228 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:47] [INFO ] Deduced a trap composed of 79 places in 202 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:48] [INFO ] Deduced a trap composed of 80 places in 228 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:50] [INFO ] Deduced a trap composed of 108 places in 224 ms of which 55 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/1122 variables, and 37 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/441 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Finished structural reductions in LTL mode , in 1 iterations and 62431 ms. Remains : 441/441 places, 681/681 transitions.
Built C files in :
/tmp/ltsmin13444605173553130498
[2025-05-29 19:56:04] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13444605173553130498
Running compilation step : cd /tmp/ltsmin13444605173553130498;'/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 1018 ms.
Running link step : cd /tmp/ltsmin13444605173553130498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13444605173553130498;'/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/stateBased2515337025657284693.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 19:56:20] [INFO ] Flatten gal took : 33 ms
[2025-05-29 19:56:20] [INFO ] Flatten gal took : 30 ms
[2025-05-29 19:56:20] [INFO ] Time to serialize gal into /tmp/LTL14178208196228365245.gal : 6 ms
[2025-05-29 19:56:20] [INFO ] Time to serialize properties into /tmp/LTL1725798845916078218.prop : 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/LTL14178208196228365245.gal' '-t' 'CGAL' '-hoa' '/tmp/aut923986785635745495.hoa' '-atoms' '/tmp/LTL1725798845916078218.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...317
Loading property file /tmp/LTL1725798845916078218.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut923986785635745495.hoa
Detected timeout of ITS tools.
[2025-05-29 19:56:35] [INFO ] Flatten gal took : 26 ms
[2025-05-29 19:56:35] [INFO ] Flatten gal took : 24 ms
[2025-05-29 19:56:35] [INFO ] Time to serialize gal into /tmp/LTL16104828533892808151.gal : 5 ms
[2025-05-29 19:56:35] [INFO ] Time to serialize properties into /tmp/LTL5343706806883685670.ltl : 4 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/LTL16104828533892808151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5343706806883685670.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 : !((X(G(("(p1_5_16==0)")||(X("(p1_5_16==0)"))))))
Formula 0 simplified : XF(!"(p1_5_16==0)" & X!"(p1_5_16==0)")
Detected timeout of ITS tools.
[2025-05-29 19:56:50] [INFO ] Flatten gal took : 23 ms
[2025-05-29 19:56:50] [INFO ] Applying decomposition
[2025-05-29 19:56:50] [INFO ] Flatten gal took : 23 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/graph11970507285519170220.txt' '-o' '/tmp/graph11970507285519170220.bin' '-w' '/tmp/graph11970507285519170220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11970507285519170220.bin' '-l' '-1' '-v' '-w' '/tmp/graph11970507285519170220.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:56:50] [INFO ] Decomposing Gal with order
[2025-05-29 19:56:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:56:50] [INFO ] Removed a total of 1107 redundant transitions.
[2025-05-29 19:56:50] [INFO ] Flatten gal took : 89 ms
[2025-05-29 19:56:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 24 ms.
[2025-05-29 19:56:50] [INFO ] Time to serialize gal into /tmp/LTL13907108329491065824.gal : 11 ms
[2025-05-29 19:56:50] [INFO ] Time to serialize properties into /tmp/LTL12273045638242754461.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/LTL13907108329491065824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12273045638242754461.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 : !((X(G(("(i10.u40.p1_5_16==0)")||(X("(i10.u40.p1_5_16==0)"))))))
Formula 0 simplified : XF(!"(i10.u40.p1_5_16==0)" & X!"(i10.u40.p1_5_16==0)")
Detected timeout of ITS tools.
Treatment of property Anderson-PT-10-LTLCardinality-01 finished in 267968 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)) U G((F(p0) U (p1 U p2))))))'
Support contains 6 out of 451 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 451/451 places, 727/727 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 446 transition count 704
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 446 transition count 704
Applied a total of 10 rules in 24 ms. Remains 446 /451 variables (removed 5) and now considering 704/727 (removed 23) transitions.
// Phase 1: matrix 704 rows 446 cols
[2025-05-29 19:57:05] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:57:06] [INFO ] Implicit Places using invariants in 368 ms returned []
[2025-05-29 19:57:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:57:06] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 19:57:08] [INFO ] Implicit Places using invariants and state equation in 2582 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
Running 694 sub problems to find dead transitions.
[2025-05-29 19:57:08] [INFO ] Invariant cache hit.
[2025-05-29 19:57:08] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:16] [INFO ] Deduced a trap composed of 59 places in 192 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:16] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:19] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:21] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:21] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:24] [INFO ] Deduced a trap composed of 70 places in 203 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:25] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:25] [INFO ] Deduced a trap composed of 59 places in 195 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:25] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:26] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:26] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:26] [INFO ] Deduced a trap composed of 60 places in 192 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:28] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:29] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 42 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1150 variables, and 36 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/446 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 694 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:57:46] [INFO ] Deduced a trap composed of 71 places in 199 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1150 variables, and 37 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/446 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/694 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 694 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in LTL mode, iteration 1 : 446/451 places, 704/727 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63176 ms. Remains : 446/451 places, 704/727 transitions.
Stuttering acceptance computed with spot in 398 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-05
Product exploration explored 100000 steps with 20021 reset in 261 ms.
Product exploration explored 100000 steps with 19924 reset in 320 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 p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 133 ms. Reduced automaton from 10 states, 22 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
[2025-05-29 19:58:10] [INFO ] Invariant cache hit.
[2025-05-29 19:58:10] [INFO ] State equation strengthened by 90 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 414/420 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/436 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/446 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 704/1150 variables, 446/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1150 variables, 90/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1150 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1150 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1150/1150 variables, and 558 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 446/446 constraints, ReadFeed: 90/90 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 414/420 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/436 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/446 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 704/1150 variables, 446/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1150 variables, 90/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1150 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1150 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1150 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1150/1150 variables, and 560 constraints, problems are : Problem set: 0 solved, 2 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 446/446 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1139ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 704/704 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 446 transition count 605
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 347 transition count 605
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 198 place count 347 transition count 520
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 368 place count 262 transition count 520
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 378 place count 257 transition count 515
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 257 transition count 514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 380 place count 256 transition count 514
Applied a total of 380 rules in 41 ms. Remains 256 /446 variables (removed 190) and now considering 514/704 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 256/446 places, 514/704 transitions.
RANDOM walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 982879 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :1 out of 2
Probabilistic random walk after 982879 steps, saw 696026 distinct states, run finished after 3003 ms. (steps per millisecond=327 ) properties seen :1
// Phase 1: matrix 514 rows 256 cols
[2025-05-29 19:58:14] [INFO ] Computed 22 invariants in 9 ms
[2025-05-29 19:58:14] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/236 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 514/770 variables, 256/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 90/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/770 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/770 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 256/256 constraints, ReadFeed: 90/90 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/236 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 514/770 variables, 256/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 90/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/770 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/770 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/770 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 256/256 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 514/514 transitions.
Applied a total of 0 rules in 13 ms. Remains 256 /256 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 256/256 places, 514/514 transitions.
RANDOM walk for 40000 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1010015 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :0 out of 1
Probabilistic random walk after 1010015 steps, saw 714676 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
[2025-05-29 19:58:18] [INFO ] Invariant cache hit.
[2025-05-29 19:58:18] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/236 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 514/770 variables, 256/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 90/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/770 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/770 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 256/256 constraints, ReadFeed: 90/90 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/236 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 514/770 variables, 256/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 90/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/770 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/770 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/770 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 256/256 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 558ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 514/514 transitions.
Applied a total of 0 rules in 10 ms. Remains 256 /256 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 256/256 places, 514/514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 514/514 transitions.
Applied a total of 0 rules in 8 ms. Remains 256 /256 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2025-05-29 19:58:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:58:19] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-05-29 19:58:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:58:19] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 19:58:20] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:58:20] [INFO ] Redundant transitions in 29 ms returned []
Running 504 sub problems to find dead transitions.
[2025-05-29 19:58:20] [INFO ] Invariant cache hit.
[2025-05-29 19:58:20] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:24] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:24] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:24] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:24] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:24] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:25] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:25] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:25] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:25] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:25] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:26] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:29] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:35] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 6 (OVERLAPS) 514/770 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 90/381 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/770 variables, and 381 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 256/256 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/770 variables, and 35 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/256 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/504 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61509 ms. Remains : 256/256 places, 514/514 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 256 transition count 414
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 156 transition count 414
Applied a total of 200 rules in 11 ms. Remains 156 /256 variables (removed 100) and now considering 414/514 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 414 rows 156 cols
[2025-05-29 19:59:20] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 19:59:20] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 19:59:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-29 19:59:20] [INFO ] [Nat]Absence check using 11 positive and 11 generalized place invariants in 12 ms returned sat
[2025-05-29 19:59:20] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 19:59:20] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:59:20] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 312 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 397 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 704/704 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 446 transition count 605
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 347 transition count 605
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 198 place count 347 transition count 520
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 368 place count 262 transition count 520
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 378 place count 257 transition count 515
Applied a total of 378 rules in 33 ms. Remains 257 /446 variables (removed 189) and now considering 515/704 (removed 189) transitions.
// Phase 1: matrix 515 rows 257 cols
[2025-05-29 19:59:21] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:59:22] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-05-29 19:59:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:59:22] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 19:59:23] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:59:23] [INFO ] Redundant transitions in 8 ms returned []
Running 505 sub problems to find dead transitions.
[2025-05-29 19:59:23] [INFO ] Invariant cache hit.
[2025-05-29 19:59:23] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:26] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:27] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:28] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:28] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 515/772 variables, 257/286 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 90/376 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:40] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:40] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:40] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:59:40] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/772 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 772/772 variables, and 380 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 257/257 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:07] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:10] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 257/772 variables, and 35 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/257 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/505 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 257/446 places, 515/704 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61438 ms. Remains : 257/446 places, 515/704 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 p2 p0 p1), (X p2), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 101 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2025-05-29 20:00:23] [INFO ] Invariant cache hit.
[2025-05-29 20:00:23] [INFO ] State equation strengthened by 90 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/231 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/237 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/257 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 515/772 variables, 257/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 90/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/772 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 772/772 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 257/257 constraints, ReadFeed: 90/90 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/231 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/237 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/257 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 515/772 variables, 257/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 90/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/772 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 772/772 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 257/257 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 632ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 734 steps, including 120 resets, run visited all 1 properties in 3 ms. (steps per millisecond=244 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 333 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33450 reset in 222 ms.
Product exploration explored 100000 steps with 33310 reset in 222 ms.
Built C files in :
/tmp/ltsmin8144850377393351630
[2025-05-29 20:00:26] [INFO ] Computing symmetric may disable matrix : 515 transitions.
[2025-05-29 20:00:26] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:00:26] [INFO ] Computing symmetric may enable matrix : 515 transitions.
[2025-05-29 20:00:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:00:26] [INFO ] Computing Do-Not-Accords matrix : 515 transitions.
[2025-05-29 20:00:26] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:00:26] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8144850377393351630
Running compilation step : cd /tmp/ltsmin8144850377393351630;'/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 1166 ms.
Running link step : cd /tmp/ltsmin8144850377393351630;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8144850377393351630;'/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/stateBased194237742987558995.hoa' '--buchi-type=spotba'
LTSmin run took 2516 ms.
FORMULA Anderson-PT-10-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-10-LTLCardinality-05 finished in 204102 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&&F(G(p0)))))'
Support contains 2 out of 451 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 451/451 places, 727/727 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 451 transition count 627
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 351 transition count 627
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 200 place count 351 transition count 538
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 378 place count 262 transition count 538
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 389 place count 251 transition count 491
Iterating global reduction 2 with 11 rules applied. Total rules applied 400 place count 251 transition count 491
Applied a total of 400 rules in 26 ms. Remains 251 /451 variables (removed 200) and now considering 491/727 (removed 236) transitions.
// Phase 1: matrix 491 rows 251 cols
[2025-05-29 20:00:29] [INFO ] Computed 22 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:00:30] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-05-29 20:00:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:00:30] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:00:30] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:00:30] [INFO ] Redundant transitions in 6 ms returned []
Running 481 sub problems to find dead transitions.
[2025-05-29 20:00:30] [INFO ] Invariant cache hit.
[2025-05-29 20:00:30] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:34] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:34] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 1/251 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:42] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (OVERLAPS) 491/742 variables, 251/276 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 90/366 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:54] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 19 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/742 variables, and 367 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 1/251 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/742 variables, and 26 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/481 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/451 places, 491/727 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61200 ms. Remains : 251/451 places, 491/727 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 151 ms.
Stack based approach found an accepted trace after 1010 steps with 0 reset with depth 1011 and stack size 872 in 1 ms.
FORMULA Anderson-PT-10-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLCardinality-06 finished in 61417 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((F(G(p0)) U p1)))'
Support contains 5 out of 451 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 451/451 places, 727/727 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 441 transition count 681
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 441 transition count 681
Applied a total of 20 rules in 19 ms. Remains 441 /451 variables (removed 10) and now considering 681/727 (removed 46) transitions.
// Phase 1: matrix 681 rows 441 cols
[2025-05-29 20:01:31] [INFO ] Computed 22 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:31] [INFO ] Implicit Places using invariants in 368 ms returned []
[2025-05-29 20:01:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:32] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:01:33] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2025-05-29 20:01:33] [INFO ] Invariant cache hit.
[2025-05-29 20:01:33] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:40] [INFO ] Deduced a trap composed of 88 places in 220 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:43] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:44] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 51 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 4 (OVERLAPS) 1/441 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/1122 variables, and 25 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/441 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:23] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:28] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:29] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:29] [INFO ] Deduced a trap composed of 79 places in 200 ms of which 49 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/1122 variables, and 28 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/441 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 441/451 places, 681/727 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62320 ms. Remains : 441/451 places, 681/727 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Product exploration explored 100000 steps with 50000 reset in 236 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 p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 10 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLCardinality-09 finished in 62951 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 G(p0)))'
Support contains 2 out of 451 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 451/451 places, 727/727 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 451 transition count 628
Reduce places removed 99 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 100 rules applied. Total rules applied 199 place count 352 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 351 transition count 627
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 200 place count 351 transition count 538
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 378 place count 262 transition count 538
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 389 place count 251 transition count 491
Iterating global reduction 3 with 11 rules applied. Total rules applied 400 place count 251 transition count 491
Applied a total of 400 rules in 26 ms. Remains 251 /451 variables (removed 200) and now considering 491/727 (removed 236) transitions.
// Phase 1: matrix 491 rows 251 cols
[2025-05-29 20:02:34] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:02:34] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-29 20:02:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:02:34] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:02:35] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:02:35] [INFO ] Redundant transitions in 5 ms returned []
Running 481 sub problems to find dead transitions.
[2025-05-29 20:02:35] [INFO ] Invariant cache hit.
[2025-05-29 20:02:35] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:38] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:39] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 1/251 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:50] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 491/742 variables, 251/277 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 90/367 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:03] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:04] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:04] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:04] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 17 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/742 variables, and 371 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 1/251 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/742 variables, and 30 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/481 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/451 places, 491/727 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61307 ms. Remains : 251/451 places, 491/727 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 779 steps with 0 reset in 4 ms.
FORMULA Anderson-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLCardinality-10 finished in 61432 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||X(F((p0&&F(p1)))))))'
Support contains 3 out of 451 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 451/451 places, 727/727 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 440 transition count 680
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 440 transition count 680
Applied a total of 22 rules in 20 ms. Remains 440 /451 variables (removed 11) and now considering 680/727 (removed 47) transitions.
// Phase 1: matrix 680 rows 440 cols
[2025-05-29 20:03:35] [INFO ] Computed 22 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:03:36] [INFO ] Implicit Places using invariants in 349 ms returned []
[2025-05-29 20:03:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:03:36] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:03:37] [INFO ] Implicit Places using invariants and state equation in 1815 ms returned []
Implicit Place search using SMT with State Equation took 2166 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2025-05-29 20:03:37] [INFO ] Invariant cache hit.
[2025-05-29 20:03:37] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:45] [INFO ] Deduced a trap composed of 88 places in 218 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:47] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:48] [INFO ] Deduced a trap composed of 79 places in 213 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:54] [INFO ] Deduced a trap composed of 79 places in 213 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:54] [INFO ] Deduced a trap composed of 79 places in 185 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:56] [INFO ] Deduced a trap composed of 79 places in 222 ms of which 49 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 670 unsolved
SMT process timed out in 30148ms, After SMT, problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 30151ms
Starting structural reductions in LTL mode, iteration 1 : 440/451 places, 680/727 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32341 ms. Remains : 440/451 places, 680/727 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-15
Product exploration explored 100000 steps with 18 reset in 133 ms.
Stack based approach found an accepted trace after 87 steps with 0 reset with depth 88 and stack size 88 in 0 ms.
FORMULA Anderson-PT-10-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLCardinality-15 finished in 32666 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||X(p0)))))'
Found a Lengthening insensitive property : Anderson-PT-10-LTLCardinality-01
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 451 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 451/451 places, 727/727 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 451 transition count 627
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 351 transition count 627
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 200 place count 351 transition count 538
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 378 place count 262 transition count 538
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 388 place count 252 transition count 492
Iterating global reduction 2 with 10 rules applied. Total rules applied 398 place count 252 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 400 place count 251 transition count 491
Applied a total of 400 rules in 26 ms. Remains 251 /451 variables (removed 200) and now considering 491/727 (removed 236) transitions.
// Phase 1: matrix 491 rows 251 cols
[2025-05-29 20:04:08] [INFO ] Computed 22 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:08] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-05-29 20:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:09] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:04:09] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2025-05-29 20:04:09] [INFO ] Invariant cache hit.
[2025-05-29 20:04:09] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (OVERLAPS) 1/251 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:20] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:20] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:21] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:24] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:24] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:24] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 491/742 variables, 251/279 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 90/369 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/742 variables, and 369 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 1/251 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/742 variables, and 28 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/481 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LI_LTL mode, iteration 1 : 251/451 places, 491/727 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61514 ms. Remains : 251/451 places, 491/727 transitions.
Running random walk in product with property : Anderson-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 185 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44724 steps, run visited all 1 properties in 111 ms. (steps per millisecond=402 )
Probabilistic random walk after 44724 steps, saw 34801 distinct states, run finished after 111 ms. (steps per millisecond=402 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 491/491 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2025-05-29 20:05:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:05:11] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-05-29 20:05:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:05:11] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:05:12] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2025-05-29 20:05:12] [INFO ] Invariant cache hit.
[2025-05-29 20:05:12] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (OVERLAPS) 1/251 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:23] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:23] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:24] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 491/742 variables, 251/279 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 90/369 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/742 variables, and 369 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 1/251 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/742 variables, and 28 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/481 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Finished structural reductions in LTL mode , in 1 iterations and 61573 ms. Remains : 251/251 places, 491/491 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44724 steps, run visited all 1 properties in 108 ms. (steps per millisecond=414 )
Probabilistic random walk after 44724 steps, saw 34801 distinct states, run finished after 109 ms. (steps per millisecond=410 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Product exploration explored 100000 steps with 0 reset in 222 ms.
Built C files in :
/tmp/ltsmin4939637445474921431
[2025-05-29 20:06:14] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4939637445474921431
Running compilation step : cd /tmp/ltsmin4939637445474921431;'/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 740 ms.
Running link step : cd /tmp/ltsmin4939637445474921431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4939637445474921431;'/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/stateBased7123695742757417249.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 491/491 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2025-05-29 20:06:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:06:29] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-05-29 20:06:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:06:29] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:06:30] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2025-05-29 20:06:30] [INFO ] Invariant cache hit.
[2025-05-29 20:06:30] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (OVERLAPS) 1/251 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:42] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:44] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:44] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:45] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 491/742 variables, 251/279 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 90/369 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/742 variables, and 369 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 1/251 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/742 variables, and 28 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/481 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in LTL mode , in 1 iterations and 61485 ms. Remains : 251/251 places, 491/491 transitions.
Built C files in :
/tmp/ltsmin15481803133067967689
[2025-05-29 20:07:30] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15481803133067967689
Running compilation step : cd /tmp/ltsmin15481803133067967689;'/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 737 ms.
Running link step : cd /tmp/ltsmin15481803133067967689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15481803133067967689;'/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/stateBased5990830888689717549.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 20:07:45] [INFO ] Flatten gal took : 21 ms
[2025-05-29 20:07:45] [INFO ] Flatten gal took : 15 ms
[2025-05-29 20:07:45] [INFO ] Time to serialize gal into /tmp/LTL9671139388879590712.gal : 5 ms
[2025-05-29 20:07:45] [INFO ] Time to serialize properties into /tmp/LTL8533106681339614913.prop : 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/LTL9671139388879590712.gal' '-t' 'CGAL' '-hoa' '/tmp/aut198538396542062776.hoa' '-atoms' '/tmp/LTL8533106681339614913.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...316
Loading property file /tmp/LTL8533106681339614913.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut198538396542062776.hoa
Detected timeout of ITS tools.
[2025-05-29 20:08:00] [INFO ] Flatten gal took : 14 ms
[2025-05-29 20:08:00] [INFO ] Flatten gal took : 16 ms
[2025-05-29 20:08:00] [INFO ] Time to serialize gal into /tmp/LTL16085624085036816316.gal : 3 ms
[2025-05-29 20:08:00] [INFO ] Time to serialize properties into /tmp/LTL7389984642345677216.ltl : 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/LTL16085624085036816316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7389984642345677216.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 : !((X(G(("(p1_5_16==0)")||(X("(p1_5_16==0)"))))))
Formula 0 simplified : XF(!"(p1_5_16==0)" & X!"(p1_5_16==0)")
Detected timeout of ITS tools.
[2025-05-29 20:08:16] [INFO ] Flatten gal took : 14 ms
[2025-05-29 20:08:16] [INFO ] Applying decomposition
[2025-05-29 20:08:16] [INFO ] Flatten gal took : 14 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/graph6597324204242672256.txt' '-o' '/tmp/graph6597324204242672256.bin' '-w' '/tmp/graph6597324204242672256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6597324204242672256.bin' '-l' '-1' '-v' '-w' '/tmp/graph6597324204242672256.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:08:16] [INFO ] Decomposing Gal with order
[2025-05-29 20:08:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:08:16] [INFO ] Removed a total of 911 redundant transitions.
[2025-05-29 20:08:16] [INFO ] Flatten gal took : 33 ms
[2025-05-29 20:08:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 12 ms.
[2025-05-29 20:08:16] [INFO ] Time to serialize gal into /tmp/LTL9249573686925495502.gal : 8 ms
[2025-05-29 20:08:16] [INFO ] Time to serialize properties into /tmp/LTL1008688708284792134.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/LTL9249573686925495502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1008688708284792134.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...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i8.u28.p1_5_16==0)")||(X("(i8.u28.p1_5_16==0)"))))))
Formula 0 simplified : XF(!"(i8.u28.p1_5_16==0)" & X!"(i8.u28.p1_5_16==0)")
Detected timeout of ITS tools.
Treatment of property Anderson-PT-10-LTLCardinality-01 finished in 262894 ms.
[2025-05-29 20:08:31] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17122928048958011764
[2025-05-29 20:08:31] [INFO ] Computing symmetric may disable matrix : 727 transitions.
[2025-05-29 20:08:31] [INFO ] Applying decomposition
[2025-05-29 20:08:31] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:08:31] [INFO ] Computing symmetric may enable matrix : 727 transitions.
[2025-05-29 20:08:31] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:08:31] [INFO ] Flatten gal took : 19 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/graph6086592260288300061.txt' '-o' '/tmp/graph6086592260288300061.bin' '-w' '/tmp/graph6086592260288300061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6086592260288300061.bin' '-l' '-1' '-v' '-w' '/tmp/graph6086592260288300061.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:08:31] [INFO ] Decomposing Gal with order
[2025-05-29 20:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:08:31] [INFO ] Removed a total of 1213 redundant transitions.
[2025-05-29 20:08:31] [INFO ] Flatten gal took : 62 ms
[2025-05-29 20:08:31] [INFO ] Computing Do-Not-Accords matrix : 727 transitions.
[2025-05-29 20:08:31] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:08:31] [INFO ] Built C files in 251ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17122928048958011764
[2025-05-29 20:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 29 ms.
Running compilation step : cd /tmp/ltsmin17122928048958011764;'/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'
[2025-05-29 20:08:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality18264648948600111899.gal : 6 ms
[2025-05-29 20:08:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality16461173614375120405.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/LTLCardinality18264648948600111899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16461173614375120405.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...278
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i6.u36.p1_5_16==0)")||(X("(i6.u36.p1_5_16==0)"))))))
Formula 0 simplified : XF(!"(i6.u36.p1_5_16==0)" & X!"(i6.u36.p1_5_16==0)")
Compilation finished in 1821 ms.
Running link step : cd /tmp/ltsmin17122928048958011764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17122928048958011764;'/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' 'X([](((LTLAPp0==true)||X((LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.051: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.051: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.065: LTL layer: formula: X([](((LTLAPp0==true)||X((LTLAPp0==true)))))
pins2lts-mc-linux64( 6/ 8), 0.065: "X([](((LTLAPp0==true)||X((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.066: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.095: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.140: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.144: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.190: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.360: DFS-FIFO for weak LTL, using special progress label 729
pins2lts-mc-linux64( 0/ 8), 0.360: There are 730 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.360: State length is 452, there are 733 groups
pins2lts-mc-linux64( 0/ 8), 0.360: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.360: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.360: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.360: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.927: ~1 levels ~960 states ~9528 transitions
pins2lts-mc-linux64( 6/ 8), 1.639: ~1 levels ~1920 states ~19040 transitions
pins2lts-mc-linux64( 4/ 8), 1.977: ~1 levels ~3840 states ~37816 transitions
pins2lts-mc-linux64( 4/ 8), 2.572: ~1 levels ~7680 states ~75400 transitions
pins2lts-mc-linux64( 4/ 8), 4.166: ~1 levels ~15360 states ~150584 transitions
pins2lts-mc-linux64( 5/ 8), 7.885: ~1 levels ~30720 states ~296688 transitions
pins2lts-mc-linux64( 4/ 8), 11.349: ~1 levels ~61440 states ~595344 transitions
pins2lts-mc-linux64( 5/ 8), 14.437: ~1 levels ~122880 states ~1172344 transitions
pins2lts-mc-linux64( 0/ 8), 17.758: ~1 levels ~245760 states ~2346792 transitions
pins2lts-mc-linux64( 3/ 8), 23.949: ~1 levels ~491520 states ~4659096 transitions
pins2lts-mc-linux64( 7/ 8), 36.892: ~1 levels ~983040 states ~9222960 transitions
pins2lts-mc-linux64( 7/ 8), 61.982: ~1 levels ~1966080 states ~18344872 transitions
pins2lts-mc-linux64( 0/ 8), 111.795: ~1 levels ~3932160 states ~36293824 transitions
pins2lts-mc-linux64( 1/ 8), 210.616: ~1 levels ~7864320 states ~71902512 transitions
pins2lts-mc-linux64( 2/ 8), 240.216: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 240.284:
pins2lts-mc-linux64( 0/ 8), 240.284: mean standard work distribution: 0.5% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 240.284:
pins2lts-mc-linux64( 0/ 8), 240.284: Explored 8892055 states 80985966 transitions, fanout: 9.108
pins2lts-mc-linux64( 0/ 8), 240.284: Total exploration time 239.900 sec (239.850 sec minimum, 239.864 sec on average)
pins2lts-mc-linux64( 0/ 8), 240.284: States per second: 37066, Transitions per second: 337582
pins2lts-mc-linux64( 0/ 8), 240.284:
pins2lts-mc-linux64( 0/ 8), 240.284: Progress states detected: 36979463
pins2lts-mc-linux64( 0/ 8), 240.284: Redundant explorations: -75.9541
pins2lts-mc-linux64( 0/ 8), 240.284:
pins2lts-mc-linux64( 0/ 8), 240.284: Queue width: 8B, total height: 39738448, memory: 303.18MB
pins2lts-mc-linux64( 0/ 8), 240.284: Tree memory: 538.1MB, 15.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 240.284: Tree fill ratio (roots/leafs): 27.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 240.284: Stored 756 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 240.284: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 240.284: Est. total memory use: 841.3MB (~1327.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17122928048958011764;'/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' 'X([](((LTLAPp0==true)||X((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17122928048958011764;'/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' 'X([](((LTLAPp0==true)||X((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-29 20:34:14] [INFO ] Applying decomposition
[2025-05-29 20:34:14] [INFO ] Flatten gal took : 276 ms
[2025-05-29 20:34:14] [INFO ] Decomposing Gal with order
[2025-05-29 20:34:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:34:14] [INFO ] Removed a total of 756 redundant transitions.
[2025-05-29 20:34:15] [INFO ] Flatten gal took : 306 ms
[2025-05-29 20:34:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 36 ms.
[2025-05-29 20:34:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality1421766506070938591.gal : 128 ms
[2025-05-29 20:34:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality8458089761367169639.ltl : 22 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/LTLCardinality1421766506070938591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8458089761367169639.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...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(u2.p1_5_16==0)")||(X("(u2.p1_5_16==0)"))))))
Formula 0 simplified : XF(!"(u2.p1_5_16==0)" & X!"(u2.p1_5_16==0)")
Reverse transition relation is NOT exact ! Due to transitions t123, t199, t209, t211, t213, t214, t219, t220, t221, t222, t223, t224, t232, t242, t252, t26...1040

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-10"
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-10, 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-174853728800195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-10.tgz
mv Anderson-PT-10 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 ;