Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 270K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 416K 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 50K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 468K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 211K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 916K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K 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 162K 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-05-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748651657965

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 00:34:19] [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:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:34:19] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2025-05-31 00:34:19] [INFO ] Transformed 206 places.
[2025-05-31 00:34:19] [INFO ] Transformed 325 transitions.
[2025-05-31 00:34:19] [INFO ] Parsed PT model containing 206 places and 325 transitions and 1175 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CSRepetitions-PT-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 206 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 9 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2025-05-31 00:34:19] [INFO ] Computed 30 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:34:19] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-05-31 00:34:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:34:19] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-31 00:34:19] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-05-31 00:34:19] [INFO ] Invariant cache hit.
[2025-05-31 00:34:19] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16694 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 25961 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42904ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 42922ms
Finished structural reductions in LTL mode , in 1 iterations and 43332 ms. Remains : 206/206 places, 325/325 transitions.
Support contains 206 out of 206 places after structural reductions.
[2025-05-31 00:35:03] [INFO ] Flatten gal took : 56 ms
[2025-05-31 00:35:03] [INFO ] Flatten gal took : 36 ms
[2025-05-31 00:35:03] [INFO ] Input system was already deterministic with 325 transitions.
RANDOM walk for 40001 steps (644 resets) in 934 ms. (42 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40004 steps (17 resets) in 795 ms. (50 steps per ms) remains 1/1 properties
[2025-05-31 00:35:03] [INFO ] Invariant cache hit.
[2025-05-31 00:35:03] [INFO ] State equation strengthened by 25 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 30/531 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/206 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 25 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 25 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 156 transition count 300
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 195 place count 36 transition count 180
Iterating global reduction 0 with 120 rules applied. Total rules applied 315 place count 36 transition count 180
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 330 place count 26 transition count 175
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 430 place count 26 transition count 75
Applied a total of 430 rules in 37 ms. Remains 26 /206 variables (removed 180) and now considering 75/325 (removed 250) transitions.
// Phase 1: matrix 75 rows 26 cols
[2025-05-31 00:35:04] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:04] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-05-31 00:35:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:04] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:35:04] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2025-05-31 00:35:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 75/100 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 0/101 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 26 constraints, problems are : Problem set: 0 solved, 50 unsolved in 722 ms.
Refiners :[State Equation: 26/26 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 75/100 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 50/76 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 76 constraints, problems are : Problem set: 0 solved, 50 unsolved in 691 ms.
Refiners :[State Equation: 26/26 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1417ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/206 places, 75/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1504 ms. Remains : 26/206 places, 75/325 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 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 15 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-05-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-05-LTLFireability-00 finished in 2090 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 25 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 20 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2025-05-31 00:35:06] [INFO ] Computed 30 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-31 00:35:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-31 00:35:06] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:35:06] [INFO ] Redundant transitions in 15 ms returned []
Running 300 sub problems to find dead transitions.
[2025-05-31 00:35:06] [INFO ] Invariant cache hit.
[2025-05-31 00:35:06] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16285 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 25334 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41743ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 41745ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42116 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-01
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-01 finished in 42177 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(p1)||p0)))'
Support contains 51 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2025-05-31 00:35:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:48] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-31 00:35:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:35:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-31 00:35:48] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-05-31 00:35:48] [INFO ] Invariant cache hit.
[2025-05-31 00:35:48] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16899 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 26680 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43689ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 43691ms
Finished structural reductions in LTL mode , in 1 iterations and 43977 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 12 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-05-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-05-LTLFireability-02 finished in 44698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 150 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 17 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2025-05-31 00:36:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:36:33] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-31 00:36:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:36:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-31 00:36:33] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:36:33] [INFO ] Redundant transitions in 8 ms returned []
Running 300 sub problems to find dead transitions.
[2025-05-31 00:36:33] [INFO ] Invariant cache hit.
[2025-05-31 00:36:33] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16491 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 26492 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43072ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 43073ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43288 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-03
Stuttering criterion allowed to conclude after 2969 steps with 228 reset in 38 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-03 finished in 43406 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 30 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 156 transition count 300
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 195 place count 36 transition count 180
Iterating global reduction 0 with 120 rules applied. Total rules applied 315 place count 36 transition count 180
Applied a total of 315 rules in 25 ms. Remains 36 /206 variables (removed 170) and now considering 180/325 (removed 145) transitions.
// Phase 1: matrix 180 rows 36 cols
[2025-05-31 00:37:16] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:16] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-31 00:37:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:16] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:37:16] [INFO ] Redundant transitions in 2 ms returned []
Running 155 sub problems to find dead transitions.
[2025-05-31 00:37:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 180/215 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 1/216 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 41 constraints, problems are : Problem set: 0 solved, 155 unsolved in 3978 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 180/215 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 1/216 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 155/196 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 196 constraints, problems are : Problem set: 0 solved, 155 unsolved in 4729 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8733ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 8734ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/206 places, 180/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8836 ms. Remains : 36/206 places, 180/325 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-04
Product exploration explored 100000 steps with 2384 reset in 806 ms.
Stack based approach found an accepted trace after 99 steps with 1 reset with depth 50 and stack size 50 in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-04 finished in 9704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(X(G((X(!p2)&&p1))))))))'
Support contains 180 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2025-05-31 00:37:26] [INFO ] Computed 30 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:26] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-31 00:37:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:37:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-31 00:37:26] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-05-31 00:37:26] [INFO ] Invariant cache hit.
[2025-05-31 00:37:26] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 17529 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 26163 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43775ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 43776ms
Finished structural reductions in LTL mode , in 1 iterations and 43955 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 511 ms :[(OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), true, (AND p1 p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (AND (NOT p0) p1), (AND (NOT p0) p1 p2), p2]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-05
Entered a terminal (fully accepting) state of product in 25 steps with 3 reset in 2 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-05 finished in 44501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 0 with 69 rules applied. Total rules applied 69 place count 160 transition count 302
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 179 place count 50 transition count 192
Iterating global reduction 0 with 110 rules applied. Total rules applied 289 place count 50 transition count 192
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 308 place count 31 transition count 78
Iterating global reduction 0 with 19 rules applied. Total rules applied 327 place count 31 transition count 78
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 346 place count 31 transition count 59
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 356 place count 26 transition count 54
Applied a total of 356 rules in 23 ms. Remains 26 /206 variables (removed 180) and now considering 54/325 (removed 271) transitions.
[2025-05-31 00:38:10] [INFO ] Flow matrix only has 38 transitions (discarded 16 similar events)
// Phase 1: matrix 38 rows 26 cols
[2025-05-31 00:38:10] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-31 00:38:10] [INFO ] Flow matrix only has 38 transitions (discarded 16 similar events)
[2025-05-31 00:38:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 00:38:10] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:38:10] [INFO ] Redundant transitions in 4 ms returned []
Running 48 sub problems to find dead transitions.
[2025-05-31 00:38:10] [INFO ] Flow matrix only has 38 transitions (discarded 16 similar events)
[2025-05-31 00:38:10] [INFO ] Invariant cache hit.
[2025-05-31 00:38:10] [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/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 38/64 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/64 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 35 constraints, problems are : Problem set: 0 solved, 48 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 38/64 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 48/83 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 83 constraints, problems are : Problem set: 0 solved, 48 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1172ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1172ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/206 places, 54/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1280 ms. Remains : 26/206 places, 54/325 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-08
Stuttering criterion allowed to conclude after 42 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-08 finished in 1372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G((p1||X((p1 U G(p2))))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2025-05-31 00:38:12] [INFO ] Computed 30 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:12] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-31 00:38:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-31 00:38:12] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-05-31 00:38:12] [INFO ] Invariant cache hit.
[2025-05-31 00:38:12] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 17374 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 26301 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43758ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 43759ms
Finished structural reductions in LTL mode , in 1 iterations and 44081 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true, (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-09
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-09 finished in 44299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||X(p1))) U X(X(!p2))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2025-05-31 00:38:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-31 00:38:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:38:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-31 00:38:56] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-05-31 00:38:56] [INFO ] Invariant cache hit.
[2025-05-31 00:38:56] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16604 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 26017 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42707ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 42708ms
Finished structural reductions in LTL mode , in 1 iterations and 43034 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 313 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2, true, (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1612 steps with 27 reset in 11 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-10 finished in 43379 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||F((p1||X(X(p2)))))))||G(p3)))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 158 transition count 301
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 187 place count 43 transition count 186
Iterating global reduction 0 with 115 rules applied. Total rules applied 302 place count 43 transition count 186
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 319 place count 26 transition count 84
Iterating global reduction 0 with 17 rules applied. Total rules applied 336 place count 26 transition count 84
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 353 place count 26 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 363 place count 21 transition count 62
Applied a total of 363 rules in 14 ms. Remains 21 /206 variables (removed 185) and now considering 62/325 (removed 263) transitions.
[2025-05-31 00:39:39] [INFO ] Flow matrix only has 34 transitions (discarded 28 similar events)
// Phase 1: matrix 34 rows 21 cols
[2025-05-31 00:39:39] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-31 00:39:39] [INFO ] Flow matrix only has 34 transitions (discarded 28 similar events)
[2025-05-31 00:39:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:39:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:39:39] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2025-05-31 00:39:39] [INFO ] Flow matrix only has 34 transitions (discarded 28 similar events)
[2025-05-31 00:39:39] [INFO ] Invariant cache hit.
[2025-05-31 00:39:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 34/55 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 28 constraints, problems are : Problem set: 0 solved, 54 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 34/55 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 54/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 82 constraints, problems are : Problem set: 0 solved, 54 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1163ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/206 places, 62/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1246 ms. Remains : 21/206 places, 62/325 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-11
Stuttering criterion allowed to conclude after 21 steps with 1 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-11 finished in 1377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)&&F(X(p1))&&F(p2))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2025-05-31 00:39:41] [INFO ] Computed 30 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:41] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-31 00:39:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:39:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-31 00:39:41] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-05-31 00:39:41] [INFO ] Invariant cache hit.
[2025-05-31 00:39:41] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16829 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 26357 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43256ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 43257ms
Finished structural reductions in LTL mode , in 1 iterations and 43593 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-13
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-13 finished in 43805 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 (((F(X(X(p1)))&&X(p2)) U p1)||X(X(p3)))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2025-05-31 00:40:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:25] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-31 00:40:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:40:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-31 00:40:25] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-05-31 00:40:25] [INFO ] Invariant cache hit.
[2025-05-31 00:40:25] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16621 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 25923 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42613ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 42614ms
Finished structural reductions in LTL mode , in 1 iterations and 42966 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 390 ms :[true, (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-15 finished in 43373 ms.
All properties solved by simple procedures.
Total runtime 409266 ms.

BK_STOP 1748652068399

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-05"
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-05, 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-174854029100764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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