Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854029000756.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 CSRepetitions-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854029000756
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 522K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 87K 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 CSRepetitions-PT-04-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748650432169

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 00:13:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 00:13:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:13:56] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2025-05-31 00:13:56] [INFO ] Transformed 117 places.
[2025-05-31 00:13:56] [INFO ] Transformed 176 transitions.
[2025-05-31 00:13:56] [INFO ] Parsed PT model containing 117 places and 176 transitions and 624 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-PT-04-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2025-05-31 00:13:56] [INFO ] Computed 20 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:13:56] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-05-31 00:13:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:13:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:13:57] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:13:57] [INFO ] Invariant cache hit.
[2025-05-31 00:13:57] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 9088 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15225ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 15240ms
Finished structural reductions in LTL mode , in 1 iterations and 15577 ms. Remains : 117/117 places, 176/176 transitions.
Support contains 117 out of 117 places after structural reductions.
[2025-05-31 00:14:12] [INFO ] Flatten gal took : 36 ms
[2025-05-31 00:14:12] [INFO ] Flatten gal took : 22 ms
[2025-05-31 00:14:12] [INFO ] Input system was already deterministic with 176 transitions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 31440 steps (718 resets) in 894 ms. (35 steps per ms) remains 0/27 properties
Computed a total of 0 stabilizing places and 16 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(X(p0))||G(p1)))))))'
Support contains 33 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:14:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:13] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-05-31 00:14:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:14:13] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:14:13] [INFO ] Invariant cache hit.
[2025-05-31 00:14:13] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5619 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12674ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12675ms
Finished structural reductions in LTL mode , in 1 iterations and 12856 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-00
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-00 finished in 13403 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 17 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:14:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:26] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-05-31 00:14:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:14:26] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:14:26] [INFO ] Redundant transitions in 8 ms returned []
Running 160 sub problems to find dead transitions.
[2025-05-31 00:14:26] [INFO ] Invariant cache hit.
[2025-05-31 00:14:26] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5640 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7210 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12893ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12894ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13103 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-01
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-01 finished in 13169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0)) U X(X(X(p2)))))'
Support contains 36 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-31 00:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:14:40] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:14:40] [INFO ] Invariant cache hit.
[2025-05-31 00:14:40] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5477 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6926 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12432ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12433ms
Finished structural reductions in LTL mode , in 1 iterations and 12610 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 498 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 244 ms.
Product exploration explored 100000 steps with 25000 reset in 223 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 8 factoid took 145 ms. Reduced automaton from 15 states, 35 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 12 to 8
RANDOM walk for 40002 steps (885 resets) in 306 ms. (130 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (43 resets) in 779 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (59 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
[2025-05-31 00:14:54] [INFO ] Invariant cache hit.
[2025-05-31 00:14:54] [INFO ] State equation strengthened by 16 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Real declared 36/293 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/117 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR (NOT p2) (NOT p1) p0)), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p2 p1 p0))), (F (NOT p0)), (F (NOT (OR p1 p0))), (F (NOT (AND p2 p0))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 532 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 36 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:55] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-31 00:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:14:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:14:55] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:14:55] [INFO ] Invariant cache hit.
[2025-05-31 00:14:55] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5649 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6947 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12625ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12627ms
Finished structural reductions in LTL mode , in 1 iterations and 12798 ms. Remains : 117/117 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2)]
RANDOM walk for 4222 steps (91 resets) in 37 ms. (111 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 204 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 378 ms.
Product exploration explored 100000 steps with 25000 reset in 378 ms.
Applying partial POR strategy [true, true, true, false, false, true, false]
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 36 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:15:10] [INFO ] Redundant transitions in 4 ms returned []
Running 160 sub problems to find dead transitions.
[2025-05-31 00:15:10] [INFO ] Invariant cache hit.
[2025-05-31 00:15:10] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5572 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6840 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12441ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12441ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12460 ms. Remains : 117/117 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin2862420043649622112
[2025-05-31 00:15:23] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2862420043649622112
Running compilation step : cd /tmp/ltsmin2862420043649622112;'/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 404 ms.
Running link step : cd /tmp/ltsmin2862420043649622112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2862420043649622112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14981305056307445728.hoa' '--buchi-type=spotba'
LTSmin run took 194 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-PT-04-LTLFireability-02 finished in 43972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p0 U !p1) U ((G(p2)||G(F(p0))) U p3))))'
Support contains 117 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-31 00:15:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:23] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:15:23] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:15:24] [INFO ] Redundant transitions in 1 ms returned []
Running 160 sub problems to find dead transitions.
[2025-05-31 00:15:24] [INFO ] Invariant cache hit.
[2025-05-31 00:15:24] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5597 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7121 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12749ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12751ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12867 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p3), (NOT p3), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-03
Stuttering criterion allowed to conclude after 7914 steps with 714 reset in 63 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-03 finished in 13251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 20 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 85 transition count 160
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 108 place count 25 transition count 100
Iterating global reduction 0 with 60 rules applied. Total rules applied 168 place count 25 transition count 100
Applied a total of 168 rules in 20 ms. Remains 25 /117 variables (removed 92) and now considering 100/176 (removed 76) transitions.
// Phase 1: matrix 100 rows 25 cols
[2025-05-31 00:15:37] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:37] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-05-31 00:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:15:37] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2025-05-31 00:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 100/124 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 1/125 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 29 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 100/124 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 1/125 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 84/113 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 113 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2974ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 2974ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/117 places, 100/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3064 ms. Remains : 25/117 places, 100/176 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-04-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-04-LTLFireability-04 finished in 3637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U !p0))'
Support contains 17 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2025-05-31 00:15:40] [INFO ] Computed 20 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:40] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-31 00:15:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:15:40] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:15:40] [INFO ] Redundant transitions in 1 ms returned []
Running 160 sub problems to find dead transitions.
[2025-05-31 00:15:40] [INFO ] Invariant cache hit.
[2025-05-31 00:15:40] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5546 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6842 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12422ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12422ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12593 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 88 ms :[p0, p0]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-07
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-07 finished in 12694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1||G(!p0))) U X(p2)))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:15:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:53] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-31 00:15:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:15:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:15:53] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:15:53] [INFO ] Invariant cache hit.
[2025-05-31 00:15:53] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5410 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6669 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12111ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12112ms
Finished structural reductions in LTL mode , in 1 iterations and 12285 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p0 (NOT p2)), (NOT p2), true, (AND (NOT p1) p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-08
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-08 finished in 12479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F((!p1 U (p2||G(!p1))))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 91 transition count 163
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 87 place count 43 transition count 115
Iterating global reduction 0 with 48 rules applied. Total rules applied 135 place count 43 transition count 115
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 144 place count 34 transition count 70
Iterating global reduction 0 with 9 rules applied. Total rules applied 153 place count 34 transition count 70
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 162 place count 34 transition count 61
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 170 place count 30 transition count 57
Applied a total of 170 rules in 16 ms. Remains 30 /117 variables (removed 87) and now considering 57/176 (removed 119) transitions.
[2025-05-31 00:16:05] [INFO ] Flow matrix only has 45 transitions (discarded 12 similar events)
// Phase 1: matrix 45 rows 30 cols
[2025-05-31 00:16:05] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:05] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 00:16:05] [INFO ] Flow matrix only has 45 transitions (discarded 12 similar events)
[2025-05-31 00:16:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 00:16:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:16:06] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2025-05-31 00:16:06] [INFO ] Flow matrix only has 45 transitions (discarded 12 similar events)
[2025-05-31 00:16:06] [INFO ] Invariant cache hit.
[2025-05-31 00:16:06] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 3/30 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 45/75 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 40 constraints, problems are : Problem set: 0 solved, 50 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 3/30 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 45/75 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 50/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 90 constraints, problems are : Problem set: 0 solved, 50 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1281ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1282ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/117 places, 57/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1364 ms. Remains : 30/117 places, 57/176 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-09
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-09 finished in 1509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&F((p2||X(p2)))&&p0))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2025-05-31 00:16:07] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-31 00:16:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:16:07] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:16:07] [INFO ] Invariant cache hit.
[2025-05-31 00:16:07] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5547 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6823 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12395ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12397ms
Finished structural reductions in LTL mode , in 1 iterations and 12582 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-10 finished in 12757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&X(X(F(p2)))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:20] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-31 00:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:20] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:16:20] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:16:20] [INFO ] Invariant cache hit.
[2025-05-31 00:16:20] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5487 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6999 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12512ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12512ms
Finished structural reductions in LTL mode , in 1 iterations and 12676 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-11
Product exploration explored 100000 steps with 9814 reset in 302 ms.
Stack based approach found an accepted trace after 1647 steps with 147 reset with depth 8 and stack size 8 in 6 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-11 finished in 13184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p1)&&p0))||X(p2)))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:16:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:33] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-31 00:16:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:16:33] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:16:33] [INFO ] Invariant cache hit.
[2025-05-31 00:16:33] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5642 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6479 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12147ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12148ms
Finished structural reductions in LTL mode , in 1 iterations and 12310 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-12 finished in 12557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:16:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:46] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-31 00:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:16:46] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:16:46] [INFO ] Invariant cache hit.
[2025-05-31 00:16:46] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5516 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6763 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12308ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12309ms
Finished structural reductions in LTL mode , in 1 iterations and 12491 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-13
Entered a terminal (fully accepting) state of product in 250 steps with 5 reset in 2 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-13 finished in 12590 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||(X(G(!p1)) U (F(!p2)||X(p3)))))))'
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:16:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:58] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-31 00:16:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:16:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:16:58] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:16:58] [INFO ] Invariant cache hit.
[2025-05-31 00:16:58] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5604 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6943 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12571ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12572ms
Finished structural reductions in LTL mode , in 1 iterations and 12732 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3) (NOT p1)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-14
Product exploration explored 100000 steps with 2224 reset in 383 ms.
Product exploration explored 100000 steps with 2240 reset in 354 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 (NOT p3) p1))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND p2 (NOT p3) p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 658 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter sensitive) to 5 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3) (NOT p1)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3))]
RANDOM walk for 16743 steps (358 resets) in 187 ms. (89 steps per ms) remains 0/14 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 (NOT p3) p1))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND p2 (NOT p3) p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2) p3 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (OR (NOT p2) p3 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F p3), (F (NOT (OR p0 (NOT p2) p3 p1))), (F p0)]
Knowledge based reduction with 16 factoid took 1132 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter sensitive) to 5 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3) (NOT p1)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3) (NOT p1)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3))]
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 00:17:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:17:14] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-31 00:17:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:17:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 00:17:14] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-31 00:17:14] [INFO ] Invariant cache hit.
[2025-05-31 00:17:14] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 153 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5545 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 16/117 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 176/293 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 160/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 313 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6997 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 117/117 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12567ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12568ms
Finished structural reductions in LTL mode , in 1 iterations and 12724 ms. Remains : 117/117 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 (NOT p3) p1))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND p2 (NOT p3) p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 664 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter sensitive) to 5 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3) (NOT p1)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3))]
RANDOM walk for 32826 steps (732 resets) in 228 ms. (143 steps per ms) remains 0/14 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 (NOT p3) p1))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND p2 (NOT p3) p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2) p3 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (OR (NOT p2) p3 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F p3), (F (NOT (OR p0 (NOT p2) p3 p1))), (F p0)]
Knowledge based reduction with 16 factoid took 1158 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter sensitive) to 5 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3) (NOT p1)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3) (NOT p1)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3) (NOT p1)), (AND (NOT p0) p2 (NOT p3) p1), (AND (NOT p0) p2 (NOT p3))]
Product exploration explored 100000 steps with 2255 reset in 292 ms.
Product exploration explored 100000 steps with 2235 reset in 304 ms.
Built C files in :
/tmp/ltsmin7913091957318331987
[2025-05-31 00:17:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7913091957318331987
Running compilation step : cd /tmp/ltsmin7913091957318331987;'/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 277 ms.
Running link step : cd /tmp/ltsmin7913091957318331987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7913091957318331987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10124876803882962051.hoa' '--buchi-type=spotba'
LTSmin run took 81 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-PT-04-LTLFireability-14 finished in 32842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 89 transition count 162
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 94 place count 37 transition count 110
Iterating global reduction 0 with 52 rules applied. Total rules applied 146 place count 37 transition count 110
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 155 place count 28 transition count 65
Iterating global reduction 0 with 9 rules applied. Total rules applied 164 place count 28 transition count 65
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 173 place count 28 transition count 56
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 1 with 6 rules applied. Total rules applied 179 place count 25 transition count 53
Applied a total of 179 rules in 13 ms. Remains 25 /117 variables (removed 92) and now considering 53/176 (removed 123) transitions.
[2025-05-31 00:17:31] [INFO ] Flow matrix only has 43 transitions (discarded 10 similar events)
// Phase 1: matrix 43 rows 25 cols
[2025-05-31 00:17:31] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:17:31] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 00:17:31] [INFO ] Flow matrix only has 43 transitions (discarded 10 similar events)
[2025-05-31 00:17:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:17:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:17:31] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:17:31] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2025-05-31 00:17:31] [INFO ] Flow matrix only has 43 transitions (discarded 10 similar events)
[2025-05-31 00:17:31] [INFO ] Invariant cache hit.
[2025-05-31 00:17:31] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 43/68 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/68 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 33 constraints, problems are : Problem set: 0 solved, 46 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 43/68 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 46/79 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/68 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 79 constraints, problems are : Problem set: 0 solved, 46 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1149ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/117 places, 53/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1227 ms. Remains : 25/117 places, 53/176 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-15
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-15 finished in 1310 ms.
All properties solved by simple procedures.
Total runtime 216477 ms.

BK_STOP 1748650652733

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="CSRepetitions-PT-04"
export BK_EXAMINATION="LTLFireability"
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 CSRepetitions-PT-04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854029000756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-04.tgz
mv CSRepetitions-PT-04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;