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-171734898500067.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-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898500067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K 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.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 152K 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-09-LTLCardinality-00
FORMULA_NAME CO4-PT-09-LTLCardinality-01
FORMULA_NAME CO4-PT-09-LTLCardinality-02
FORMULA_NAME CO4-PT-09-LTLCardinality-03
FORMULA_NAME CO4-PT-09-LTLCardinality-04
FORMULA_NAME CO4-PT-09-LTLCardinality-05
FORMULA_NAME CO4-PT-09-LTLCardinality-06
FORMULA_NAME CO4-PT-09-LTLCardinality-07
FORMULA_NAME CO4-PT-09-LTLCardinality-08
FORMULA_NAME CO4-PT-09-LTLCardinality-09
FORMULA_NAME CO4-PT-09-LTLCardinality-10
FORMULA_NAME CO4-PT-09-LTLCardinality-11
FORMULA_NAME CO4-PT-09-LTLCardinality-12
FORMULA_NAME CO4-PT-09-LTLCardinality-13
FORMULA_NAME CO4-PT-09-LTLCardinality-14
FORMULA_NAME CO4-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717351638183

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 18:07:19] [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:07:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:07:19] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-02 18:07:19] [INFO ] Transformed 467 places.
[2024-06-02 18:07:19] [INFO ] Transformed 634 transitions.
[2024-06-02 18:07:19] [INFO ] Found NUPN structural information;
[2024-06-02 18:07:19] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 108 places in 13 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 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 470
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 91 place count 269 transition count 390
Iterating global reduction 1 with 78 rules applied. Total rules applied 169 place count 269 transition count 390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 173 place count 269 transition count 386
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 210 place count 232 transition count 328
Iterating global reduction 2 with 37 rules applied. Total rules applied 247 place count 232 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 249 place count 232 transition count 326
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 255 place count 226 transition count 316
Iterating global reduction 3 with 6 rules applied. Total rules applied 261 place count 226 transition count 316
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 265 place count 222 transition count 312
Iterating global reduction 3 with 4 rules applied. Total rules applied 269 place count 222 transition count 312
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 221 transition count 311
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 221 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 272 place count 221 transition count 310
Applied a total of 272 rules in 83 ms. Remains 221 /359 variables (removed 138) and now considering 310/471 (removed 161) transitions.
// Phase 1: matrix 310 rows 221 cols
[2024-06-02 18:07:19] [INFO ] Computed 6 invariants in 21 ms
[2024-06-02 18:07:20] [INFO ] Implicit Places using invariants in 235 ms returned [5, 145]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 262 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 219/359 places, 310/471 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 365 ms. Remains : 219/359 places, 310/471 transitions.
Support contains 17 out of 219 places after structural reductions.
[2024-06-02 18:07:20] [INFO ] Flatten gal took : 48 ms
[2024-06-02 18:07:20] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:07:20] [INFO ] Input system was already deterministic with 310 transitions.
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (172 resets) in 1143 ms. (34 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40003 steps (310 resets) in 131 ms. (303 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40000 steps (130 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (205 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (129 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (199 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
// Phase 1: matrix 310 rows 219 cols
[2024-06-02 18:07:21] [INFO ] Computed 4 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 125/150 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/158 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/174 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 222/396 variables, 110/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 114/510 variables, 69/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 14/524 variables, 9/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 5/529 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/529 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 223 constraints, problems are : Problem set: 0 solved, 4 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 125/150 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 8/158 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/174 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 222/396 variables, 110/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 114/510 variables, 69/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/524 variables, 9/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 5/529 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/529 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 529/529 variables, and 227 constraints, problems are : Problem set: 0 solved, 4 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 825ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 3376 steps, including 105 resets, run visited all 4 properties in 17 ms. (steps per millisecond=198 )
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 2 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 26 ms.
Computed a total of 14 stabilizing places and 20 stable transitions
Graph (complete) has 476 edges and 219 vertex of which 214 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 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((X((G(p1)||(p2 U p3)))||p0))||G(p4))))'
Support contains 6 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 310/310 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 218 transition count 309
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 212 transition count 302
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 212 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 212 transition count 301
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 209 transition count 296
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 209 transition count 296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 207 transition count 294
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 207 transition count 294
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 205 transition count 292
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 205 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 205 transition count 290
Applied a total of 31 rules in 16 ms. Remains 205 /219 variables (removed 14) and now considering 290/310 (removed 20) transitions.
// Phase 1: matrix 290 rows 205 cols
[2024-06-02 18:07:22] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:07:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:07:22] [INFO ] Invariant cache hit.
[2024-06-02 18:07:22] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-06-02 18:07:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 18:07:24] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 8 ms to minimize.
[2024-06-02 18:07:24] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:07:25] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 18:07:25] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 18:07:28] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 290/495 variables, 205/214 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 0/495 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 214 constraints, problems are : Problem set: 0 solved, 289 unsolved in 13055 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 18:07:36] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 290/495 variables, 205/215 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 289/504 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 0/495 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 504 constraints, problems are : Problem set: 0 solved, 289 unsolved in 13568 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 6/6 constraints]
After SMT, in 26779ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 26785ms
Starting structural reductions in LTL mode, iteration 1 : 205/219 places, 290/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27006 ms. Remains : 205/219 places, 290/310 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : CO4-PT-09-LTLCardinality-01
Product exploration explored 100000 steps with 85 reset in 205 ms.
Product exploration explored 100000 steps with 59 reset in 106 ms.
Computed a total of 14 stabilizing places and 20 stable transitions
Graph (complete) has 455 edges and 205 vertex of which 202 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p4 p0 (NOT p1) p3 p2), (X (NOT p2)), (X (NOT (AND p4 (NOT p1) (NOT p3) (NOT p2)))), (X p3), (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p4 (NOT p1) (NOT p3) p2))), (X p4), (X (NOT (AND p4 p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p4) p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) p2))), (X (NOT (AND p4 (NOT p0)))), (X (NOT (AND p4 p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p4) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p4 (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p0) p1 (NOT p3)))), (X (NOT (AND p4 (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p4 p1)))), (X (X (NOT (AND p4 (NOT p1) (NOT p3) (NOT p2))))), (X (X p3)), (X (X p4)), (X (X (NOT (AND (NOT p4) p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) p2)))), (X (X (AND p4 (NOT p1)))), (X (X (NOT (AND p4 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (NOT (AND p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p4 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND p4 (NOT p0) p1)))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p4 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p3))))), (X (X (NOT (AND p4 p0 p1 (NOT p3) p2)))), (X (X (NOT (AND p4 (NOT p0) (NOT p3))))), (X (X (NOT (AND p4 (NOT p0))))), (X (X (NOT (AND (NOT p4) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p0) p1)))), (X (X (NOT (AND p4 (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1))))), (X (X (NOT (AND p4 (NOT p3) p2)))), (X (X (NOT (AND p4 (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 52 factoid took 329 ms. Reduced automaton from 4 states, 30 edges and 5 AP (stutter sensitive) to 4 states, 30 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))]
Reduction of identical properties reduced properties to check from 33 to 29
RANDOM walk for 40000 steps (395 resets) in 514 ms. (77 steps per ms) remains 23/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (24 resets) in 57 ms. (68 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (30 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (31 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (30 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (27 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (31 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (24 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (29 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (23 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (37 resets) in 26 ms. (148 steps per ms) remains 18/23 properties
BEST_FIRST walk for 4001 steps (27 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (31 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (30 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
[2024-06-02 18:07:50] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf8 is UNSAT
Problem apf29 is UNSAT
Problem apf31 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 10/30 variables, 2/4 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 88/118 variables, 30/34 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 188/306 variables, 66/100 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/100 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 151/457 variables, 86/186 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/186 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 29/486 variables, 18/204 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/204 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 9/495 variables, 5/209 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/495 variables, 0/209 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/495 variables, 0/209 constraints. Problems are: Problem set: 4 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 209 constraints, problems are : Problem set: 4 solved, 14 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 14/20 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 10/30 variables, 2/4 constraints. Problems are: Problem set: 6 solved, 12 unsolved
[2024-06-02 18:07:51] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 2 ms to minimize.
[2024-06-02 18:07:51] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 2/6 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 88/118 variables, 30/36 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/36 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 188/306 variables, 66/102 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 12/114 constraints. Problems are: Problem set: 6 solved, 12 unsolved
[2024-06-02 18:07:51] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 1/115 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 151/457 variables, 86/201 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 0/201 constraints. Problems are: Problem set: 6 solved, 12 unsolved
Problem apf4 is UNSAT
Problem apf10 is UNSAT
Problem apf11 is UNSAT
Problem apf12 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
Problem apf21 is UNSAT
Problem apf22 is UNSAT
Problem apf27 is UNSAT
Problem apf28 is UNSAT
At refinement iteration 14 (OVERLAPS) 29/486 variables, 18/219 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/486 variables, 0/219 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/495 variables, 5/224 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/495 variables, 0/224 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/495 variables, 0/224 constraints. Problems are: Problem set: 16 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 224 constraints, problems are : Problem set: 16 solved, 2 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 12/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 1408ms problems are : Problem set: 16 solved, 2 unsolved
Parikh walk visited 1 properties in 24 ms.
Support contains 5 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 290/290 transitions.
Graph (trivial) has 209 edges and 205 vertex of which 2 / 205 are part of one of the 1 SCC in 2 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 453 edges and 204 vertex of which 188 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 188 transition count 195
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 148 place count 122 transition count 194
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 148 place count 122 transition count 172
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 192 place count 100 transition count 172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 194 place count 98 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 98 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 198 place count 98 transition count 168
Performed 30 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 258 place count 68 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 263 place count 68 transition count 126
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 265 place count 66 transition count 122
Iterating global reduction 4 with 2 rules applied. Total rules applied 267 place count 66 transition count 122
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 4 with 2 rules applied. Total rules applied 269 place count 65 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 270 place count 65 transition count 120
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 302 place count 49 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 308 place count 49 transition count 131
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 318 place count 39 transition count 91
Iterating global reduction 6 with 10 rules applied. Total rules applied 328 place count 39 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 334 place count 39 transition count 85
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 336 place count 37 transition count 73
Iterating global reduction 7 with 2 rules applied. Total rules applied 338 place count 37 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 339 place count 37 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 341 place count 36 transition count 85
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 346 place count 36 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 356 place count 36 transition count 70
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 363 place count 36 transition count 63
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 370 place count 29 transition count 63
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 372 place count 29 transition count 63
Graph (complete) has 112 edges and 29 vertex of which 28 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 10 with 1 rules applied. Total rules applied 373 place count 28 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 375 place count 28 transition count 61
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 376 place count 28 transition count 61
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 378 place count 28 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 379 place count 28 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 380 place count 27 transition count 59
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t95.t259.t92 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 382 place count 24 transition count 57
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 14 with 2 rules applied. Total rules applied 384 place count 23 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 385 place count 23 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 389 place count 23 transition count 51
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 390 place count 22 transition count 48
Iterating global reduction 15 with 1 rules applied. Total rules applied 391 place count 22 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 392 place count 22 transition count 47
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 395 place count 22 transition count 44
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 398 place count 19 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 400 place count 19 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 401 place count 19 transition count 42
Applied a total of 401 rules in 64 ms. Remains 19 /205 variables (removed 186) and now considering 42/290 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 19/205 places, 42/290 transitions.
RANDOM walk for 23522 steps (6 resets) in 124 ms. (188 steps per ms) remains 0/1 properties
Found 16 invariant AP formulas.
Knowledge obtained : [(AND p4 p0 (NOT p1) p3 p2), (X (NOT p2)), (X (NOT (AND p4 (NOT p1) (NOT p3) (NOT p2)))), (X p3), (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p4 (NOT p1) (NOT p3) p2))), (X p4), (X (NOT (AND p4 p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p4) p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) p2))), (X (NOT (AND p4 (NOT p0)))), (X (NOT (AND p4 p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p4) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p4 (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p0) p1 (NOT p3)))), (X (NOT (AND p4 (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p4 p1)))), (X (X (NOT (AND p4 (NOT p1) (NOT p3) (NOT p2))))), (X (X p3)), (X (X p4)), (X (X (NOT (AND (NOT p4) p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) p2)))), (X (X (AND p4 (NOT p1)))), (X (X (NOT (AND p4 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (NOT (AND p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p4 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND p4 (NOT p0) p1)))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p4 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p3))))), (X (X (NOT (AND p4 p0 p1 (NOT p3) p2)))), (X (X (NOT (AND p4 (NOT p0) (NOT p3))))), (X (X (NOT (AND p4 (NOT p0))))), (X (X (NOT (AND (NOT p4) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND (NOT p4) (NOT p0) p1)))), (X (X (NOT (AND p4 (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p1))))), (X (X (NOT (AND p4 (NOT p3) p2)))), (X (X (NOT (AND p4 (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p1 (NOT p2) p3 p4)), (G (OR p2 p3 p4)), (G (OR (NOT p1) (NOT p2) p3 p4 (NOT p0))), (G (OR (NOT p1) p2 p3 p4)), (G (OR (NOT p1) p3 p4 p0)), (G (OR p4 p0)), (G (OR p1 p2 p3 (NOT p4))), (G (OR p1 p3 p4 p0)), (G (OR (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0))), (G (OR p1 p2 p3 p4)), (G (OR (NOT p1) p4 p0)), (G (OR (NOT p2) p3 p4)), (G (OR p1 p4 p0)), (G (OR p3 p4 p0)), (G (OR p2 p3 (NOT p4))), (G (OR (NOT p1) p2 p3 (NOT p4)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT (OR p1 p3 (NOT p4) p0))), (F (NOT (OR p1 p4))), (F (NOT p4)), (F (NOT (OR (NOT p1) p4))), (F (NOT (OR (NOT p1) (NOT p4)))), (F (NOT (AND (NOT p1) p4))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR (NOT p1) (NOT p4) p0))), (F (NOT (OR (NOT p1) p3 (NOT p4) p0))), (F (NOT (OR (NOT p2) p3 (NOT p4)))), (F (NOT (OR p3 (NOT p4) p0))), (F (NOT (OR (NOT p4) p0))), (F (NOT (OR p1 (NOT p2) p3 (NOT p4)))), (F (NOT (OR p1 (NOT p4) p0))), (F p1), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 68 factoid took 31 ms. Reduced automaton from 4 states, 30 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-09-LTLCardinality-01 finished in 30292 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)||X(p1)))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 310/310 transitions.
Graph (trivial) has 228 edges and 219 vertex of which 2 / 219 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 475 edges and 218 vertex of which 214 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 213 transition count 226
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 81 rules applied. Total rules applied 160 place count 136 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 135 transition count 222
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 161 place count 135 transition count 199
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 207 place count 112 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 210 place count 109 transition count 194
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 109 transition count 194
Performed 32 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 277 place count 77 transition count 151
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 284 place count 77 transition count 144
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 286 place count 76 transition count 143
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 288 place count 74 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 290 place count 74 transition count 139
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 5 with 2 rules applied. Total rules applied 292 place count 73 transition count 138
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 328 place count 55 transition count 158
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 336 place count 55 transition count 150
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 346 place count 45 transition count 110
Iterating global reduction 6 with 10 rules applied. Total rules applied 356 place count 45 transition count 110
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 363 place count 45 transition count 103
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 366 place count 42 transition count 85
Iterating global reduction 7 with 3 rules applied. Total rules applied 369 place count 42 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 371 place count 42 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 373 place count 41 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 392 place count 41 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 394 place count 39 transition count 72
Applied a total of 394 rules in 37 ms. Remains 39 /219 variables (removed 180) and now considering 72/310 (removed 238) transitions.
[2024-06-02 18:07:52] [INFO ] Flow matrix only has 65 transitions (discarded 7 similar events)
// Phase 1: matrix 65 rows 39 cols
[2024-06-02 18:07:52] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:07:52] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-02 18:07:52] [INFO ] Flow matrix only has 65 transitions (discarded 7 similar events)
[2024-06-02 18:07:52] [INFO ] Invariant cache hit.
[2024-06-02 18:07:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:07:52] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-02 18:07:52] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-06-02 18:07:52] [INFO ] Flow matrix only has 65 transitions (discarded 7 similar events)
[2024-06-02 18:07:52] [INFO ] Invariant cache hit.
[2024-06-02 18:07:52] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 64/102 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 1/104 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 45 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1262 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 64/102 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 45/88 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 1/104 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 101 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 2350ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2351ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/219 places, 72/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2596 ms. Remains : 39/219 places, 72/310 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-09-LTLCardinality-04
Stuttering criterion allowed to conclude after 18 steps with 1 reset in 0 ms.
FORMULA CO4-PT-09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLCardinality-04 finished in 2693 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(G(p0)))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 310/310 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 218 transition count 309
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 209 transition count 298
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 209 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 209 transition count 297
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 26 place count 204 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 31 place count 204 transition count 290
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 201 transition count 287
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 201 transition count 287
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 199 transition count 285
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 199 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 199 transition count 283
Applied a total of 43 rules in 8 ms. Remains 199 /219 variables (removed 20) and now considering 283/310 (removed 27) transitions.
// Phase 1: matrix 283 rows 199 cols
[2024-06-02 18:07:55] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:07:55] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:07:55] [INFO ] Invariant cache hit.
[2024-06-02 18:07:55] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-06-02 18:07:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 18:07:57] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:07:57] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:07:57] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 283/482 variables, 199/206 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 206 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9713 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 283/482 variables, 199/206 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 282/488 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/482 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 488 constraints, problems are : Problem set: 0 solved, 282 unsolved in 12012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 3/3 constraints]
After SMT, in 21813ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 21817ms
Starting structural reductions in LTL mode, iteration 1 : 199/219 places, 283/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22015 ms. Remains : 199/219 places, 283/310 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLCardinality-06 finished in 22185 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)))))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 310/310 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 218 transition count 309
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 208 transition count 298
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 208 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 208 transition count 296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 203 transition count 289
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 203 transition count 289
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 200 transition count 286
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 200 transition count 286
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 198 transition count 284
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 198 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 198 transition count 282
Applied a total of 46 rules in 17 ms. Remains 198 /219 variables (removed 21) and now considering 282/310 (removed 28) transitions.
// Phase 1: matrix 282 rows 198 cols
[2024-06-02 18:08:17] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:08:17] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:08:17] [INFO ] Invariant cache hit.
[2024-06-02 18:08:17] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-06-02 18:08:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-02 18:08:19] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:08:19] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:08:19] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/480 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 205 constraints, problems are : Problem set: 0 solved, 281 unsolved in 9843 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/480 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 281/486 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 486 constraints, problems are : Problem set: 0 solved, 281 unsolved in 11959 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints]
After SMT, in 21882ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 21884ms
Starting structural reductions in LTL mode, iteration 1 : 198/219 places, 282/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22089 ms. Remains : 198/219 places, 282/310 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 128 ms.
Product exploration explored 100000 steps with 25000 reset in 129 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 444 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (166 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (254 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1212018 steps, run visited all 1 properties in 1343 ms. (steps per millisecond=902 )
Probabilistic random walk after 1212018 steps, saw 197875 distinct states, run finished after 1346 ms. (steps per millisecond=900 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 198 /198 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-02 18:08:41] [INFO ] Invariant cache hit.
[2024-06-02 18:08:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:08:41] [INFO ] Invariant cache hit.
[2024-06-02 18:08:41] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-06-02 18:08:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-02 18:08:43] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:08:43] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-06-02 18:08:44] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/480 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 205 constraints, problems are : Problem set: 0 solved, 281 unsolved in 9480 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/480 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 281/486 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 486 constraints, problems are : Problem set: 0 solved, 281 unsolved in 11914 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints]
After SMT, in 21493ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 21495ms
Finished structural reductions in LTL mode , in 1 iterations and 21666 ms. Remains : 198/198 places, 282/282 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 444 edges and 198 vertex of which 195 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (256 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (135 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1212018 steps, run visited all 1 properties in 1278 ms. (steps per millisecond=948 )
Probabilistic random walk after 1212018 steps, saw 197875 distinct states, run finished after 1278 ms. (steps per millisecond=948 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 86 ms.
Product exploration explored 100000 steps with 25000 reset in 158 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 282/282 transitions.
Graph (trivial) has 208 edges and 198 vertex of which 2 / 198 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 443 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 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 194 transition count 278
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 194 transition count 276
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 69 place count 194 transition count 297
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 91 place count 194 transition count 297
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 106 place count 179 transition count 282
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 121 place count 179 transition count 282
Performed 25 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 146 place count 179 transition count 298
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 179 transition count 291
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 168 place count 164 transition count 275
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 183 place count 164 transition count 275
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 164 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 187 place count 164 transition count 273
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 191 place count 160 transition count 269
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 195 place count 160 transition count 269
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 160 transition count 269
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 199 place count 158 transition count 267
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 158 transition count 267
Performed 25 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 226 place count 158 transition count 399
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 247 place count 158 transition count 378
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 292 place count 113 transition count 252
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 5 with 45 rules applied. Total rules applied 337 place count 113 transition count 252
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 354 place count 113 transition count 235
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 383 place count 84 transition count 172
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 412 place count 84 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 413 place count 84 transition count 171
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 419 place count 78 transition count 159
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 425 place count 78 transition count 159
Deduced a syphon composed of 40 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 7 with 22 rules applied. Total rules applied 447 place count 78 transition count 137
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 448 place count 77 transition count 136
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 449 place count 77 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 450 place count 77 transition count 160
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 452 place count 75 transition count 146
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 454 place count 75 transition count 146
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 454 rules in 62 ms. Remains 75 /198 variables (removed 123) and now considering 146/282 (removed 136) transitions.
[2024-06-02 18:09:06] [INFO ] Redundant transitions in 3 ms returned []
Running 145 sub problems to find dead transitions.
[2024-06-02 18:09:06] [INFO ] Flow matrix only has 130 transitions (discarded 16 similar events)
// Phase 1: matrix 130 rows 75 cols
[2024-06-02 18:09:06] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:09:06] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 18:09:06] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:09:06] [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:09:06] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-02 18:09:06] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 4/8 constraints. Problems are: Problem set: 9 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 136 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 TDEAD23 is UNSAT
Problem TDEAD24 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 TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 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 TDEAD99 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 TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
At refinement iteration 4 (OVERLAPS) 129/204 variables, 75/83 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 17/100 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/100 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/101 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/101 constraints. Problems are: Problem set: 76 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 101 constraints, problems are : Problem set: 76 solved, 69 unsolved in 2215 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 75/75 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 76 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 10/46 variables, 4/4 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/8 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 123/169 variables, 46/54 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 17/71 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 69/140 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/140 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 35/204 variables, 29/169 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/169 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 1/205 variables, 1/170 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/170 constraints. Problems are: Problem set: 76 solved, 69 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/170 constraints. Problems are: Problem set: 76 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 170 constraints, problems are : Problem set: 76 solved, 69 unsolved in 2019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 75/75 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 69/145 constraints, Known Traps: 4/4 constraints]
After SMT, in 4280ms problems are : Problem set: 76 solved, 69 unsolved
Search for dead transitions found 76 dead transitions in 4281ms
Found 76 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 76 transitions
Dead transitions reduction (with SMT) removed 76 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 75/198 places, 70/282 transitions.
Graph (complete) has 161 edges and 75 vertex of which 37 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 37 /75 variables (removed 38) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/198 places, 70/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4364 ms. Remains : 37/198 places, 70/282 transitions.
Built C files in :
/tmp/ltsmin17988840839342099480
[2024-06-02 18:09:10] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17988840839342099480
Running compilation step : cd /tmp/ltsmin17988840839342099480;'/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 573 ms.
Running link step : cd /tmp/ltsmin17988840839342099480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17988840839342099480;'/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/stateBased13545391340967795599.hoa' '--buchi-type=spotba'
LTSmin run took 227 ms.
FORMULA CO4-PT-09-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLCardinality-07 finished in 54033 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(p0)))'
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 310/310 transitions.
Graph (trivial) has 233 edges and 219 vertex of which 2 / 219 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 475 edges and 218 vertex of which 213 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 212 transition count 222
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 84 rules applied. Total rules applied 167 place count 132 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 131 transition count 218
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 168 place count 131 transition count 195
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 214 place count 108 transition count 195
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 217 place count 105 transition count 190
Iterating global reduction 3 with 3 rules applied. Total rules applied 220 place count 105 transition count 190
Performed 32 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 284 place count 73 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 292 place count 73 transition count 138
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 294 place count 72 transition count 137
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 296 place count 70 transition count 133
Iterating global reduction 5 with 2 rules applied. Total rules applied 298 place count 70 transition count 133
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 5 with 4 rules applied. Total rules applied 302 place count 68 transition count 131
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 338 place count 50 transition count 151
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 347 place count 50 transition count 142
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 358 place count 39 transition count 98
Iterating global reduction 6 with 11 rules applied. Total rules applied 369 place count 39 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 377 place count 39 transition count 90
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 380 place count 36 transition count 72
Iterating global reduction 7 with 3 rules applied. Total rules applied 383 place count 36 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 385 place count 36 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 393 place count 36 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 394 place count 35 transition count 61
Applied a total of 394 rules in 38 ms. Remains 35 /219 variables (removed 184) and now considering 61/310 (removed 249) transitions.
[2024-06-02 18:09:11] [INFO ] Flow matrix only has 49 transitions (discarded 12 similar events)
// Phase 1: matrix 49 rows 35 cols
[2024-06-02 18:09:11] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:09:11] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:09:11] [INFO ] Flow matrix only has 49 transitions (discarded 12 similar events)
[2024-06-02 18:09:11] [INFO ] Invariant cache hit.
[2024-06-02 18:09:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 18:09:11] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-02 18:09:11] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-02 18:09:11] [INFO ] Flow matrix only has 49 transitions (discarded 12 similar events)
[2024-06-02 18:09:11] [INFO ] Invariant cache hit.
[2024-06-02 18:09:11] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 48/83 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/84 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/84 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 49 constraints, problems are : Problem set: 0 solved, 58 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 48/83 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 58/106 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 1/84 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/84 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 107 constraints, problems are : Problem set: 0 solved, 58 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1571ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1572ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/219 places, 61/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1691 ms. Remains : 35/219 places, 61/310 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-10
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLCardinality-10 finished in 1739 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(X(p0)))))'
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 310/310 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 218 transition count 309
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 207 transition count 296
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 207 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 207 transition count 294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 202 transition count 287
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 202 transition count 287
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 199 transition count 284
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 199 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 197 transition count 282
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 197 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 197 transition count 280
Applied a total of 48 rules in 22 ms. Remains 197 /219 variables (removed 22) and now considering 280/310 (removed 30) transitions.
// Phase 1: matrix 280 rows 197 cols
[2024-06-02 18:09:13] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:09:13] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:09:13] [INFO ] Invariant cache hit.
[2024-06-02 18:09:13] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-06-02 18:09:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-06-02 18:09:15] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:09:15] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-02 18:09:15] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 204 constraints, problems are : Problem set: 0 solved, 279 unsolved in 9450 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 279/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 483 constraints, problems are : Problem set: 0 solved, 279 unsolved in 10976 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints]
After SMT, in 20510ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 20515ms
Starting structural reductions in LTL mode, iteration 1 : 197/219 places, 280/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20704 ms. Remains : 197/219 places, 280/310 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-13
Product exploration explored 100000 steps with 20000 reset in 156 ms.
Product exploration explored 100000 steps with 20000 reset in 182 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 440 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 40000 steps (573 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (233 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1042714 steps, run visited all 1 properties in 1048 ms. (steps per millisecond=994 )
Probabilistic random walk after 1042714 steps, saw 163259 distinct states, run finished after 1049 ms. (steps per millisecond=994 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 280/280 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-02 18:09:36] [INFO ] Invariant cache hit.
[2024-06-02 18:09:36] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:09:36] [INFO ] Invariant cache hit.
[2024-06-02 18:09:36] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-06-02 18:09:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-06-02 18:09:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:09:38] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:09:38] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 204 constraints, problems are : Problem set: 0 solved, 279 unsolved in 9479 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 279/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 483 constraints, problems are : Problem set: 0 solved, 279 unsolved in 11068 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints]
After SMT, in 20622ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 20625ms
Finished structural reductions in LTL mode , in 1 iterations and 20825 ms. Remains : 197/197 places, 280/280 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 440 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 40000 steps (234 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (218 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1042714 steps, run visited all 1 properties in 1081 ms. (steps per millisecond=964 )
Probabilistic random walk after 1042714 steps, saw 163259 distinct states, run finished after 1081 ms. (steps per millisecond=964 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 91 ms.
Product exploration explored 100000 steps with 20000 reset in 90 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 280/280 transitions.
Graph (trivial) has 208 edges and 197 vertex of which 2 / 197 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 439 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 193 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 193 transition count 274
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 68 place count 193 transition count 295
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 193 transition count 295
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 105 place count 178 transition count 280
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 120 place count 178 transition count 280
Performed 26 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 146 place count 178 transition count 296
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 178 transition count 289
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 169 place count 162 transition count 271
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 185 place count 162 transition count 271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 162 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 162 transition count 269
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 193 place count 158 transition count 265
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 197 place count 158 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 158 transition count 265
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 201 place count 156 transition count 263
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 203 place count 156 transition count 263
Performed 25 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 228 place count 156 transition count 391
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 249 place count 156 transition count 370
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 295 place count 110 transition count 241
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 5 with 46 rules applied. Total rules applied 341 place count 110 transition count 241
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 358 place count 110 transition count 224
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 387 place count 81 transition count 161
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 416 place count 81 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 419 place count 81 transition count 158
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 425 place count 75 transition count 146
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 431 place count 75 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 432 place count 75 transition count 171
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 439 place count 75 transition count 164
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 442 place count 72 transition count 146
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 445 place count 72 transition count 146
Deduced a syphon composed of 37 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 458 place count 72 transition count 133
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 458 rules in 35 ms. Remains 72 /197 variables (removed 125) and now considering 133/280 (removed 147) transitions.
[2024-06-02 18:09:59] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-02 18:09:59] [INFO ] Flow matrix only has 121 transitions (discarded 12 similar events)
// Phase 1: matrix 121 rows 72 cols
[2024-06-02 18:09:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:09:59] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 18:09:59] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:09:59] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-02 18:09:59] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-02 18:09:59] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 4/8 constraints. Problems are: Problem set: 9 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 123 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 TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 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 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 TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 4 (OVERLAPS) 120/192 variables, 72/80 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 15/95 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/193 variables, 1/96 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/96 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/96 constraints. Problems are: Problem set: 72 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 96 constraints, problems are : Problem set: 72 solved, 60 unsolved in 1894 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 72 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/44 variables, 4/4 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 4/8 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 114/158 variables, 44/52 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 15/67 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 60/127 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/127 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 34/192 variables, 28/155 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/155 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 1/193 variables, 1/156 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/156 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/193 variables, 0/156 constraints. Problems are: Problem set: 72 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 156 constraints, problems are : Problem set: 72 solved, 60 unsolved in 1785 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/132 constraints, Known Traps: 4/4 constraints]
After SMT, in 3710ms problems are : Problem set: 72 solved, 60 unsolved
Search for dead transitions found 72 dead transitions in 3712ms
Found 72 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 72 transitions
Dead transitions reduction (with SMT) removed 72 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 72/197 places, 61/280 transitions.
Graph (complete) has 142 edges and 72 vertex of which 35 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 35 /72 variables (removed 37) and now considering 61/61 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/197 places, 61/280 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3764 ms. Remains : 35/197 places, 61/280 transitions.
Built C files in :
/tmp/ltsmin5979947160895618932
[2024-06-02 18:10:03] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5979947160895618932
Running compilation step : cd /tmp/ltsmin5979947160895618932;'/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 429 ms.
Running link step : cd /tmp/ltsmin5979947160895618932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5979947160895618932;'/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/stateBased1463977658435110108.hoa' '--buchi-type=spotba'
LTSmin run took 129 ms.
FORMULA CO4-PT-09-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLCardinality-13 finished in 50725 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))'
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 310/310 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 218 transition count 309
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 208 transition count 297
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 208 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 208 transition count 295
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 204 transition count 290
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 204 transition count 290
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 202 transition count 288
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 202 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 201 transition count 287
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 201 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 201 transition count 286
Applied a total of 39 rules in 9 ms. Remains 201 /219 variables (removed 18) and now considering 286/310 (removed 24) transitions.
// Phase 1: matrix 286 rows 201 cols
[2024-06-02 18:10:03] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:10:03] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:10:03] [INFO ] Invariant cache hit.
[2024-06-02 18:10:03] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-06-02 18:10:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 18:10:05] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:10:05] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-02 18:10:06] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/487 variables, 201/208 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/487 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 208 constraints, problems are : Problem set: 0 solved, 285 unsolved in 9812 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-02 18:10:15] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 286/487 variables, 201/209 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 285/494 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 0/487 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 494 constraints, problems are : Problem set: 0 solved, 285 unsolved in 12483 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 4/4 constraints]
After SMT, in 22382ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 22386ms
Starting structural reductions in LTL mode, iteration 1 : 201/219 places, 286/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22558 ms. Remains : 201/219 places, 286/310 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-09-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 446 edges and 201 vertex of which 198 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-09-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-09-LTLCardinality-14 finished in 22855 ms.
All properties solved by simple procedures.
Total runtime 187300 ms.

BK_STOP 1717351826682

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-09"
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-09, 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-171734898500067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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