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.r550-tall-171734898500059.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 itstools
Input is CO4-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898500059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 138K Jun 2 16:33 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 CO4-PT-08-LTLCardinality-00
FORMULA_NAME CO4-PT-08-LTLCardinality-01
FORMULA_NAME CO4-PT-08-LTLCardinality-02
FORMULA_NAME CO4-PT-08-LTLCardinality-03
FORMULA_NAME CO4-PT-08-LTLCardinality-04
FORMULA_NAME CO4-PT-08-LTLCardinality-05
FORMULA_NAME CO4-PT-08-LTLCardinality-06
FORMULA_NAME CO4-PT-08-LTLCardinality-07
FORMULA_NAME CO4-PT-08-LTLCardinality-08
FORMULA_NAME CO4-PT-08-LTLCardinality-09
FORMULA_NAME CO4-PT-08-LTLCardinality-10
FORMULA_NAME CO4-PT-08-LTLCardinality-11
FORMULA_NAME CO4-PT-08-LTLCardinality-12
FORMULA_NAME CO4-PT-08-LTLCardinality-13
FORMULA_NAME CO4-PT-08-LTLCardinality-14
FORMULA_NAME CO4-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717351561136

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 18:06:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:06:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:02] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-02 18:06:02] [INFO ] Transformed 467 places.
[2024-06-02 18:06:02] [INFO ] Transformed 600 transitions.
[2024-06-02 18:06:02] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:02] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 108 places in 12 ms
Reduce places removed 108 places and 155 transitions.
FORMULA CO4-PT-08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 347 transition count 444
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 87 place count 273 transition count 368
Iterating global reduction 1 with 74 rules applied. Total rules applied 161 place count 273 transition count 368
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 166 place count 273 transition count 363
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 198 place count 241 transition count 316
Iterating global reduction 2 with 32 rules applied. Total rules applied 230 place count 241 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 232 place count 241 transition count 314
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 237 transition count 308
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 237 transition count 308
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 241 place count 236 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 236 transition count 307
Applied a total of 242 rules in 81 ms. Remains 236 /359 variables (removed 123) and now considering 307/445 (removed 138) transitions.
// Phase 1: matrix 307 rows 236 cols
[2024-06-02 18:06:02] [INFO ] Computed 6 invariants in 8 ms
[2024-06-02 18:06:02] [INFO ] Implicit Places using invariants in 215 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 243 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/359 places, 307/445 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 343 ms. Remains : 235/359 places, 307/445 transitions.
Support contains 26 out of 235 places after structural reductions.
[2024-06-02 18:06:03] [INFO ] Flatten gal took : 42 ms
[2024-06-02 18:06:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:06:03] [INFO ] Input system was already deterministic with 307 transitions.
RANDOM walk for 40000 steps (232 resets) in 1425 ms. (28 steps per ms) remains 14/16 properties
BEST_FIRST walk for 40000 steps (156 resets) in 415 ms. (96 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40000 steps (31 resets) in 431 ms. (92 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (148 resets) in 143 ms. (277 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40001 steps (179 resets) in 536 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (257 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (281 resets) in 92 ms. (430 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40001 steps (212 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (179 resets) in 93 ms. (425 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (274 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (129 resets) in 238 ms. (167 steps per ms) remains 9/9 properties
// Phase 1: matrix 307 rows 235 cols
[2024-06-02 18:06:04] [INFO ] Computed 5 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/40 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 94/134 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 214/348 variables, 83/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 154/502 variables, 85/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 34/536 variables, 23/236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 6/542 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 18:06:05] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 20 ms to minimize.
[2024-06-02 18:06:05] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/542 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 242 constraints, problems are : Problem set: 0 solved, 9 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/40 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 94/134 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 214/348 variables, 83/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 9/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 154/502 variables, 85/223 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 34/536 variables, 23/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 6/542 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/542 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/542 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 251 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 2136ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Finished Parikh walk after 12182 steps, including 213 resets, run visited all 1 properties in 22 ms. (steps per millisecond=553 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 351 ms.
FORMULA CO4-PT-08-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17 stabilizing places and 26 stable transitions
Graph (complete) has 434 edges and 235 vertex of which 231 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 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((G(F(p0)) U G(p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 219 transition count 289
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 219 transition count 289
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 209 transition count 276
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 209 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 209 transition count 275
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 206 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 206 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 204 transition count 270
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 204 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 204 transition count 268
Applied a total of 65 rules in 24 ms. Remains 204 /235 variables (removed 31) and now considering 268/307 (removed 39) transitions.
// Phase 1: matrix 268 rows 204 cols
[2024-06-02 18:06:07] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:06:07] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:06:07] [INFO ] Invariant cache hit.
[2024-06-02 18:06:07] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-06-02 18:06:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 18:06:09] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:06:09] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:06:10] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/212 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 18:06:12] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:06:12] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 214 constraints, problems are : Problem set: 0 solved, 267 unsolved in 11318 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 267/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 481 constraints, problems are : Problem set: 0 solved, 267 unsolved in 10825 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints]
After SMT, in 22215ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 22220ms
Starting structural reductions in LTL mode, iteration 1 : 204/235 places, 268/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22423 ms. Remains : 204/235 places, 268/307 transitions.
Stuttering acceptance computed with spot in 360 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-00
Product exploration explored 100000 steps with 24 reset in 196 ms.
Product exploration explored 100000 steps with 62 reset in 124 ms.
Computed a total of 14 stabilizing places and 21 stable transitions
Graph (complete) has 385 edges and 204 vertex of which 201 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (163 resets) in 290 ms. (137 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (190 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (138 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (160 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
[2024-06-02 18:06:31] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/96 variables, 30/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 193/289 variables, 67/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 147/436 variables, 85/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/466 variables, 18/205 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/472 variables, 4/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/472 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 209 constraints, problems are : Problem set: 1 solved, 2 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 18:06:31] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 66/96 variables, 30/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 193/289 variables, 67/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 2/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 147/436 variables, 85/190 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 30/466 variables, 18/208 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/472 variables, 4/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/472 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 212 constraints, problems are : Problem set: 1 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 365ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 268/268 transitions.
Graph (trivial) has 209 edges and 204 vertex of which 2 / 204 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 383 edges and 203 vertex of which 187 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 187 transition count 173
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 149 place count 121 transition count 171
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 149 place count 121 transition count 148
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 195 place count 98 transition count 148
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 236 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 197 place count 97 transition count 147
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 199 place count 97 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 200 place count 96 transition count 145
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 202 place count 94 transition count 143
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 94 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 206 place count 94 transition count 141
Performed 30 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 266 place count 64 transition count 107
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 275 place count 64 transition count 98
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 280 place count 59 transition count 93
Iterating global reduction 7 with 5 rules applied. Total rules applied 285 place count 59 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 286 place count 59 transition count 92
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 8 with 10 rules applied. Total rules applied 296 place count 54 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 302 place count 54 transition count 81
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 305 place count 51 transition count 78
Iterating global reduction 9 with 3 rules applied. Total rules applied 308 place count 51 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 309 place count 51 transition count 77
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 310 place count 50 transition count 76
Iterating global reduction 10 with 1 rules applied. Total rules applied 311 place count 50 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 312 place count 50 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 314 place count 49 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 315 place count 49 transition count 73
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 316 place count 48 transition count 72
Iterating global reduction 12 with 1 rules applied. Total rules applied 317 place count 48 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 318 place count 48 transition count 71
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 13 with 18 rules applied. Total rules applied 336 place count 39 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 13 with 15 rules applied. Total rules applied 351 place count 39 transition count 57
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 359 place count 31 transition count 49
Iterating global reduction 14 with 8 rules applied. Total rules applied 367 place count 31 transition count 49
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 373 place count 31 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 375 place count 30 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 15 with 13 rules applied. Total rules applied 388 place count 30 transition count 41
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 389 place count 29 transition count 40
Iterating global reduction 15 with 1 rules applied. Total rules applied 390 place count 29 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 394 place count 29 transition count 36
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 401 place count 29 transition count 29
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 409 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 410 place count 21 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 412 place count 19 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 416 place count 17 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 417 place count 17 transition count 24
Applied a total of 417 rules in 46 ms. Remains 17 /204 variables (removed 187) and now considering 24/268 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 17/204 places, 24/268 transitions.
RANDOM walk for 43 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 268/268 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-02 18:06:32] [INFO ] Invariant cache hit.
[2024-06-02 18:06:32] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:06:32] [INFO ] Invariant cache hit.
[2024-06-02 18:06:32] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-06-02 18:06:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 18:06:34] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:06:34] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:06:35] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/212 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 18:06:37] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:06:37] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 214 constraints, problems are : Problem set: 0 solved, 267 unsolved in 11356 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/472 variables, 204/214 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 267/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 481 constraints, problems are : Problem set: 0 solved, 267 unsolved in 10612 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints]
After SMT, in 22036ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 22042ms
Finished structural reductions in LTL mode , in 1 iterations and 22233 ms. Remains : 204/204 places, 268/268 transitions.
Computed a total of 14 stabilizing places and 21 stable transitions
Graph (complete) has 385 edges and 204 vertex of which 201 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (789 resets) in 162 ms. (245 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (252 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2024-06-02 18:06:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/111 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/118 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/134 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 146/280 variables, 67/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 139/419 variables, 75/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 51/470 variables, 32/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/470 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/472 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/472 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/111 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/118 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/134 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 146/280 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 139/419 variables, 75/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 51/470 variables, 32/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/470 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/472 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/472 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 756 steps, including 25 resets, run visited all 1 properties in 2 ms. (steps per millisecond=378 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34 reset in 88 ms.
Product exploration explored 100000 steps with 36 reset in 120 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 268/268 transitions.
Graph (trivial) has 209 edges and 204 vertex of which 2 / 204 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 384 edges and 203 vertex of which 200 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 200 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 200 transition count 262
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 70 place count 200 transition count 280
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 90 place count 200 transition count 280
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 105 place count 185 transition count 265
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 120 place count 185 transition count 265
Performed 31 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 151 place count 185 transition count 281
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 156 place count 185 transition count 276
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 175 place count 166 transition count 255
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 194 place count 166 transition count 255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 166 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 197 place count 166 transition count 253
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 199 place count 164 transition count 251
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 164 transition count 251
Performed 23 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 224 place count 164 transition count 374
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 242 place count 164 transition count 356
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 288 place count 118 transition count 223
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 5 with 46 rules applied. Total rules applied 334 place count 118 transition count 223
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 343 place count 118 transition count 214
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 370 place count 91 transition count 166
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 6 with 27 rules applied. Total rules applied 397 place count 91 transition count 166
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 402 place count 91 transition count 161
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 408 place count 85 transition count 149
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 414 place count 85 transition count 149
Deduced a syphon composed of 42 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 433 place count 85 transition count 130
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 434 place count 84 transition count 129
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 435 place count 84 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 436 place count 84 transition count 149
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 436 rules in 84 ms. Remains 84 /204 variables (removed 120) and now considering 149/268 (removed 119) transitions.
[2024-06-02 18:06:56] [INFO ] Redundant transitions in 4 ms returned []
Running 148 sub problems to find dead transitions.
[2024-06-02 18:06:56] [INFO ] Flow matrix only has 146 transitions (discarded 3 similar events)
// Phase 1: matrix 146 rows 84 cols
[2024-06-02 18:06:56] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:06:56] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 6/11 constraints. Problems are: Problem set: 9 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 9 solved, 139 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 4 (OVERLAPS) 145/229 variables, 84/95 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 14/109 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/109 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/110 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/110 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/110 constraints. Problems are: Problem set: 70 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 110 constraints, problems are : Problem set: 70 solved, 78 unsolved in 2773 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 70 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 10/51 variables, 5/5 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 6/11 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 140/191 variables, 51/62 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 14/76 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 78/154 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/154 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 38/229 variables, 33/187 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/187 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 1/230 variables, 1/188 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/188 constraints. Problems are: Problem set: 70 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/188 constraints. Problems are: Problem set: 70 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 188 constraints, problems are : Problem set: 70 solved, 78 unsolved in 2556 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 78/148 constraints, Known Traps: 6/6 constraints]
After SMT, in 5389ms problems are : Problem set: 70 solved, 78 unsolved
Search for dead transitions found 70 dead transitions in 5390ms
Found 70 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 70 transitions
Dead transitions reduction (with SMT) removed 70 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 84/204 places, 79/268 transitions.
Graph (complete) has 171 edges and 84 vertex of which 42 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 42 /84 variables (removed 42) and now considering 79/79 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/204 places, 79/268 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5503 ms. Remains : 42/204 places, 79/268 transitions.
Built C files in :
/tmp/ltsmin8091474239581074902
[2024-06-02 18:07:02] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8091474239581074902
Running compilation step : cd /tmp/ltsmin8091474239581074902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 582 ms.
Running link step : cd /tmp/ltsmin8091474239581074902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin8091474239581074902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6939158855778766860.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA CO4-PT-08-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLCardinality-00 finished in 55644 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' '!((p0 U X(!p1)))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 217 transition count 284
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 217 transition count 284
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 208 transition count 273
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 208 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 204 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 204 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 204 transition count 267
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 202 transition count 265
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 202 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 202 transition count 263
Applied a total of 70 rules in 21 ms. Remains 202 /235 variables (removed 33) and now considering 263/307 (removed 44) transitions.
// Phase 1: matrix 263 rows 202 cols
[2024-06-02 18:07:03] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:07:03] [INFO ] Implicit Places using invariants in 65 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/235 places, 263/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 201/235 places, 263/307 transitions.
Stuttering acceptance computed with spot in 118 ms :[p1, true, p1, p1]
Running random walk in product with property : CO4-PT-08-LTLCardinality-02
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA CO4-PT-08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-02 finished in 226 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)||G(F(p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 218 transition count 285
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 218 transition count 285
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 208 transition count 273
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 208 transition count 272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 204 transition count 268
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 204 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 204 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 202 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 202 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 202 transition count 263
Applied a total of 70 rules in 20 ms. Remains 202 /235 variables (removed 33) and now considering 263/307 (removed 44) transitions.
// Phase 1: matrix 263 rows 202 cols
[2024-06-02 18:07:03] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:07:03] [INFO ] Implicit Places using invariants in 67 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/235 places, 263/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 201/235 places, 263/307 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-04
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-04 finished in 261 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) U ((!p1&&X(!p0))||X(G(!p0)))) U X(X((G(p2)||F(G(p1)))))))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 219 transition count 286
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 219 transition count 286
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 210 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 210 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 210 transition count 275
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 208 transition count 273
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 208 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 207 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 207 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 207 transition count 270
Applied a total of 59 rules in 13 ms. Remains 207 /235 variables (removed 28) and now considering 270/307 (removed 37) transitions.
// Phase 1: matrix 270 rows 207 cols
[2024-06-02 18:07:03] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:07:03] [INFO ] Implicit Places using invariants in 58 ms returned [141]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 206/235 places, 270/307 transitions.
Applied a total of 0 rules in 1 ms. Remains 206 /206 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 206/235 places, 270/307 transitions.
Stuttering acceptance computed with spot in 481 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-05
Product exploration explored 100000 steps with 13 reset in 67 ms.
Product exploration explored 100000 steps with 21 reset in 95 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 367 edges and 206 vertex of which 203 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 150 ms. Reduced automaton from 11 states, 28 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
RANDOM walk for 31847 steps (290 resets) in 46 ms. (677 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 13 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Support contains 2 out of 206 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 270/270 transitions.
Graph (trivial) has 209 edges and 206 vertex of which 2 / 206 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 366 edges and 205 vertex of which 202 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 201 transition count 200
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 69 rules applied. Total rules applied 136 place count 136 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 138 place count 134 transition count 196
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 138 place count 134 transition count 174
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 182 place count 112 transition count 174
Performed 35 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 252 place count 77 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 257 place count 77 transition count 125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 259 place count 75 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 75 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 265 place count 73 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 267 place count 73 transition count 119
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 293 place count 60 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 299 place count 60 transition count 116
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 308 place count 51 transition count 98
Iterating global reduction 6 with 9 rules applied. Total rules applied 317 place count 51 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 322 place count 51 transition count 93
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 323 place count 50 transition count 90
Iterating global reduction 7 with 1 rules applied. Total rules applied 324 place count 50 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 326 place count 49 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 335 place count 49 transition count 93
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 336 place count 49 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 338 place count 47 transition count 91
Applied a total of 338 rules in 31 ms. Remains 47 /206 variables (removed 159) and now considering 91/270 (removed 179) transitions.
[2024-06-02 18:07:04] [INFO ] Flow matrix only has 85 transitions (discarded 6 similar events)
// Phase 1: matrix 85 rows 47 cols
[2024-06-02 18:07:04] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:07:05] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-02 18:07:05] [INFO ] Flow matrix only has 85 transitions (discarded 6 similar events)
[2024-06-02 18:07:05] [INFO ] Invariant cache hit.
[2024-06-02 18:07:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:07:05] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-02 18:07:05] [INFO ] Redundant transitions in 2 ms returned []
Running 76 sub problems to find dead transitions.
[2024-06-02 18:07:05] [INFO ] Flow matrix only has 85 transitions (discarded 6 similar events)
[2024-06-02 18:07:05] [INFO ] Invariant cache hit.
[2024-06-02 18:07:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 84/131 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 1/132 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 52 constraints, problems are : Problem set: 0 solved, 76 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 84/131 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 76/127 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 1/132 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 128 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 2209ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2209ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/206 places, 91/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2466 ms. Remains : 47/206 places, 91/270 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
RANDOM walk for 974 steps (114 resets) in 17 ms. (54 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Product exploration explored 100000 steps with 44 reset in 146 ms.
Product exploration explored 100000 steps with 94 reset in 75 ms.
Built C files in :
/tmp/ltsmin4648357837999977812
[2024-06-02 18:07:07] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2024-06-02 18:07:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:07:07] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2024-06-02 18:07:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:07:07] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2024-06-02 18:07:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:07:07] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4648357837999977812
Running compilation step : cd /tmp/ltsmin4648357837999977812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 213 ms.
Running link step : cd /tmp/ltsmin4648357837999977812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4648357837999977812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6556496478229680663.hoa' '--buchi-type=spotba'
LTSmin run took 200 ms.
FORMULA CO4-PT-08-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLCardinality-05 finished in 4775 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(F(!p0))||(F(!p0)&&X(!p1)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 219 transition count 286
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 219 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 212 transition count 278
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 212 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 209 transition count 275
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 209 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 209 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 208 transition count 273
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 208 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 208 transition count 272
Applied a total of 56 rules in 8 ms. Remains 208 /235 variables (removed 27) and now considering 272/307 (removed 35) transitions.
// Phase 1: matrix 272 rows 208 cols
[2024-06-02 18:07:08] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:07:08] [INFO ] Implicit Places using invariants in 57 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 207/235 places, 272/307 transitions.
Applied a total of 0 rules in 1 ms. Remains 207 /207 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 207/235 places, 272/307 transitions.
Stuttering acceptance computed with spot in 132 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : CO4-PT-08-LTLCardinality-10
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-10 finished in 230 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(X((F(p0)||G(p1))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 217 transition count 285
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 217 transition count 285
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 207 transition count 273
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 207 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 207 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 203 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 203 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 203 transition count 267
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 201 transition count 265
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 201 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 201 transition count 263
Applied a total of 72 rules in 23 ms. Remains 201 /235 variables (removed 34) and now considering 263/307 (removed 44) transitions.
// Phase 1: matrix 263 rows 201 cols
[2024-06-02 18:07:08] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:07:08] [INFO ] Implicit Places using invariants in 76 ms returned [137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/235 places, 263/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 200/235 places, 263/307 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-08-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 152 ms.
Product exploration explored 100000 steps with 25000 reset in 126 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 360 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (467 resets) in 80 ms. (493 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (210 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
// Phase 1: matrix 263 rows 200 cols
[2024-06-02 18:07:09] [INFO ] Computed 4 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/277 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/424 variables, 83/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/454 variables, 19/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/463 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/277 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 147/424 variables, 83/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/454 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/463 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 263ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 38 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-06-02 18:07:10] [INFO ] Invariant cache hit.
[2024-06-02 18:07:10] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:07:10] [INFO ] Invariant cache hit.
[2024-06-02 18:07:10] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 18:07:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 18:07:12] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:07:12] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/206 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-02 18:07:15] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 207 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10679 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 262/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 469 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10625 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
After SMT, in 21354ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 21357ms
Finished structural reductions in LTL mode , in 1 iterations and 21521 ms. Remains : 200/200 places, 263/263 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 360 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (310 resets) in 151 ms. (263 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (107 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (172 resets) in 87 ms. (454 steps per ms) remains 1/3 properties
[2024-06-02 18:07:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/277 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/424 variables, 83/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/454 variables, 19/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/463 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/277 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 147/424 variables, 83/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:07:32] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/454 variables, 19/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/463 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/463 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 306ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 92 ms.
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 263/263 transitions.
Graph (trivial) has 207 edges and 200 vertex of which 2 / 200 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 359 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 196 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 196 transition count 257
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 69 place count 196 transition count 276
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 89 place count 196 transition count 276
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 105 place count 180 transition count 260
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 121 place count 180 transition count 260
Performed 31 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 152 place count 180 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 158 place count 180 transition count 275
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 174 place count 164 transition count 257
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 190 place count 164 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 164 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 193 place count 164 transition count 255
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 196 place count 161 transition count 252
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 199 place count 161 transition count 252
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 222 place count 161 transition count 343
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 244 place count 161 transition count 321
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 289 place count 116 transition count 217
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 5 with 45 rules applied. Total rules applied 334 place count 116 transition count 217
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 344 place count 116 transition count 207
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 373 place count 87 transition count 153
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 402 place count 87 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 405 place count 87 transition count 150
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 411 place count 81 transition count 138
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 417 place count 81 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 418 place count 81 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 421 place count 81 transition count 150
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 424 place count 78 transition count 132
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 427 place count 78 transition count 132
Deduced a syphon composed of 39 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 437 place count 78 transition count 122
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 437 rules in 43 ms. Remains 78 /200 variables (removed 122) and now considering 122/263 (removed 141) transitions.
[2024-06-02 18:07:34] [INFO ] Redundant transitions in 2 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-02 18:07:34] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
// Phase 1: matrix 118 rows 78 cols
[2024-06-02 18:07:34] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:07:34] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-02 18:07:34] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:07:34] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-02 18:07:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-02 18:07:34] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 4/8 constraints. Problems are: Problem set: 9 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 112 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 4 (OVERLAPS) 117/195 variables, 78/86 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 13/99 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/99 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/196 variables, 1/100 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/100 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/100 constraints. Problems are: Problem set: 62 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 100 constraints, problems are : Problem set: 62 solved, 59 unsolved in 1944 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 62 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 10/48 variables, 4/4 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 4/8 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 112/160 variables, 48/56 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 13/69 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 59/128 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/128 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 35/195 variables, 30/158 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/158 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/159 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/159 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/159 constraints. Problems are: Problem set: 62 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 159 constraints, problems are : Problem set: 62 solved, 59 unsolved in 1498 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 59/121 constraints, Known Traps: 4/4 constraints]
After SMT, in 3470ms problems are : Problem set: 62 solved, 59 unsolved
Search for dead transitions found 62 dead transitions in 3472ms
Found 62 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 62 transitions
Dead transitions reduction (with SMT) removed 62 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/200 places, 60/263 transitions.
Graph (complete) has 127 edges and 78 vertex of which 39 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 39 /78 variables (removed 39) and now considering 76/60 (removed -16) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/200 places, 76/263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3531 ms. Remains : 39/200 places, 76/263 transitions.
Built C files in :
/tmp/ltsmin2278499678842237869
[2024-06-02 18:07:37] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2278499678842237869
Running compilation step : cd /tmp/ltsmin2278499678842237869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 431 ms.
Running link step : cd /tmp/ltsmin2278499678842237869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2278499678842237869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11533570812875116847.hoa' '--buchi-type=spotba'
LTSmin run took 177 ms.
FORMULA CO4-PT-08-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLCardinality-12 finished in 29660 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||F(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 307/307 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 306
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 217 transition count 284
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 217 transition count 284
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 207 transition count 272
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 207 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 207 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 203 transition count 267
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 203 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 203 transition count 266
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 201 transition count 264
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 201 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 201 transition count 262
Applied a total of 72 rules in 12 ms. Remains 201 /235 variables (removed 34) and now considering 262/307 (removed 45) transitions.
// Phase 1: matrix 262 rows 201 cols
[2024-06-02 18:07:38] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:07:38] [INFO ] Implicit Places using invariants in 60 ms returned [139]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/235 places, 262/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 200/235 places, 262/307 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-08-LTLCardinality-13
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-13 finished in 216 ms.
All properties solved by simple procedures.
Total runtime 96243 ms.

BK_STOP 1717351658589

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898500059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-08.tgz
mv CO4-PT-08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;