Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422000059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is HirschbergSinclair-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422000059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 10K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 157K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748774226409

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 10:37:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 10:37:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:37:08] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2025-06-01 10:37:08] [INFO ] Transformed 124 places.
[2025-06-01 10:37:08] [INFO ] Transformed 111 transitions.
[2025-06-01 10:37:08] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 119 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 119 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 118 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 118 transition count 109
Applied a total of 8 rules in 38 ms. Remains 118 /124 variables (removed 6) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 118 cols
[2025-06-01 10:37:08] [INFO ] Computed 9 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:37:08] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-06-01 10:37:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:37:08] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2025-06-01 10:37:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 2/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 4/118 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 109/227 variables, 118/127 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 127 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4908 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 2/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 4/118 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 109/227 variables, 118/127 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 104/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/227 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 231 constraints, problems are : Problem set: 0 solved, 104 unsolved in 29555 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34522ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 34533ms
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 109/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35079 ms. Remains : 118/124 places, 109/111 transitions.
Support contains 48 out of 118 places after structural reductions.
[2025-06-01 10:37:43] [INFO ] Flatten gal took : 29 ms
[2025-06-01 10:37:43] [INFO ] Flatten gal took : 14 ms
[2025-06-01 10:37:43] [INFO ] Input system was already deterministic with 109 transitions.
RANDOM walk for 40000 steps (360 resets) in 1637 ms. (24 steps per ms) remains 9/30 properties
BEST_FIRST walk for 40003 steps (112 resets) in 477 ms. (83 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (104 resets) in 248 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (108 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (104 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (103 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (102 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (104 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (104 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (109 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
[2025-06-01 10:37:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/14 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 96/110 variables, 8/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 219/227 variables, and 119 constraints, problems are : Problem set: 9 solved, 0 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/118 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 118 stabilizing places and 109 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 109
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 109/109 transitions.
Graph (complete) has 221 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 113 transition count 59
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 67 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 66 transition count 58
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 62 transition count 54
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 62 transition count 54
Applied a total of 103 rules in 19 ms. Remains 62 /118 variables (removed 56) and now considering 54/109 (removed 55) transitions.
// Phase 1: matrix 54 rows 62 cols
[2025-06-01 10:37:45] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:37:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-01 10:37:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:37:45] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 10:37:45] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:37:45] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-01 10:37:45] [INFO ] Invariant cache hit.
[2025-06-01 10:37:45] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/116 variables, and 71 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1795 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/62 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 47/118 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/116 variables, and 118 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1704 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/62 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3506ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3507ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/118 places, 54/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3690 ms. Remains : 62/118 places, 54/109 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-01
Product exploration explored 100000 steps with 1693 reset in 201 ms.
Product exploration explored 100000 steps with 1694 reset in 147 ms.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-01 finished in 4360 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(p0) U p1) U X(X(G(p2))))))'
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 109/109 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 113 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 113 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 109 transition count 101
Applied a total of 17 rules in 17 ms. Remains 109 /118 variables (removed 9) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2025-06-01 10:37:49] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:37:49] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-01 10:37:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:37:49] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2025-06-01 10:37:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3663 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 25556 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29241ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 29242ms
Starting structural reductions in LTL mode, iteration 1 : 109/118 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29489 ms. Remains : 109/118 places, 101/109 transitions.
Stuttering acceptance computed with spot in 372 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-02
Product exploration explored 100000 steps with 3907 reset in 188 ms.
Product exploration explored 100000 steps with 3894 reset in 205 ms.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 915 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (360 resets) in 210 ms. (189 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (104 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (104 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
[2025-06-01 10:38:21] [INFO ] Invariant cache hit.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 88/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/204 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/210 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 106 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 88/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/204 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/210 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 119 constraints, problems are : Problem set: 0 solved, 2 unsolved in 192 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 301ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 101/101 transitions.
Graph (complete) has 207 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 104 transition count 61
Reduce places removed 35 places and 0 transitions.
Graph (complete) has 123 edges and 69 vertex of which 62 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 62 transition count 58
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 90 place count 59 transition count 51
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 59 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 56 transition count 48
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 52 transition count 44
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 5 rules applied. Total rules applied 105 place count 50 transition count 41
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 108 place count 47 transition count 41
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 108 place count 47 transition count 32
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 126 place count 38 transition count 32
Applied a total of 126 rules in 19 ms. Remains 38 /109 variables (removed 71) and now considering 32/101 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 38/109 places, 32/101 transitions.
RANDOM walk for 40000 steps (1212 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (549 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (520 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 83 steps, run visited all 2 properties in 8 ms. (steps per millisecond=10 )
Probabilistic random walk after 83 steps, saw 60 distinct states, run finished after 11 ms. (steps per millisecond=7 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p0))), (F p0), (F (NOT (AND p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 8 factoid took 1630 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 347 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-06-01 10:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:38:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-01 10:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:38:24] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2025-06-01 10:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3512 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 25706 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29234ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 29234ms
Finished structural reductions in LTL mode , in 1 iterations and 29477 ms. Remains : 109/109 places, 101/101 transitions.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 1018 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (360 resets) in 281 ms. (141 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (105 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (105 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
[2025-06-01 10:38:55] [INFO ] Invariant cache hit.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 88/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/204 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/210 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 110 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 88/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/204 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/210 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 119 constraints, problems are : Problem set: 0 solved, 2 unsolved in 190 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 306ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 101/101 transitions.
Graph (complete) has 207 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 104 transition count 61
Reduce places removed 35 places and 0 transitions.
Graph (complete) has 123 edges and 69 vertex of which 62 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 62 transition count 58
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 90 place count 59 transition count 51
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 59 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 56 transition count 48
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 52 transition count 44
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 5 rules applied. Total rules applied 105 place count 50 transition count 41
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 108 place count 47 transition count 41
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 108 place count 47 transition count 32
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 126 place count 38 transition count 32
Applied a total of 126 rules in 11 ms. Remains 38 /109 variables (removed 71) and now considering 32/101 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 38/109 places, 32/101 transitions.
RANDOM walk for 40000 steps (1212 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (549 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (517 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 83 steps, run visited all 2 properties in 6 ms. (steps per millisecond=13 )
Probabilistic random walk after 83 steps, saw 60 distinct states, run finished after 6 ms. (steps per millisecond=13 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p0))), (F p0), (F (NOT (AND p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 8 factoid took 1621 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 334 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 324 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3957 reset in 143 ms.
Product exploration explored 100000 steps with 3953 reset in 152 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 352 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 101/101 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 109 transition count 101
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 38 rules in 9 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:38:59] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 101 rows 109 cols
[2025-06-01 10:38:59] [INFO ] Computed 8 invariants in 4 ms
[2025-06-01 10:38:59] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 38 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 38/155 constraints. Problems are: Problem set: 38 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/155 constraints. Problems are: Problem set: 38 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/155 constraints. Problems are: Problem set: 38 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 155 constraints, problems are : Problem set: 38 solved, 58 unsolved in 5223 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 38 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 38 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 43/109 variables, 8/8 constraints. Problems are: Problem set: 38 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 38 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 38 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 38/155 constraints. Problems are: Problem set: 38 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 58/213 constraints. Problems are: Problem set: 38 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 38 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 38 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 38 solved, 58 unsolved in 8501 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 58/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13746ms problems are : Problem set: 38 solved, 58 unsolved
Search for dead transitions found 38 dead transitions in 13746ms
Found 38 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 38 transitions
Dead transitions reduction (with SMT) removed 38 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 109/109 places, 63/101 transitions.
Graph (complete) has 170 edges and 109 vertex of which 71 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 71 /109 variables (removed 38) and now considering 63/63 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/109 places, 63/101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13775 ms. Remains : 71/109 places, 63/101 transitions.
Built C files in :
/tmp/ltsmin3428612386105873026
[2025-06-01 10:39:13] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3428612386105873026
Running compilation step : cd /tmp/ltsmin3428612386105873026;'/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 331 ms.
Running link step : cd /tmp/ltsmin3428612386105873026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3428612386105873026;'/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/stateBased6648226704973086437.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-02 finished in 84273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 109/109 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 113 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 113 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 109 transition count 101
Applied a total of 17 rules in 13 ms. Remains 109 /118 variables (removed 9) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2025-06-01 10:39:13] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:13] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-01 10:39:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:14] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2025-06-01 10:39:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3788 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 25635 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29436ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 29437ms
Starting structural reductions in LTL mode, iteration 1 : 109/118 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29699 ms. Remains : 109/118 places, 101/109 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 12 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-04 finished in 30163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 109/109 transitions.
Graph (complete) has 221 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 112 transition count 59
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 67 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 66 transition count 58
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 62 transition count 54
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 62 transition count 54
Applied a total of 101 rules in 10 ms. Remains 62 /118 variables (removed 56) and now considering 54/109 (removed 55) transitions.
// Phase 1: matrix 54 rows 62 cols
[2025-06-01 10:39:43] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:44] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-01 10:39:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:44] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:39:44] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2025-06-01 10:39:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/116 variables, and 63 constraints, problems are : Problem set: 0 solved, 45 unsolved in 972 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/116 variables, and 108 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1699 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2675ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 2677ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/118 places, 54/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2818 ms. Remains : 62/118 places, 54/109 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-06
Product exploration explored 100000 steps with 1693 reset in 96 ms.
Product exploration explored 100000 steps with 1692 reset in 104 ms.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 95 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 54/54 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2025-06-01 10:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:47] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-01 10:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:47] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:39:47] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2025-06-01 10:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/116 variables, and 63 constraints, problems are : Problem set: 0 solved, 45 unsolved in 905 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/102 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/116 variables, and 108 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1765 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2676ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 2676ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2829 ms. Remains : 62/62 places, 54/54 transitions.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 81 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1693 reset in 102 ms.
Product exploration explored 100000 steps with 1691 reset in 113 ms.
Built C files in :
/tmp/ltsmin11701213676492599991
[2025-06-01 10:39:50] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2025-06-01 10:39:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 10:39:50] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2025-06-01 10:39:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 10:39:50] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2025-06-01 10:39:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 10:39:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11701213676492599991
Running compilation step : cd /tmp/ltsmin11701213676492599991;'/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 137 ms.
Running link step : cd /tmp/ltsmin11701213676492599991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11701213676492599991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17263247017292162372.hoa' '--buchi-type=spotba'
LTSmin run took 231 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-06 finished in 7419 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(F(p0)))'
Support contains 6 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 109/109 transitions.
Graph (complete) has 221 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 3 places and 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 114 transition count 74
Reduce places removed 32 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 82 transition count 71
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 79 transition count 71
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 76 transition count 68
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 76 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 75 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 75 transition count 67
Applied a total of 79 rules in 15 ms. Remains 75 /118 variables (removed 43) and now considering 67/109 (removed 42) transitions.
// Phase 1: matrix 67 rows 75 cols
[2025-06-01 10:39:51] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-01 10:39:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 10:39:51] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:39:51] [INFO ] Redundant transitions in 0 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-01 10:39:51] [INFO ] Invariant cache hit.
[2025-06-01 10:39:51] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 3/74 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 66/140 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 2/142 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 92 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2400 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 3/74 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 66/140 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 52/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 2/142 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 155 constraints, problems are : Problem set: 0 solved, 63 unsolved in 5145 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7552ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 7552ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/118 places, 67/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7748 ms. Remains : 75/118 places, 67/109 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-08
Stuttering criterion allowed to conclude after 101 steps with 5 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-08 finished in 7852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(p1)))'
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 109/109 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 113 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 113 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 109 transition count 101
Applied a total of 17 rules in 4 ms. Remains 109 /118 variables (removed 9) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2025-06-01 10:39:59] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 10:39:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:59] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2025-06-01 10:39:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3687 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 25837 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29549ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 29550ms
Starting structural reductions in LTL mode, iteration 1 : 109/118 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29780 ms. Remains : 109/118 places, 101/109 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-11 finished in 29999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)||(p1&&F(p2))))||p0)))'
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 109/109 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 114 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 114 transition count 105
Applied a total of 8 rules in 5 ms. Remains 114 /118 variables (removed 4) and now considering 105/109 (removed 4) transitions.
// Phase 1: matrix 105 rows 114 cols
[2025-06-01 10:40:29] [INFO ] Computed 9 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:40:29] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 10:40:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:40:29] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-01 10:40:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 4/114 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 105/219 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 123 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4495 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 4/114 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 105/219 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 100/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 223 constraints, problems are : Problem set: 0 solved, 100 unsolved in 28149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32664ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 32665ms
Starting structural reductions in LTL mode, iteration 1 : 114/118 places, 105/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32913 ms. Remains : 114/118 places, 105/109 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-13
Stuttering criterion allowed to conclude after 33424 steps with 318 reset in 44 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-13 finished in 33176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 109/109 transitions.
Graph (complete) has 221 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 113 transition count 69
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 77 transition count 69
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 73 transition count 65
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 73 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 72 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 72 transition count 64
Applied a total of 83 rules in 14 ms. Remains 72 /118 variables (removed 46) and now considering 64/109 (removed 45) transitions.
// Phase 1: matrix 64 rows 72 cols
[2025-06-01 10:41:02] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:41:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-01 10:41:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:41:02] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:41:02] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2025-06-01 10:41:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 61/130 variables, 69/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/136 variables, and 77 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1399 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/72 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 61/130 variables, 69/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 58/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/136 variables, and 135 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3186 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/72 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4589ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4589ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/118 places, 64/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4737 ms. Remains : 72/118 places, 64/109 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-15
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-15 finished in 4838 ms.
All properties solved by simple procedures.
Total runtime 239424 ms.

BK_STOP 1748774467619

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

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

Sequence of Actions to be Executed by the VM

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

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

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