Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K 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.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K 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 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.1M 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-12-LTLCardinality-00
FORMULA_NAME Anderson-PT-12-LTLCardinality-01
FORMULA_NAME Anderson-PT-12-LTLCardinality-02
FORMULA_NAME Anderson-PT-12-LTLCardinality-03
FORMULA_NAME Anderson-PT-12-LTLCardinality-04
FORMULA_NAME Anderson-PT-12-LTLCardinality-05
FORMULA_NAME Anderson-PT-12-LTLCardinality-06
FORMULA_NAME Anderson-PT-12-LTLCardinality-07
FORMULA_NAME Anderson-PT-12-LTLCardinality-08
FORMULA_NAME Anderson-PT-12-LTLCardinality-09
FORMULA_NAME Anderson-PT-12-LTLCardinality-10
FORMULA_NAME Anderson-PT-12-LTLCardinality-11
FORMULA_NAME Anderson-PT-12-LTLCardinality-12
FORMULA_NAME Anderson-PT-12-LTLCardinality-13
FORMULA_NAME Anderson-PT-12-LTLCardinality-14
FORMULA_NAME Anderson-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748554164747

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 21:29:25] [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 21:29:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:29:26] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2025-05-29 21:29:26] [INFO ] Transformed 889 places.
[2025-05-29 21:29:26] [INFO ] Transformed 4152 transitions.
[2025-05-29 21:29:26] [INFO ] Found NUPN structural information;
[2025-05-29 21:29:26] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Anderson-PT-12-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 253 places :
Symmetric choice reduction at 0 with 253 rule applications. Total rules 253 place count 636 transition count 1083
Iterating global reduction 0 with 253 rules applied. Total rules applied 506 place count 636 transition count 1083
Applied a total of 506 rules in 135 ms. Remains 636 /889 variables (removed 253) and now considering 1083/4152 (removed 3069) transitions.
// Phase 1: matrix 1083 rows 636 cols
[2025-05-29 21:29:26] [INFO ] Computed 27 invariants in 66 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:29:27] [INFO ] Implicit Places using invariants in 1171 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1206 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 635/889 places, 1083/4152 transitions.
Applied a total of 0 rules in 20 ms. Remains 635 /635 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1375 ms. Remains : 635/889 places, 1083/4152 transitions.
Support contains 25 out of 635 places after structural reductions.
[2025-05-29 21:29:28] [INFO ] Flatten gal took : 114 ms
[2025-05-29 21:29:28] [INFO ] Flatten gal took : 64 ms
[2025-05-29 21:29:28] [INFO ] Input system was already deterministic with 1083 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (8 resets) in 1599 ms. (25 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
// Phase 1: matrix 1083 rows 635 cols
[2025-05-29 21:29:29] [INFO ] Computed 26 invariants in 28 ms
[2025-05-29 21:29:29] [INFO ] State equation strengthened by 132 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 596/603 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/603 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/623 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/635 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1083/1718 variables, 635/661 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1718 variables, 132/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1718 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1718 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 793 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 635/635 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 596/603 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/603 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/623 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/635 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1083/1718 variables, 635/661 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1718 variables, 132/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1718 variables, 4/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1718 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1718 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 797 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4751 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 635/635 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6004ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 177 ms.
Support contains 7 out of 635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1083/1083 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 635 transition count 940
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 492 transition count 940
Performed 127 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 127 Pre rules applied. Total rules applied 286 place count 492 transition count 813
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 540 place count 365 transition count 813
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 547 place count 358 transition count 740
Iterating global reduction 2 with 7 rules applied. Total rules applied 554 place count 358 transition count 740
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 560 place count 355 transition count 737
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 561 place count 355 transition count 736
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 354 transition count 736
Applied a total of 562 rules in 160 ms. Remains 354 /635 variables (removed 281) and now considering 736/1083 (removed 347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 354/635 places, 736/1083 transitions.
RANDOM walk for 40000 steps (8 resets) in 496 ms. (80 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
// Phase 1: matrix 736 rows 354 cols
[2025-05-29 21:29:35] [INFO ] Computed 26 invariants in 5 ms
[2025-05-29 21:29:35] [INFO ] State equation strengthened by 132 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 317/322 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/330 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 24/354 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 736/1090 variables, 354/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1090 variables, 132/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1090 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 512 constraints, problems are : Problem set: 0 solved, 3 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 354/354 constraints, ReadFeed: 132/132 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 45.0 s and query timeout 4500.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) 317/322 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:29:36] [INFO ] Deduced a trap composed of 307 places in 186 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/330 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 24/354 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:29:36] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 38 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 736/1090 variables, 354/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 132/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1090 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1090 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 517 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2394 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 354/354 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2813ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 226 ms.
Support contains 3 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 736/736 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 354 transition count 734
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 352 transition count 734
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 350 transition count 732
Applied a total of 8 rules in 30 ms. Remains 350 /354 variables (removed 4) and now considering 732/736 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 350/354 places, 732/736 transitions.
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1035140 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :1 out of 2
Probabilistic random walk after 1035140 steps, saw 802072 distinct states, run finished after 3005 ms. (steps per millisecond=344 ) properties seen :1
// Phase 1: matrix 732 rows 350 cols
[2025-05-29 21:29:41] [INFO ] Computed 26 invariants in 8 ms
[2025-05-29 21:29:41] [INFO ] State equation strengthened by 132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 314/316 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/326 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/350 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 314/316 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/326 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/350 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1082/1082 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 15 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 350/350 places, 732/732 transitions.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1053876 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 1
Probabilistic random walk after 1053876 steps, saw 816428 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
[2025-05-29 21:29:45] [INFO ] Invariant cache hit.
[2025-05-29 21:29:45] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 314/316 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/326 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/350 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 314/316 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/326 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/350 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1082/1082 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 827ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 17 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 350/350 places, 732/732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 13 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2025-05-29 21:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:29:47] [INFO ] Implicit Places using invariants in 430 ms returned []
[2025-05-29 21:29:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:29:47] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:29:49] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2349 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:29:49] [INFO ] Redundant transitions in 39 ms returned []
Running 720 sub problems to find dead transitions.
[2025-05-29 21:29:49] [INFO ] Invariant cache hit.
[2025-05-29 21:29:49] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:29:54] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:29:56] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:29:58] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:30:01] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:30:03] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:30:04] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 5 (OVERLAPS) 732/1082 variables, 350/382 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1082 variables, 132/514 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 514 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:30:25] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:30:26] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1082 variables, and 34 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60488ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62903 ms. Remains : 350/350 places, 732/732 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 350 transition count 588
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 206 transition count 588
Applied a total of 288 rules in 16 ms. Remains 206 /350 variables (removed 144) and now considering 588/732 (removed 144) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 588 rows 206 cols
[2025-05-29 21:30:49] [INFO ] Computed 26 invariants in 5 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 21:30:49] [INFO ] After 90ms 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 21:30:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 36 ms returned sat
[2025-05-29 21:30:50] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 20 ms returned sat
[2025-05-29 21:30:50] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 21:30:50] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 21:30:50] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 575 ms.
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' '!(((F(p0)&&F((X(p2)||p1))) U G(!p0)))'
Support contains 4 out of 635 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 635/635 places, 1083/1083 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 635 transition count 940
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 492 transition count 940
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 129 Pre rules applied. Total rules applied 286 place count 492 transition count 811
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 544 place count 363 transition count 811
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 552 place count 355 transition count 737
Iterating global reduction 2 with 8 rules applied. Total rules applied 560 place count 355 transition count 737
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 564 place count 353 transition count 735
Applied a total of 564 rules in 83 ms. Remains 353 /635 variables (removed 282) and now considering 735/1083 (removed 348) transitions.
// Phase 1: matrix 735 rows 353 cols
[2025-05-29 21:30:50] [INFO ] Computed 26 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:30:51] [INFO ] Implicit Places using invariants in 749 ms returned []
[2025-05-29 21:30:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:30:51] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:30:53] [INFO ] Implicit Places using invariants and state equation in 1773 ms returned []
Implicit Place search using SMT with State Equation took 2524 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:30:53] [INFO ] Redundant transitions in 7 ms returned []
Running 723 sub problems to find dead transitions.
[2025-05-29 21:30:53] [INFO ] Invariant cache hit.
[2025-05-29 21:30:53] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:30:58] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:00] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:02] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:03] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:03] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:04] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:04] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:04] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:04] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:05] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:05] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:31:05] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 4 (OVERLAPS) 735/1088 variables, 353/391 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 132/523 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 523 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 353/353 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1088 variables, and 38 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/353 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/723 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Starting structural reductions in SI_LTL mode, iteration 1 : 353/635 places, 735/1083 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63002 ms. Remains : 353/635 places, 735/1083 transitions.
Stuttering acceptance computed with spot in 179 ms :[p0, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-03
Product exploration explored 100000 steps with 1 reset in 327 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA Anderson-PT-12-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLCardinality-03 finished in 63590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X((X(p2)&&F(p3))))))'
Support contains 6 out of 635 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 1083/1083 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 626 transition count 986
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 626 transition count 986
Applied a total of 18 rules in 61 ms. Remains 626 /635 variables (removed 9) and now considering 986/1083 (removed 97) transitions.
// Phase 1: matrix 986 rows 626 cols
[2025-05-29 21:31:54] [INFO ] Computed 26 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:31:54] [INFO ] Implicit Places using invariants in 703 ms returned []
[2025-05-29 21:31:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:31:55] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:31:58] [INFO ] Implicit Places using invariants and state equation in 3720 ms returned []
Implicit Place search using SMT with State Equation took 4425 ms to find 0 implicit places.
Running 974 sub problems to find dead transitions.
[2025-05-29 21:31:58] [INFO ] Invariant cache hit.
[2025-05-29 21:31:58] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 974 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:32:13] [INFO ] Deduced a trap composed of 106 places in 327 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:32:20] [INFO ] Deduced a trap composed of 60 places in 303 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:32:21] [INFO ] Deduced a trap composed of 95 places in 286 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:32:23] [INFO ] Deduced a trap composed of 95 places in 359 ms of which 104 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 974 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1612 variables, and 29 constraints, problems are : Problem set: 0 solved, 974 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 974/974 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 974 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 974 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/1612 variables, and 29 constraints, problems are : Problem set: 0 solved, 974 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/974 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 0 solved, 974 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Starting structural reductions in LTL mode, iteration 1 : 626/635 places, 986/1083 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64844 ms. Remains : 626/635 places, 986/1083 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p1) (NOT p3) (NOT p2)), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-09
Product exploration explored 100000 steps with 19 reset in 186 ms.
Stack based approach found an accepted trace after 93 steps with 0 reset with depth 94 and stack size 94 in 0 ms.
FORMULA Anderson-PT-12-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLCardinality-09 finished in 65432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
Support contains 4 out of 635 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 1083/1083 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 625 transition count 1007
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 625 transition count 1007
Applied a total of 20 rules in 33 ms. Remains 625 /635 variables (removed 10) and now considering 1007/1083 (removed 76) transitions.
// Phase 1: matrix 1007 rows 625 cols
[2025-05-29 21:32:59] [INFO ] Computed 26 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:33:00] [INFO ] Implicit Places using invariants in 698 ms returned []
[2025-05-29 21:33:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:33:00] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:33:05] [INFO ] Implicit Places using invariants and state equation in 5403 ms returned []
Implicit Place search using SMT with State Equation took 6104 ms to find 0 implicit places.
Running 995 sub problems to find dead transitions.
[2025-05-29 21:33:05] [INFO ] Invariant cache hit.
[2025-05-29 21:33:05] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:22] [INFO ] Deduced a trap composed of 71 places in 312 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:23] [INFO ] Deduced a trap composed of 71 places in 339 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:24] [INFO ] Deduced a trap composed of 71 places in 352 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:24] [INFO ] Deduced a trap composed of 71 places in 322 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:25] [INFO ] Deduced a trap composed of 71 places in 331 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:28] [INFO ] Deduced a trap composed of 71 places in 304 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:30] [INFO ] Deduced a trap composed of 71 places in 341 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:32] [INFO ] Deduced a trap composed of 60 places in 335 ms of which 60 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1632 variables, and 34 constraints, problems are : Problem set: 0 solved, 995 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/625 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 995/995 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 995 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/1632 variables, and 34 constraints, problems are : Problem set: 0 solved, 995 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/625 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/995 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60349ms problems are : Problem set: 0 solved, 995 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Starting structural reductions in LTL mode, iteration 1 : 625/635 places, 1007/1083 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66495 ms. Remains : 625/635 places, 1007/1083 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-10
Product exploration explored 100000 steps with 25043 reset in 270 ms.
Product exploration explored 100000 steps with 25017 reset in 268 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 (NOT p0) p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 25700 steps (6 resets) in 120 ms. (212 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 625/625 places, 1007/1007 transitions.
Applied a total of 0 rules in 17 ms. Remains 625 /625 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2025-05-29 21:34:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:34:07] [INFO ] Implicit Places using invariants in 626 ms returned []
[2025-05-29 21:34:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:34:08] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:34:13] [INFO ] Implicit Places using invariants and state equation in 5472 ms returned []
Implicit Place search using SMT with State Equation took 6143 ms to find 0 implicit places.
Running 995 sub problems to find dead transitions.
[2025-05-29 21:34:13] [INFO ] Invariant cache hit.
[2025-05-29 21:34:13] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:34:30] [INFO ] Deduced a trap composed of 71 places in 314 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:34:30] [INFO ] Deduced a trap composed of 71 places in 339 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:34:31] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:34:31] [INFO ] Deduced a trap composed of 71 places in 316 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:34:32] [INFO ] Deduced a trap composed of 71 places in 316 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:34:35] [INFO ] Deduced a trap composed of 71 places in 301 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:34:37] [INFO ] Deduced a trap composed of 71 places in 315 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:34:39] [INFO ] Deduced a trap composed of 60 places in 328 ms of which 61 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1632 variables, and 34 constraints, problems are : Problem set: 0 solved, 995 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/625 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 995/995 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 995 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/1632 variables, and 34 constraints, problems are : Problem set: 0 solved, 995 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/625 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/995 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 995 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Finished structural reductions in LTL mode , in 1 iterations and 66509 ms. Remains : 625/625 places, 1007/1007 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 (NOT p0) p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 23550 steps (4 resets) in 144 ms. (162 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25068 reset in 248 ms.
Product exploration explored 100000 steps with 24993 reset in 258 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 625/625 places, 1007/1007 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 625 transition count 1007
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 132 Pre rules applied. Total rules applied 140 place count 625 transition count 1007
Deduced a syphon composed of 272 places in 0 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 272 place count 625 transition count 1007
Deduced a syphon composed of 272 places in 1 ms
Applied a total of 272 rules in 58 ms. Remains 625 /625 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:35:15] [INFO ] Redundant transitions in 8 ms returned []
Running 995 sub problems to find dead transitions.
// Phase 1: matrix 1007 rows 625 cols
[2025-05-29 21:35:15] [INFO ] Computed 26 invariants in 6 ms
[2025-05-29 21:35:15] [INFO ] State equation strengthened by 252 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:26] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:26] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:26] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:26] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:26] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:27] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:27] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:27] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:28] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:28] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:28] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:28] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:29] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:31] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:31] [INFO ] Deduced a trap composed of 51 places in 308 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:32] [INFO ] Deduced a trap composed of 50 places in 283 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:35:32] [INFO ] Deduced a trap composed of 47 places in 314 ms of which 43 ms to minimize.
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 17/43 constraints. Problems are: Problem set: 272 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1632 variables, and 43 constraints, problems are : Problem set: 272 solved, 723 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/625 constraints, ReadFeed: 0/252 constraints, PredecessorRefiner: 995/995 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 272 solved, 723 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 17/17 constraints. Problems are: Problem set: 272 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/17 constraints. Problems are: Problem set: 272 solved, 723 unsolved
At refinement iteration 2 (OVERLAPS) 272/625 variables, 14/31 constraints. Problems are: Problem set: 272 solved, 723 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/625 variables, 12/43 constraints. Problems are: Problem set: 272 solved, 723 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:02] [INFO ] Deduced a trap composed of 48 places in 313 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:03] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:05] [INFO ] Deduced a trap composed of 47 places in 339 ms of which 40 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/625 variables, 3/46 constraints. Problems are: Problem set: 272 solved, 723 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:13] [INFO ] Deduced a trap composed of 47 places in 307 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:13] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:14] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:14] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:14] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:15] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:15] [INFO ] Deduced a trap composed of 48 places in 298 ms of which 41 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/1632 variables, and 53 constraints, problems are : Problem set: 272 solved, 723 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/625 constraints, ReadFeed: 0/252 constraints, PredecessorRefiner: 0/995 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60480ms problems are : Problem set: 272 solved, 723 unsolved
Search for dead transitions found 272 dead transitions in 60482ms
Found 272 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 272 transitions
Dead transitions reduction (with SMT) removed 272 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 625/625 places, 735/1007 transitions.
Graph (complete) has 1958 edges and 625 vertex of which 353 are kept as prefixes of interest. Removing 272 places using SCC suffix rule.3 ms
Discarding 272 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 353 /625 variables (removed 272) and now considering 735/735 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 353/625 places, 735/1007 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60580 ms. Remains : 353/625 places, 735/1007 transitions.
Built C files in :
/tmp/ltsmin12069362452868897569
[2025-05-29 21:36:15] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12069362452868897569
Running compilation step : cd /tmp/ltsmin12069362452868897569;'/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 2128 ms.
Running link step : cd /tmp/ltsmin12069362452868897569;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12069362452868897569;'/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/stateBased5985841179366180025.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 625/625 places, 1007/1007 transitions.
Applied a total of 0 rules in 16 ms. Remains 625 /625 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
// Phase 1: matrix 1007 rows 625 cols
[2025-05-29 21:36:31] [INFO ] Computed 26 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:36:31] [INFO ] Implicit Places using invariants in 738 ms returned []
[2025-05-29 21:36:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:36:32] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:36:37] [INFO ] Implicit Places using invariants and state equation in 5370 ms returned []
Implicit Place search using SMT with State Equation took 6113 ms to find 0 implicit places.
Running 995 sub problems to find dead transitions.
[2025-05-29 21:36:37] [INFO ] Invariant cache hit.
[2025-05-29 21:36:37] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:54] [INFO ] Deduced a trap composed of 71 places in 330 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:54] [INFO ] Deduced a trap composed of 71 places in 326 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:55] [INFO ] Deduced a trap composed of 71 places in 346 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:55] [INFO ] Deduced a trap composed of 71 places in 330 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:56] [INFO ] Deduced a trap composed of 71 places in 330 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:36:59] [INFO ] Deduced a trap composed of 71 places in 310 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:37:01] [INFO ] Deduced a trap composed of 71 places in 353 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:37:03] [INFO ] Deduced a trap composed of 60 places in 324 ms of which 62 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1632 variables, and 34 constraints, problems are : Problem set: 0 solved, 995 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/625 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 995/995 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 995 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/1632 variables, and 34 constraints, problems are : Problem set: 0 solved, 995 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/625 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/995 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60322ms problems are : Problem set: 0 solved, 995 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Finished structural reductions in LTL mode , in 1 iterations and 66462 ms. Remains : 625/625 places, 1007/1007 transitions.
Built C files in :
/tmp/ltsmin16932879680837890051
[2025-05-29 21:37:37] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16932879680837890051
Running compilation step : cd /tmp/ltsmin16932879680837890051;'/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 1657 ms.
Running link step : cd /tmp/ltsmin16932879680837890051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16932879680837890051;'/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/stateBased1168598810245123088.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:37:52] [INFO ] Flatten gal took : 55 ms
[2025-05-29 21:37:52] [INFO ] Flatten gal took : 40 ms
[2025-05-29 21:37:52] [INFO ] Time to serialize gal into /tmp/LTL5033906952353317004.gal : 8 ms
[2025-05-29 21:37:52] [INFO ] Time to serialize properties into /tmp/LTL2104703959916724135.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5033906952353317004.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3347346008259473814.hoa' '-atoms' '/tmp/LTL2104703959916724135.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/LTL2104703959916724135.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3347346008259473814.hoa
Detected timeout of ITS tools.
[2025-05-29 21:38:08] [INFO ] Flatten gal took : 36 ms
[2025-05-29 21:38:08] [INFO ] Flatten gal took : 36 ms
[2025-05-29 21:38:08] [INFO ] Time to serialize gal into /tmp/LTL11139812148759645828.gal : 7 ms
[2025-05-29 21:38:08] [INFO ] Time to serialize properties into /tmp/LTL5429853668115968008.ltl : 6 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/LTL11139812148759645828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5429853668115968008.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 : !((G((X(X("((cs_3_9==0)||(cs_0_9==1))")))||("((cs_1_8!=0)&&(ncs_11_9!=1))"))))
Formula 0 simplified : F(!"((cs_1_8!=0)&&(ncs_11_9!=1))" & XX!"((cs_3_9==0)||(cs_0_9==1))")
Detected timeout of ITS tools.
[2025-05-29 21:38:23] [INFO ] Flatten gal took : 39 ms
[2025-05-29 21:38:23] [INFO ] Applying decomposition
[2025-05-29 21:38:23] [INFO ] Flatten gal took : 52 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/graph16971427182832535765.txt' '-o' '/tmp/graph16971427182832535765.bin' '-w' '/tmp/graph16971427182832535765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16971427182832535765.bin' '-l' '-1' '-v' '-w' '/tmp/graph16971427182832535765.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:38:23] [INFO ] Decomposing Gal with order
[2025-05-29 21:38:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:38:23] [INFO ] Removed a total of 1692 redundant transitions.
[2025-05-29 21:38:24] [INFO ] Flatten gal took : 625 ms
[2025-05-29 21:38:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 28 ms.
[2025-05-29 21:38:24] [INFO ] Time to serialize gal into /tmp/LTL15877151040581646930.gal : 31 ms
[2025-05-29 21:38:24] [INFO ] Time to serialize properties into /tmp/LTL13374567080103122110.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/LTL15877151040581646930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13374567080103122110.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 : !((G((X(X("((i3.u118.cs_3_9==0)||(i11.i0.u191.cs_0_9==1))")))||("((i10.i1.u98.cs_1_8!=0)&&(i0.i2.u184.ncs_11_9!=1))"))))
Formula 0 simplified : F(!"((i10.i1.u98.cs_1_8!=0)&&(i0.i2.u184.ncs_11_9!=1))" & XX!"((i3.u118.cs_3_9==0)||(i11.i0.u191.cs_0_9==1))")
Detected timeout of ITS tools.
Treatment of property Anderson-PT-12-LTLCardinality-10 finished in 339989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 635 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 1083/1083 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 624 transition count 984
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 624 transition count 984
Applied a total of 22 rules in 22 ms. Remains 624 /635 variables (removed 11) and now considering 984/1083 (removed 99) transitions.
// Phase 1: matrix 984 rows 624 cols
[2025-05-29 21:38:39] [INFO ] Computed 26 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:38:40] [INFO ] Implicit Places using invariants in 966 ms returned []
[2025-05-29 21:38:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:38:41] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:38:45] [INFO ] Implicit Places using invariants and state equation in 4543 ms returned []
Implicit Place search using SMT with State Equation took 5519 ms to find 0 implicit places.
Running 972 sub problems to find dead transitions.
[2025-05-29 21:38:45] [INFO ] Invariant cache hit.
[2025-05-29 21:38:45] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 972 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:39:00] [INFO ] Deduced a trap composed of 106 places in 323 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:39:05] [INFO ] Deduced a trap composed of 60 places in 342 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:39:06] [INFO ] Deduced a trap composed of 95 places in 348 ms of which 80 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 972 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1608 variables, and 28 constraints, problems are : Problem set: 0 solved, 972 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/624 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 972/972 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 972 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 972 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1608 variables, and 28 constraints, problems are : Problem set: 0 solved, 972 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/624 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/972 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60296ms problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Starting structural reductions in LTL mode, iteration 1 : 624/635 places, 984/1083 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65841 ms. Remains : 624/635 places, 984/1083 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLCardinality-11 finished in 65966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&G(F(p1)))) U G(p2)))'
Support contains 6 out of 635 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 1083/1083 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 626 transition count 986
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 626 transition count 986
Applied a total of 18 rules in 23 ms. Remains 626 /635 variables (removed 9) and now considering 986/1083 (removed 97) transitions.
// Phase 1: matrix 986 rows 626 cols
[2025-05-29 21:39:45] [INFO ] Computed 26 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:39:46] [INFO ] Implicit Places using invariants in 875 ms returned []
[2025-05-29 21:39:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:39:46] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:39:50] [INFO ] Implicit Places using invariants and state equation in 3963 ms returned []
Implicit Place search using SMT with State Equation took 4858 ms to find 0 implicit places.
Running 974 sub problems to find dead transitions.
[2025-05-29 21:39:50] [INFO ] Invariant cache hit.
[2025-05-29 21:39:50] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 974 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:40:04] [INFO ] Deduced a trap composed of 106 places in 330 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:40:11] [INFO ] Deduced a trap composed of 60 places in 304 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:40:12] [INFO ] Deduced a trap composed of 95 places in 327 ms of which 78 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 974 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1612 variables, and 28 constraints, problems are : Problem set: 0 solved, 974 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 974/974 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 974 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 974 unsolved
SMT process timed out in 60293ms, After SMT, problems are : Problem set: 0 solved, 974 unsolved
Search for dead transitions found 0 dead transitions in 60295ms
Starting structural reductions in LTL mode, iteration 1 : 626/635 places, 986/1083 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65179 ms. Remains : 626/635 places, 986/1083 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p1), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-12
Product exploration explored 100000 steps with 24955 reset in 275 ms.
Product exploration explored 100000 steps with 24929 reset in 283 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 p0 p1), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 115 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (AND p2 (NOT p0)), true, (NOT p1), (NOT p1), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (8 resets) in 273 ms. (145 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 275 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
[2025-05-29 21:40:52] [INFO ] Invariant cache hit.
[2025-05-29 21:40:52] [INFO ] State equation strengthened by 132 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 589/595 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/614 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 986/1612 variables, 626/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1612 variables, 132/784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1612 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1612 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 784 constraints, problems are : Problem set: 0 solved, 4 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 626/626 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 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, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 589/595 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/614 variables, 8/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/626 variables, 12/26 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 986/1612 variables, 626/652 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1612 variables, 132/784 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1612 variables, 3/787 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 0/787 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1612 variables, 0/787 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 787 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1922 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 626/626 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2702ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 986/986 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 626 transition count 843
Reduce places removed 143 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 144 rules applied. Total rules applied 287 place count 483 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 288 place count 482 transition count 842
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 288 place count 482 transition count 713
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 546 place count 353 transition count 713
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 547 place count 352 transition count 712
Iterating global reduction 3 with 1 rules applied. Total rules applied 548 place count 352 transition count 712
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 3 with 2 rules applied. Total rules applied 550 place count 351 transition count 711
Applied a total of 550 rules in 38 ms. Remains 351 /626 variables (removed 275) and now considering 711/986 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 351/626 places, 711/986 transitions.
RANDOM walk for 40000 steps (8 resets) in 198 ms. (201 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
// Phase 1: matrix 711 rows 351 cols
[2025-05-29 21:40:55] [INFO ] Computed 26 invariants in 5 ms
[2025-05-29 21:40:55] [INFO ] State equation strengthened by 132 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 315/319 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/327 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/351 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 711/1062 variables, 351/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1062 variables, 132/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1062 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1062 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1062/1062 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 351/351 constraints, ReadFeed: 132/132 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 315/319 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/327 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/351 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 711/1062 variables, 351/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1062 variables, 132/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1062 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1062 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1062 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1062/1062 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 351/351 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 751ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 711/711 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 351/351 places, 711/711 transitions.
RANDOM walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 252798 steps, run visited all 1 properties in 736 ms. (steps per millisecond=343 )
Probabilistic random walk after 252798 steps, saw 199348 distinct states, run finished after 742 ms. (steps per millisecond=340 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2)))
Knowledge based reduction with 21 factoid took 220 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLCardinality-12 finished in 71524 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(p1))&&p0)))'
Support contains 4 out of 635 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 1083/1083 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 627 transition count 1031
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 627 transition count 1031
Applied a total of 16 rules in 22 ms. Remains 627 /635 variables (removed 8) and now considering 1031/1083 (removed 52) transitions.
// Phase 1: matrix 1031 rows 627 cols
[2025-05-29 21:40:57] [INFO ] Computed 26 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:40:57] [INFO ] Implicit Places using invariants in 815 ms returned []
[2025-05-29 21:40:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:40:58] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:41:02] [INFO ] Implicit Places using invariants and state equation in 4663 ms returned []
Implicit Place search using SMT with State Equation took 5510 ms to find 0 implicit places.
Running 1019 sub problems to find dead transitions.
[2025-05-29 21:41:02] [INFO ] Invariant cache hit.
[2025-05-29 21:41:02] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1019 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1019 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:14] [INFO ] Deduced a trap composed of 71 places in 336 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:18] [INFO ] Deduced a trap composed of 71 places in 315 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:19] [INFO ] Deduced a trap composed of 71 places in 338 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:26] [INFO ] Deduced a trap composed of 60 places in 314 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:28] [INFO ] Deduced a trap composed of 71 places in 337 ms of which 62 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1019 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:32] [INFO ] Deduced a trap composed of 84 places in 316 ms of which 77 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1658 variables, and 32 constraints, problems are : Problem set: 0 solved, 1019 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/627 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1019/1019 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1019 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1019 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1019 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 1019 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:37] [INFO ] Deduced a trap composed of 71 places in 317 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:42] [INFO ] Deduced a trap composed of 71 places in 303 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:43] [INFO ] Deduced a trap composed of 71 places in 317 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:44] [INFO ] Deduced a trap composed of 71 places in 311 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:44] [INFO ] Deduced a trap composed of 71 places in 331 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:44] [INFO ] Deduced a trap composed of 72 places in 333 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:45] [INFO ] Deduced a trap composed of 71 places in 324 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:52] [INFO ] Deduced a trap composed of 84 places in 340 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:59] [INFO ] Deduced a trap composed of 97 places in 338 ms of which 68 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1019 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1658 variables, and 41 constraints, problems are : Problem set: 0 solved, 1019 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/627 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/1019 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 1019 unsolved
Search for dead transitions found 0 dead transitions in 60449ms
Starting structural reductions in LTL mode, iteration 1 : 627/635 places, 1031/1083 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65986 ms. Remains : 627/635 places, 1031/1083 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLCardinality-13 finished in 66152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
[2025-05-29 21:42:03] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3223591133109429934
[2025-05-29 21:42:03] [INFO ] Computing symmetric may disable matrix : 1083 transitions.
[2025-05-29 21:42:03] [INFO ] Applying decomposition
[2025-05-29 21:42:03] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:42:03] [INFO ] Computing symmetric may enable matrix : 1083 transitions.
[2025-05-29 21:42:03] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:42:03] [INFO ] Flatten gal took : 29 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/graph15111333761630111623.txt' '-o' '/tmp/graph15111333761630111623.bin' '-w' '/tmp/graph15111333761630111623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15111333761630111623.bin' '-l' '-1' '-v' '-w' '/tmp/graph15111333761630111623.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:42:03] [INFO ] Decomposing Gal with order
[2025-05-29 21:42:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:42:03] [INFO ] Removed a total of 1913 redundant transitions.
[2025-05-29 21:42:03] [INFO ] Flatten gal took : 60 ms
[2025-05-29 21:42:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 21 ms.
[2025-05-29 21:42:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality11153636465171715375.gal : 15 ms
[2025-05-29 21:42:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality12221587413583666001.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/LTLCardinality11153636465171715375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12221587413583666001.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
[2025-05-29 21:42:03] [INFO ] Computing Do-Not-Accords matrix : 1083 transitions.
[2025-05-29 21:42:03] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:42:03] [INFO ] Built C files in 383ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3223591133109429934
Running compilation step : cd /tmp/ltsmin3223591133109429934;'/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'
Checking formula 0 : !((G(("((i4.i0.u246.cs_1_8!=0)&&(i9.u83.ncs_11_9!=1))")||(X(X("((i10.i1.u256.cs_3_9==0)||(i10.i1.u243.cs_0_9==1))"))))))
Formula 0 simplified : F(!"((i4.i0.u246.cs_1_8!=0)&&(i9.u83.ncs_11_9!=1))" & XX!"((i10.i1.u256.cs_3_9==0)||(i10.i1.u243.cs_0_9==1))")
Compilation finished in 3395 ms.
Running link step : cd /tmp/ltsmin3223591133109429934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin3223591133109429934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.121: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.121: LTL layer: formula: [](((LTLAPp0==true)||X(X((LTLAPp1==true)))))
pins2lts-mc-linux64( 7/ 8), 0.121: "[](((LTLAPp0==true)||X(X((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.122: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.127: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.132: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.133: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.159: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.162: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.176: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.371: DFS-FIFO for weak LTL, using special progress label 1086
pins2lts-mc-linux64( 0/ 8), 0.371: There are 1087 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.371: State length is 636, there are 1094 groups
pins2lts-mc-linux64( 0/ 8), 0.371: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.371: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.371: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.371: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.465: ~1 levels ~960 states ~11464 transitions
pins2lts-mc-linux64( 5/ 8), 0.567: ~1 levels ~1920 states ~22912 transitions
pins2lts-mc-linux64( 5/ 8), 0.836: ~1 levels ~3840 states ~45736 transitions
pins2lts-mc-linux64( 5/ 8), 1.242: ~1 levels ~7680 states ~91152 transitions
pins2lts-mc-linux64( 5/ 8), 1.962: ~1 levels ~15360 states ~182024 transitions
pins2lts-mc-linux64( 7/ 8), 3.003: ~1 levels ~30720 states ~362120 transitions
pins2lts-mc-linux64( 7/ 8), 4.997: ~1 levels ~61440 states ~722136 transitions
pins2lts-mc-linux64( 2/ 8), 8.162: ~1 levels ~122880 states ~1438568 transitions
pins2lts-mc-linux64( 2/ 8), 14.501: ~1 levels ~245760 states ~2853024 transitions
pins2lts-mc-linux64( 7/ 8), 26.734: ~1 levels ~491520 states ~5723680 transitions
pins2lts-mc-linux64( 2/ 8), 51.605: ~1 levels ~983040 states ~11344392 transitions
pins2lts-mc-linux64( 2/ 8), 101.082: ~1 levels ~1966080 states ~22656400 transitions
pins2lts-mc-linux64( 0/ 8), 200.324: ~1 levels ~3932160 states ~45178336 transitions
pins2lts-mc-linux64( 0/ 8), 395.726: ~1 levels ~7864320 states ~89951288 transitions
pins2lts-mc-linux64( 2/ 8), 786.461: ~1 levels ~15728640 states ~177420024 transitions
pins2lts-mc-linux64( 1/ 8), 1100.399: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1100.470:
pins2lts-mc-linux64( 0/ 8), 1100.470: mean standard work distribution: 0.6% (states) 0.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1100.470:
pins2lts-mc-linux64( 0/ 8), 1100.470: Explored 21641295 states 245944941 transitions, fanout: 11.365
pins2lts-mc-linux64( 0/ 8), 1100.470: Total exploration time 1100.100 sec (1100.010 sec minimum, 1100.049 sec on average)
pins2lts-mc-linux64( 0/ 8), 1100.470: States per second: 19672, Transitions per second: 223566
pins2lts-mc-linux64( 0/ 8), 1100.470:
pins2lts-mc-linux64( 0/ 8), 1100.470: Progress states detected: 134217243
pins2lts-mc-linux64( 0/ 8), 1100.470: Redundant explorations: -83.8759
pins2lts-mc-linux64( 0/ 8), 1100.470:
pins2lts-mc-linux64( 0/ 8), 1100.470: Queue width: 8B, total height: 165264769, memory: 1260.87MB
pins2lts-mc-linux64( 0/ 8), 1100.471: Tree memory: 1221.0MB, 9.5 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1100.471: Tree fill ratio (roots/leafs): 99.0%/76.0%
pins2lts-mc-linux64( 0/ 8), 1100.471: Stored 1226 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1100.471: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1100.471: Est. total memory use: 2481.9MB (~2284.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3223591133109429934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3223591133109429934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(X((LTLAPp1==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 22:06:16] [INFO ] Applying decomposition
[2025-05-29 22:06:16] [INFO ] Flatten gal took : 61 ms
[2025-05-29 22:06:16] [INFO ] Decomposing Gal with order
[2025-05-29 22:06:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:06:16] [INFO ] Removed a total of 1171 redundant transitions.
[2025-05-29 22:06:16] [INFO ] Flatten gal took : 98 ms
[2025-05-29 22:06:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 20 ms.
[2025-05-29 22:06:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality4708958856442889585.gal : 23 ms
[2025-05-29 22:06:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality17080721403001251127.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/LTLCardinality4708958856442889585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17080721403001251127.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("((u10.cs_1_8!=0)&&(u8.ncs_11_9!=1))")||(X(X("((u12.cs_3_9==0)||(u9.cs_0_9==1))"))))))
Formula 0 simplified : F(!"((u10.cs_1_8!=0)&&(u8.ncs_11_9!=1))" & XX!"((u12.cs_3_9==0)||(u9.cs_0_9==1))")

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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