Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r069-tall-171620504100252.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
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 r069-tall-171620504100252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 50K Apr 12 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 208K Apr 12 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 12 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Apr 12 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 35K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Apr 12 09:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 361K Apr 12 09:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 140K Apr 12 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 598K Apr 12 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 162K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text 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 1716421454177

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 23:44:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 23:44:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:44:15] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-22 23:44:15] [INFO ] Transformed 206 places.
[2024-05-22 23:44:15] [INFO ] Transformed 325 transitions.
[2024-05-22 23:44:15] [INFO ] Parsed PT model containing 206 places and 325 transitions and 1175 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-PT-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 185 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 12 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2024-05-22 23:44:15] [INFO ] Computed 30 invariants in 19 ms
[2024-05-22 23:44:15] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 23:44:15] [INFO ] Invariant cache hit.
[2024-05-22 23:44:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:44:16] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:44:16] [INFO ] Invariant cache hit.
[2024-05-22 23:44:16] [INFO ] State equation strengthened by 25 read => feed constraints.
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 10218 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11353 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]
After SMT, in 21916ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21935ms
Finished structural reductions in LTL mode , in 1 iterations and 22338 ms. Remains : 206/206 places, 325/325 transitions.
Support contains 185 out of 206 places after structural reductions.
[2024-05-22 23:44:38] [INFO ] Flatten gal took : 61 ms
[2024-05-22 23:44:38] [INFO ] Flatten gal took : 52 ms
[2024-05-22 23:44:38] [INFO ] Input system was already deterministic with 325 transitions.
RANDOM walk for 40000 steps (640 resets) in 883 ms. (45 steps per ms) remains 1/23 properties
BEST_FIRST walk for 2638 steps (0 resets) in 17 ms. (146 steps per ms) remains 0/1 properties
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 150 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.
[2024-05-22 23:44:39] [INFO ] Invariant cache hit.
[2024-05-22 23:44:39] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 23:44:39] [INFO ] Invariant cache hit.
[2024-05-22 23:44:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:44:39] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:44:39] [INFO ] Invariant cache hit.
[2024-05-22 23:44:39] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9741 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 10979 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]
After SMT, in 20922ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 20926ms
Finished structural reductions in LTL mode , in 1 iterations and 21175 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-00
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-00 finished in 21437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0))))))'
Support contains 30 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 11 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-22 23:45:00] [INFO ] Invariant cache hit.
[2024-05-22 23:45:01] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 23:45:01] [INFO ] Invariant cache hit.
[2024-05-22 23:45:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:45:01] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:45:01] [INFO ] Invariant cache hit.
[2024-05-22 23:45:01] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9681 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11038 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]
After SMT, in 20917ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 20920ms
Finished structural reductions in LTL mode , in 1 iterations and 21290 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 133 ms :[p0, p0, p0, true]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-01
Entered a terminal (fully accepting) state of product in 188 steps with 62 reset in 14 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-01 finished in 21459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 150 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.
[2024-05-22 23:45:22] [INFO ] Invariant cache hit.
[2024-05-22 23:45:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 23:45:22] [INFO ] Invariant cache hit.
[2024-05-22 23:45:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:45:22] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:45:22] [INFO ] Invariant cache hit.
[2024-05-22 23:45:22] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9941 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11441 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]
After SMT, in 21572ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21575ms
Finished structural reductions in LTL mode , in 1 iterations and 21763 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 673 ms.
Product exploration explored 100000 steps with 50000 reset in 610 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 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 23203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 52 ms. Remains 26 /206 variables (removed 180) and now considering 75/325 (removed 250) transitions.
// Phase 1: matrix 75 rows 26 cols
[2024-05-22 23:45:45] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 23:45:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 23:45:45] [INFO ] Invariant cache hit.
[2024-05-22 23:45:45] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-22 23:45:45] [INFO ] Redundant transitions in 2 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-22 23:45:45] [INFO ] Invariant cache hit.
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 367 ms.
Refiners :[State Equation: 26/26 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
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 300 ms.
Refiners :[State Equation: 26/26 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 672ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 673ms
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 785 ms. Remains : 26/206 places, 75/325 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 100 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 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-05-LTLFireability-03 finished in 1054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 151 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.
// Phase 1: matrix 325 rows 206 cols
[2024-05-22 23:45:46] [INFO ] Computed 30 invariants in 4 ms
[2024-05-22 23:45:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 23:45:46] [INFO ] Invariant cache hit.
[2024-05-22 23:45:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:45:46] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-22 23:45:46] [INFO ] Redundant transitions in 20 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-22 23:45:46] [INFO ] Invariant cache hit.
[2024-05-22 23:45:46] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9959 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11344 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]
After SMT, in 21482ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21485ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21703 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 474 ms.
Product exploration explored 100000 steps with 50000 reset in 509 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), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 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-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-05-LTLFireability-04 finished in 22764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0))||G(!p1))))'
Support contains 30 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 8 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-22 23:46:09] [INFO ] Invariant cache hit.
[2024-05-22 23:46:09] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-22 23:46:09] [INFO ] Invariant cache hit.
[2024-05-22 23:46:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:46:09] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:46:09] [INFO ] Invariant cache hit.
[2024-05-22 23:46:09] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9935 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11589 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]
After SMT, in 21716ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21719ms
Finished structural reductions in LTL mode , in 1 iterations and 22026 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND p1 p0), p0, (AND p1 p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-05
Product exploration explored 100000 steps with 1296 reset in 658 ms.
Stack based approach found an accepted trace after 1095 steps with 14 reset with depth 68 and stack size 68 in 9 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-05 finished in 22842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(F(!p0))&&(!p0 U (p1||G(!p0))))))))'
Support contains 151 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 1 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-22 23:46:32] [INFO ] Invariant cache hit.
[2024-05-22 23:46:32] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 23:46:32] [INFO ] Invariant cache hit.
[2024-05-22 23:46:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:46:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:46:32] [INFO ] Invariant cache hit.
[2024-05-22 23:46:32] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9877 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11557 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]
After SMT, in 21621ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21625ms
Finished structural reductions in LTL mode , in 1 iterations and 21803 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 4719 reset in 2949 ms.
Stuttering criterion allowed to conclude after 20195 steps with 952 reset in 595 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-07 finished in 25463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((p0||(X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))) U (G((p0||(X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))))||(X(!p2)&&(p0||(X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))))))))))'
Support contains 7 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.
[2024-05-22 23:46:57] [INFO ] Invariant cache hit.
[2024-05-22 23:46:57] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 23:46:57] [INFO ] Invariant cache hit.
[2024-05-22 23:46:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:46:57] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:46:58] [INFO ] Invariant cache hit.
[2024-05-22 23:46:58] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9637 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11225 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]
After SMT, in 21057ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21060ms
Finished structural reductions in LTL mode , in 1 iterations and 21354 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-08
Product exploration explored 100000 steps with 24598 reset in 249 ms.
Product exploration explored 100000 steps with 24602 reset in 261 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 (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 250 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
RANDOM walk for 40000 steps (633 resets) in 909 ms. (43 steps per ms) remains 3/12 properties
BEST_FIRST walk for 22721 steps (5 resets) in 88 ms. (255 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 646 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Support contains 7 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.
[2024-05-22 23:47:22] [INFO ] Invariant cache hit.
[2024-05-22 23:47:22] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 23:47:22] [INFO ] Invariant cache hit.
[2024-05-22 23:47:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:47:22] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:47:22] [INFO ] Invariant cache hit.
[2024-05-22 23:47:22] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9680 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11368 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]
After SMT, in 21231ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21235ms
Finished structural reductions in LTL mode , in 1 iterations and 21533 ms. Remains : 206/206 places, 325/325 transitions.
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 (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 288 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
RANDOM walk for 40000 steps (645 resets) in 661 ms. (60 steps per ms) remains 6/12 properties
BEST_FIRST walk for 27521 steps (13 resets) in 57 ms. (474 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 595 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Product exploration explored 100000 steps with 24578 reset in 277 ms.
Product exploration explored 100000 steps with 24610 reset in 272 ms.
Support contains 7 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.
[2024-05-22 23:47:47] [INFO ] Invariant cache hit.
[2024-05-22 23:47:47] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 23:47:47] [INFO ] Invariant cache hit.
[2024-05-22 23:47:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:47:47] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:47:47] [INFO ] Invariant cache hit.
[2024-05-22 23:47:47] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9807 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11592 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]
After SMT, in 21582ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21585ms
Finished structural reductions in LTL mode , in 1 iterations and 21918 ms. Remains : 206/206 places, 325/325 transitions.
Treatment of property CSRepetitions-PT-05-LTLFireability-08 finished in 71680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
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 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-22 23:48:09] [INFO ] Invariant cache hit.
[2024-05-22 23:48:09] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 23:48:09] [INFO ] Invariant cache hit.
[2024-05-22 23:48:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:48:09] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:48:09] [INFO ] Invariant cache hit.
[2024-05-22 23:48:09] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9940 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11345 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]
After SMT, in 21477ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21485ms
Finished structural reductions in LTL mode , in 1 iterations and 21774 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-09
Entered a terminal (fully accepting) state of product in 61 steps with 30 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-09 finished in 21943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&G(p2)&&X(p3)&&p0)))'
Support contains 7 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.
[2024-05-22 23:48:31] [INFO ] Invariant cache hit.
[2024-05-22 23:48:31] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 23:48:31] [INFO ] Invariant cache hit.
[2024-05-22 23:48:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:48:31] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:48:31] [INFO ] Invariant cache hit.
[2024-05-22 23:48:31] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9915 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11203 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]
After SMT, in 21313ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21316ms
Finished structural reductions in LTL mode , in 1 iterations and 21626 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (AND p2 (NOT p3))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-10 finished in 21908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(F(p0))||(F(p0)&&G(F(!p1)))) U p2))))'
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 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 0 with 66 rules applied. Total rules applied 66 place count 162 transition count 303
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 171 place count 57 transition count 198
Iterating global reduction 0 with 105 rules applied. Total rules applied 276 place count 57 transition count 198
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 294 place count 39 transition count 90
Iterating global reduction 0 with 18 rules applied. Total rules applied 312 place count 39 transition count 90
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 330 place count 39 transition count 72
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 340 place count 34 transition count 67
Applied a total of 340 rules in 40 ms. Remains 34 /206 variables (removed 172) and now considering 67/325 (removed 258) transitions.
[2024-05-22 23:48:53] [INFO ] Flow matrix only has 51 transitions (discarded 16 similar events)
// Phase 1: matrix 51 rows 34 cols
[2024-05-22 23:48:53] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 23:48:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 23:48:53] [INFO ] Flow matrix only has 51 transitions (discarded 16 similar events)
[2024-05-22 23:48:53] [INFO ] Invariant cache hit.
[2024-05-22 23:48:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 23:48:53] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-22 23:48:53] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-22 23:48:53] [INFO ] Flow matrix only has 51 transitions (discarded 16 similar events)
[2024-05-22 23:48:53] [INFO ] Invariant cache hit.
[2024-05-22 23:48:53] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/34 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 51/85 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 45 constraints, problems are : Problem set: 0 solved, 60 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/34 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 51/85 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 60/105 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 105 constraints, problems are : Problem set: 0 solved, 60 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1150ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1151ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/206 places, 67/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1280 ms. Remains : 34/206 places, 67/325 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-11
Stuttering criterion allowed to conclude after 98 steps with 3 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-11 finished in 1533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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 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 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 322 place count 23 transition count 66
Iterating global reduction 0 with 20 rules applied. Total rules applied 342 place count 23 transition count 66
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 362 place count 23 transition count 46
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 372 place count 18 transition count 41
Applied a total of 372 rules in 14 ms. Remains 18 /206 variables (removed 188) and now considering 41/325 (removed 284) transitions.
[2024-05-22 23:48:54] [INFO ] Flow matrix only has 25 transitions (discarded 16 similar events)
// Phase 1: matrix 25 rows 18 cols
[2024-05-22 23:48:54] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 23:48:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 23:48:54] [INFO ] Flow matrix only has 25 transitions (discarded 16 similar events)
[2024-05-22 23:48:54] [INFO ] Invariant cache hit.
[2024-05-22 23:48:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:48:54] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-22 23:48:54] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-22 23:48:54] [INFO ] Flow matrix only has 25 transitions (discarded 16 similar events)
[2024-05-22 23:48:54] [INFO ] Invariant cache hit.
[2024-05-22 23:48:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 25/43 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 25 constraints, problems are : Problem set: 0 solved, 36 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 25/43 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 36/61 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 61 constraints, problems are : Problem set: 0 solved, 36 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 474ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/206 places, 41/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 557 ms. Remains : 18/206 places, 41/325 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-12
Product exploration explored 100000 steps with 4167 reset in 176 ms.
Stack based approach found an accepted trace after 45 steps with 1 reset with depth 12 and stack size 11 in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-12 finished in 827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 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
[2024-05-22 23:48:55] [INFO ] Computed 30 invariants in 2 ms
[2024-05-22 23:48:55] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 23:48:55] [INFO ] Invariant cache hit.
[2024-05-22 23:48:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 23:48:55] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-22 23:48:55] [INFO ] Invariant cache hit.
[2024-05-22 23:48:55] [INFO ] State equation strengthened by 25 read => feed constraints.
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 9770 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]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
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 11162 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]
After SMT, in 21117ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21121ms
Finished structural reductions in LTL mode , in 1 iterations and 21435 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 136 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-13
Entered a terminal (fully accepting) state of product in 1 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 21594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G(F(p2)))))'
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 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 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 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 307 place count 32 transition count 84
Iterating global reduction 0 with 18 rules applied. Total rules applied 325 place count 32 transition count 84
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 343 place count 32 transition count 66
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 351 place count 28 transition count 62
Applied a total of 351 rules in 20 ms. Remains 28 /206 variables (removed 178) and now considering 62/325 (removed 263) transitions.
[2024-05-22 23:49:17] [INFO ] Flow matrix only has 47 transitions (discarded 15 similar events)
// Phase 1: matrix 47 rows 28 cols
[2024-05-22 23:49:17] [INFO ] Computed 7 invariants in 0 ms
[2024-05-22 23:49:17] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 23:49:17] [INFO ] Flow matrix only has 47 transitions (discarded 15 similar events)
[2024-05-22 23:49:17] [INFO ] Invariant cache hit.
[2024-05-22 23:49:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:49:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-22 23:49:17] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-22 23:49:17] [INFO ] Flow matrix only has 47 transitions (discarded 15 similar events)
[2024-05-22 23:49:17] [INFO ] Invariant cache hit.
[2024-05-22 23:49:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 47/75 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 37 constraints, problems are : Problem set: 0 solved, 55 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 47/75 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 92 constraints, problems are : Problem set: 0 solved, 55 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 885ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 886ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/206 places, 62/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 977 ms. Remains : 28/206 places, 62/325 transitions.
Stuttering acceptance computed with spot in 78 ms :[(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-14
Product exploration explored 100000 steps with 14595 reset in 138 ms.
Stack based approach found an accepted trace after 121 steps with 16 reset with depth 6 and stack size 6 in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-14 finished in 1296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((p0||(X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))) U (G((p0||(X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))))||(X(!p2)&&(p0||(X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))))))))))'
[2024-05-22 23:49:18] [INFO ] Flatten gal took : 19 ms
[2024-05-22 23:49:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-22 23:49:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 206 places, 325 transitions and 1175 arcs took 5 ms.
Total runtime 303398 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CSRepetitions-PT-05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/404/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 206
TRANSITIONS: 325
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.002s]


SAVING FILE /home/mcc/execution/404/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1379
MODEL NAME: /home/mcc/execution/404/model
206 places, 325 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716423086763

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
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 r069-tall-171620504100252"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;