Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100203.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 MedleyA-PT-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 46K 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 MedleyA-PT-14-LTLCardinality-00
FORMULA_NAME MedleyA-PT-14-LTLCardinality-01
FORMULA_NAME MedleyA-PT-14-LTLCardinality-02
FORMULA_NAME MedleyA-PT-14-LTLCardinality-03
FORMULA_NAME MedleyA-PT-14-LTLCardinality-04
FORMULA_NAME MedleyA-PT-14-LTLCardinality-05
FORMULA_NAME MedleyA-PT-14-LTLCardinality-06
FORMULA_NAME MedleyA-PT-14-LTLCardinality-07
FORMULA_NAME MedleyA-PT-14-LTLCardinality-08
FORMULA_NAME MedleyA-PT-14-LTLCardinality-09
FORMULA_NAME MedleyA-PT-14-LTLCardinality-10
FORMULA_NAME MedleyA-PT-14-LTLCardinality-11
FORMULA_NAME MedleyA-PT-14-LTLCardinality-12
FORMULA_NAME MedleyA-PT-14-LTLCardinality-13
FORMULA_NAME MedleyA-PT-14-LTLCardinality-14
FORMULA_NAME MedleyA-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748867378562

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 12:29:40] [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-02 12:29:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:29:41] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2025-06-02 12:29:41] [INFO ] Transformed 184 places.
[2025-06-02 12:29:41] [INFO ] Transformed 178 transitions.
[2025-06-02 12:29:41] [INFO ] Found NUPN structural information;
[2025-06-02 12:29:41] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-14-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 178/178 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 153 transition count 147
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 153 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 149 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 149 transition count 143
Applied a total of 70 rules in 61 ms. Remains 149 /184 variables (removed 35) and now considering 143/178 (removed 35) transitions.
// Phase 1: matrix 143 rows 149 cols
[2025-06-02 12:29:41] [INFO ] Computed 24 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:42] [INFO ] Implicit Places using invariants in 439 ms returned [38, 80, 117]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 507 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/184 places, 143/178 transitions.
Applied a total of 0 rules in 10 ms. Remains 146 /146 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 146/184 places, 143/178 transitions.
Support contains 21 out of 146 places after structural reductions.
[2025-06-02 12:29:42] [INFO ] Flatten gal took : 60 ms
[2025-06-02 12:29:42] [INFO ] Flatten gal took : 22 ms
[2025-06-02 12:29:42] [INFO ] Input system was already deterministic with 143 transitions.
RANDOM walk for 40000 steps (8 resets) in 1603 ms. (24 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 828 ms. (48 steps per ms) remains 1/3 properties
// Phase 1: matrix 143 rows 146 cols
[2025-06-02 12:29:43] [INFO ] Computed 21 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 85/124 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/146 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 143/289 variables, 146/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 85/124 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:29:43] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:29:43] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/146 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:29:44] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 143/289 variables, 146/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:29:44] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 930ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1491 steps, including 33 resets, run visited all 1 properties in 8 ms. (steps per millisecond=186 )
Parikh walk visited 1 properties in 13 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 143/143 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 145 transition count 134
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 137 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 136 transition count 133
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 18 place count 136 transition count 114
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 56 place count 117 transition count 114
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 62 place count 111 transition count 108
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 111 transition count 108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 68 place count 111 transition count 106
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 109 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 106 transition count 103
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 106 transition count 103
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 122 place count 84 transition count 81
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 144 place count 73 transition count 97
Applied a total of 144 rules in 59 ms. Remains 73 /146 variables (removed 73) and now considering 97/143 (removed 46) transitions.
// Phase 1: matrix 97 rows 73 cols
[2025-06-02 12:29:44] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:44] [INFO ] Implicit Places using invariants in 106 ms returned [6, 10, 26, 30, 45, 49]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 108 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/146 places, 97/143 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 94
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 94
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 59 transition count 94
Applied a total of 16 rules in 13 ms. Remains 59 /67 variables (removed 8) and now considering 94/97 (removed 3) transitions.
// Phase 1: matrix 94 rows 59 cols
[2025-06-02 12:29:44] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:44] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 12:29:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 12:29:44] [INFO ] Implicit Places using invariants and state equation in 149 ms returned [11, 26, 40]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 229 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/146 places, 94/143 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 93
Applied a total of 2 rules in 10 ms. Remains 55 /56 variables (removed 1) and now considering 93/94 (removed 1) transitions.
// Phase 1: matrix 93 rows 55 cols
[2025-06-02 12:29:45] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:45] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 12:29:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:45] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 12:29:45] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 55/146 places, 93/143 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 621 ms. Remains : 55/146 places, 93/143 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 752 ms.
Product exploration explored 100000 steps with 0 reset in 256 ms.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 377 ms. (105 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
[2025-06-02 12:29:46] [INFO ] Invariant cache hit.
[2025-06-02 12:29:46] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/49 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 92/147 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/148 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/148 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 26/26 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/49 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:29:47] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/55 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 92/147 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 25/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/148 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/148 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 96 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 93/93 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 92
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 55 transition count 88
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 51 transition count 87
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 51 transition count 87
Applied a total of 13 rules in 15 ms. Remains 51 /55 variables (removed 4) and now considering 87/93 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 51/55 places, 87/93 transitions.
RANDOM walk for 40000 steps (4274 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 12684 steps (237 resets) in 29 ms. (422 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 266 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 93/93 transitions.
Applied a total of 0 rules in 6 ms. Remains 55 /55 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2025-06-02 12:29:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-02 12:29:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:47] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 12:29:47] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:29:48] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2025-06-02 12:29:48] [INFO ] Invariant cache hit.
[2025-06-02 12:29:48] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:29:49] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:29:49] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:29:49] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 8 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:29:49] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 8 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:29:49] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 5/17 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 92/147 variables, 55/72 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 25/97 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/97 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/98 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/98 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/98 constraints. Problems are: Problem set: 10 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 98 constraints, problems are : Problem set: 10 solved, 79 unsolved in 3900 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/5 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 4/55 variables, 7/12 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 5/17 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 92/147 variables, 55/72 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 25/97 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 79/176 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/176 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 1/148 variables, 1/177 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/177 constraints. Problems are: Problem set: 10 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/148 variables, 0/177 constraints. Problems are: Problem set: 10 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 177 constraints, problems are : Problem set: 10 solved, 79 unsolved in 5150 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 79/89 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9111ms problems are : Problem set: 10 solved, 79 unsolved
Search for dead transitions found 10 dead transitions in 9114ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/55 places, 83/93 transitions.
Graph (complete) has 195 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 52 /55 variables (removed 3) and now considering 83/83 (removed 0) transitions.
// Phase 1: matrix 83 rows 52 cols
[2025-06-02 12:29:57] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:57] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-02 12:29:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:57] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 12:29:57] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/55 places, 83/93 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9566 ms. Remains : 52/55 places, 83/93 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
[2025-06-02 12:29:57] [INFO ] Invariant cache hit.
[2025-06-02 12:29:57] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/32 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 73/105 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 23/128 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/129 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/132 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/132 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/132 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/134 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/134 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/135 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 87 constraints, problems are : Problem set: 0 solved, 2 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 26/26 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/32 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 73/105 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 23/128 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/129 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/132 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/132 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/134 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/134 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/135 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/135 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/135 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 472ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 824 steps, including 114 resets, run visited all 2 properties in 17 ms. (steps per millisecond=48 )
Parikh walk visited 2 properties in 17 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 221 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 120 ms.
Product exploration explored 100000 steps with 1 reset in 251 ms.
Built C files in :
/tmp/ltsmin2699220427828304345
[2025-06-02 12:29:58] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2025-06-02 12:29:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:29:58] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2025-06-02 12:29:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:29:58] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2025-06-02 12:29:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:29:58] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2699220427828304345
Running compilation step : cd /tmp/ltsmin2699220427828304345;'/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 543 ms.
Running link step : cd /tmp/ltsmin2699220427828304345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin2699220427828304345;'/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/stateBased8612041352367362942.hoa' '--buchi-type=spotba'
LTSmin run took 706 ms.
FORMULA MedleyA-PT-14-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-14-LTLCardinality-00 finished in 15786 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(((p1 U (p2||G(p1)))&&p0)))'
Support contains 6 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 143/143 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 137
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 138 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 138 transition count 135
Applied a total of 16 rules in 9 ms. Remains 138 /146 variables (removed 8) and now considering 135/143 (removed 8) transitions.
// Phase 1: matrix 135 rows 138 cols
[2025-06-02 12:30:00] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:00] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-06-02 12:30:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:00] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-06-02 12:30:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:03] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:03] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:03] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:03] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:03] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:03] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:03] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:04] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:04] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 3 ms to minimize.
Problem TDEAD128 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 11/32 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:04] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:04] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/34 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 135/273 variables, 138/172 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 172 constraints, problems are : Problem set: 3 solved, 131 unsolved in 12642 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 4/138 variables, 15/17 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 4/21 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 13/34 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 135/273 variables, 138/172 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 131/303 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:16] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:17] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:17] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 4/307 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:19] [INFO ] Deduced a trap along path composed of 13 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:19] [INFO ] Deduced a trap along path composed of 7 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:19] [INFO ] Deduced a trap along path composed of 7 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:19] [INFO ] Deduced a trap along path composed of 7 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:19] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:20] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:21] [INFO ] Deduced a trap along path composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 7/314 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:25] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/315 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/315 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/273 variables, 0/315 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 315 constraints, problems are : Problem set: 3 solved, 131 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 131/134 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 42687ms problems are : Problem set: 3 solved, 131 unsolved
Search for dead transitions found 3 dead transitions in 42690ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/146 places, 132/143 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 135 transition count 132
Applied a total of 3 rules in 5 ms. Remains 135 /138 variables (removed 3) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 135 cols
[2025-06-02 12:30:43] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:43] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-06-02 12:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:43] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 135/146 places, 132/143 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43589 ms. Remains : 135/146 places, 132/143 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-01 finished in 43833 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 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 143/143 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 145 transition count 133
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 136 transition count 133
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 18 place count 136 transition count 114
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 56 place count 117 transition count 114
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 111 transition count 108
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 111 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 68 place count 111 transition count 105
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 108 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 106 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 106 transition count 103
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 120 place count 85 transition count 82
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 146 place count 72 transition count 107
Applied a total of 146 rules in 38 ms. Remains 72 /146 variables (removed 74) and now considering 107/143 (removed 36) transitions.
// Phase 1: matrix 107 rows 72 cols
[2025-06-02 12:30:44] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:44] [INFO ] Implicit Places using invariants in 182 ms returned [6, 10, 25, 29, 44, 48]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 184 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/146 places, 107/143 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 66 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 104
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 101
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 57 transition count 107
Applied a total of 18 rules in 22 ms. Remains 57 /66 variables (removed 9) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 57 cols
[2025-06-02 12:30:44] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:44] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 12:30:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 12:30:44] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [11, 25, 39]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 319 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/146 places, 107/143 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 106
Applied a total of 2 rules in 12 ms. Remains 53 /54 variables (removed 1) and now considering 106/107 (removed 1) transitions.
// Phase 1: matrix 106 rows 53 cols
[2025-06-02 12:30:44] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:44] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-02 12:30:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:44] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-02 12:30:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 53/146 places, 106/143 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 843 ms. Remains : 53/146 places, 106/143 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 152 ms.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 45 ms :[(NOT p0)]
RANDOM walk for 36678 steps (8 resets) in 72 ms. (502 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 106/106 transitions.
Applied a total of 0 rules in 7 ms. Remains 53 /53 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-06-02 12:30:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:45] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 12:30:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:45] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-02 12:30:46] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:30:46] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2025-06-02 12:30:46] [INFO ] Invariant cache hit.
[2025-06-02 12:30:46] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:47] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 7 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:47] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 9 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:47] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 8 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/15 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 105/158 variables, 53/68 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 30/98 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/98 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 1/159 variables, 1/99 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/99 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/159 variables, 0/99 constraints. Problems are: Problem set: 12 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 99 constraints, problems are : Problem set: 12 solved, 86 unsolved in 4751 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/5 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 4/53 variables, 7/12 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/15 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 105/158 variables, 53/68 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 30/98 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 86/184 constraints. Problems are: Problem set: 12 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:30:52] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/185 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/185 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 1/159 variables, 1/186 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 0/186 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/159 variables, 0/186 constraints. Problems are: Problem set: 12 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 186 constraints, problems are : Problem set: 12 solved, 86 unsolved in 8344 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 86/98 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13127ms problems are : Problem set: 12 solved, 86 unsolved
Search for dead transitions found 12 dead transitions in 13128ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 94/106 transitions.
Graph (complete) has 205 edges and 53 vertex of which 50 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 50 /53 variables (removed 3) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 50 cols
[2025-06-02 12:30:59] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:59] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 12:30:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:59] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-02 12:30:59] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/53 places, 94/106 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13779 ms. Remains : 50/53 places, 94/106 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 51 ms :[(NOT p0)]
RANDOM walk for 36679 steps (8 resets) in 109 ms. (333 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 153 ms.
Built C files in :
/tmp/ltsmin3921362098874463477
[2025-06-02 12:31:00] [INFO ] Computing symmetric may disable matrix : 94 transitions.
[2025-06-02 12:31:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:31:00] [INFO ] Computing symmetric may enable matrix : 94 transitions.
[2025-06-02 12:31:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:31:00] [INFO ] Computing Do-Not-Accords matrix : 94 transitions.
[2025-06-02 12:31:00] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:31:00] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3921362098874463477
Running compilation step : cd /tmp/ltsmin3921362098874463477;'/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 491 ms.
Running link step : cd /tmp/ltsmin3921362098874463477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin3921362098874463477;'/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/stateBased11623287175622073638.hoa' '--buchi-type=spotba'
LTSmin run took 250 ms.
FORMULA MedleyA-PT-14-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-14-LTLCardinality-06 finished in 17056 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(F((!p0 U (G(!p0)||(!p0&&(!p1||G((!p2&&X(!p3)))))))))))'
Support contains 8 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 143/143 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 137
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 138 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 138 transition count 135
Applied a total of 16 rules in 10 ms. Remains 138 /146 variables (removed 8) and now considering 135/143 (removed 8) transitions.
// Phase 1: matrix 135 rows 138 cols
[2025-06-02 12:31:01] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:01] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-02 12:31:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:01] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-06-02 12:31:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:04] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:04] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:04] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:04] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:05] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:05] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:05] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:05] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:05] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:06] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:06] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:06] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
Problem TDEAD128 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 12/33 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 135/273 variables, 138/171 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 171 constraints, problems are : Problem set: 3 solved, 131 unsolved in 12087 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 4/138 variables, 15/17 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 4/21 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 12/33 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:15] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:15] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/35 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 135/273 variables, 138/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 131/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:18] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:18] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:19] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 3/307 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:23] [INFO ] Deduced a trap along path composed of 7 places in 71 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:23] [INFO ] Deduced a trap along path composed of 7 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:23] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:23] [INFO ] Deduced a trap along path composed of 4 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:23] [INFO ] Deduced a trap along path composed of 8 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:23] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 6/313 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:33] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/314 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 314 constraints, problems are : Problem set: 3 solved, 131 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 131/134 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 42126ms problems are : Problem set: 3 solved, 131 unsolved
Search for dead transitions found 3 dead transitions in 42128ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/146 places, 132/143 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 135 transition count 132
Applied a total of 3 rules in 3 ms. Remains 135 /138 variables (removed 3) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 135 cols
[2025-06-02 12:31:43] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:43] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-02 12:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:44] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 135/146 places, 132/143 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42976 ms. Remains : 135/146 places, 132/143 transitions.
Stuttering acceptance computed with spot in 346 ms :[p0, p0, p0, (AND p0 p3), (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p2) p3))]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 236 ms.
Stack based approach found an accepted trace after 67 steps with 0 reset with depth 68 and stack size 68 in 1 ms.
FORMULA MedleyA-PT-14-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-08 finished in 43595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(F(!p0)&&X(p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 143/143 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 137
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 138 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 138 transition count 135
Applied a total of 16 rules in 17 ms. Remains 138 /146 variables (removed 8) and now considering 135/143 (removed 8) transitions.
// Phase 1: matrix 135 rows 138 cols
[2025-06-02 12:31:44] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:45] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-02 12:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:45] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-06-02 12:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:47] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:48] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:48] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:48] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:48] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:48] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:48] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:48] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:49] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 10 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:49] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:49] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:49] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:49] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:31:50] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Problem TDEAD128 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 14/35 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 135/273 variables, 138/173 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/173 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/173 constraints. Problems are: Problem set: 5 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 173 constraints, problems are : Problem set: 5 solved, 129 unsolved in 12362 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 6/138 variables, 15/17 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 4/21 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 14/35 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 135/273 variables, 138/173 constraints. Problems are: Problem set: 5 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 129/302 constraints. Problems are: Problem set: 5 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:32:01] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:32:01] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:32:02] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 3/305 constraints. Problems are: Problem set: 5 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:32:04] [INFO ] Deduced a trap along path composed of 13 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:32:04] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:32:04] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:32:04] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:32:04] [INFO ] Deduced a trap along path composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 5/310 constraints. Problems are: Problem set: 5 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:32:10] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/311 constraints. Problems are: Problem set: 5 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:32:19] [INFO ] Deduced a trap along path composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/312 constraints. Problems are: Problem set: 5 solved, 129 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 312 constraints, problems are : Problem set: 5 solved, 129 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 129/134 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 42410ms problems are : Problem set: 5 solved, 129 unsolved
Search for dead transitions found 5 dead transitions in 42411ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/146 places, 130/143 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 134 transition count 130
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 4 rules in 3 ms. Remains 134 /138 variables (removed 4) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 134 cols
[2025-06-02 12:32:27] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:27] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-02 12:32:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:28] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 134/146 places, 130/143 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43264 ms. Remains : 134/146 places, 130/143 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 280 ms. (142 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
// Phase 1: matrix 130 rows 133 cols
[2025-06-02 12:32:29] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/263 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/133 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 441 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 133 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 130/130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 132 transition count 122
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 125 transition count 122
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 14 place count 125 transition count 100
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 58 place count 103 transition count 100
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 100 place count 82 transition count 79
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 126 place count 69 transition count 95
Applied a total of 126 rules in 24 ms. Remains 69 /133 variables (removed 64) and now considering 95/130 (removed 35) transitions.
// Phase 1: matrix 95 rows 69 cols
[2025-06-02 12:32:29] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:30] [INFO ] Implicit Places using invariants in 122 ms returned [5, 9, 23, 43, 47]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 127 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/133 places, 95/130 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 64 transition count 92
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 58 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 56 transition count 93
Applied a total of 16 rules in 12 ms. Remains 56 /64 variables (removed 8) and now considering 93/95 (removed 2) transitions.
// Phase 1: matrix 93 rows 56 cols
[2025-06-02 12:32:30] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:30] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 12:32:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 12:32:30] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [10, 26, 40]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 336 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/133 places, 93/130 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 92
Applied a total of 2 rules in 7 ms. Remains 52 /53 variables (removed 1) and now considering 92/93 (removed 1) transitions.
// Phase 1: matrix 92 rows 52 cols
[2025-06-02 12:32:30] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:30] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 12:32:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:30] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-02 12:32:30] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 52/133 places, 92/130 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 795 ms. Remains : 52/133 places, 92/130 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 20192 steps (5 resets) in 165 ms. (121 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 343 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-15 finished in 47341 ms.
All properties solved by simple procedures.
Total runtime 171211 ms.

BK_STOP 1748867552205

--------------------
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="MedleyA-PT-14"
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 MedleyA-PT-14, 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 r128-smll-174876524100203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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