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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 132K 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-11-LTLFireability-00
FORMULA_NAME CO4-PT-11-LTLFireability-01
FORMULA_NAME CO4-PT-11-LTLFireability-02
FORMULA_NAME CO4-PT-11-LTLFireability-03
FORMULA_NAME CO4-PT-11-LTLFireability-04
FORMULA_NAME CO4-PT-11-LTLFireability-05
FORMULA_NAME CO4-PT-11-LTLFireability-06
FORMULA_NAME CO4-PT-11-LTLFireability-07
FORMULA_NAME CO4-PT-11-LTLFireability-08
FORMULA_NAME CO4-PT-11-LTLFireability-09
FORMULA_NAME CO4-PT-11-LTLFireability-10
FORMULA_NAME CO4-PT-11-LTLFireability-11
FORMULA_NAME CO4-PT-11-LTLFireability-12
FORMULA_NAME CO4-PT-11-LTLFireability-13
FORMULA_NAME CO4-PT-11-LTLFireability-14
FORMULA_NAME CO4-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717351885196

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:11:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:11:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:11:26] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-06-02 18:11:26] [INFO ] Transformed 545 places.
[2024-06-02 18:11:26] [INFO ] Transformed 617 transitions.
[2024-06-02 18:11:26] [INFO ] Found NUPN structural information;
[2024-06-02 18:11:26] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 157 places in 15 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-11-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 376 transition count 437
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 75 place count 316 transition count 375
Iterating global reduction 1 with 60 rules applied. Total rules applied 135 place count 316 transition count 375
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 182 place count 269 transition count 328
Iterating global reduction 1 with 47 rules applied. Total rules applied 229 place count 269 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 232 place count 269 transition count 325
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 253 place count 248 transition count 304
Iterating global reduction 2 with 21 rules applied. Total rules applied 274 place count 248 transition count 304
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 286 place count 236 transition count 292
Iterating global reduction 2 with 12 rules applied. Total rules applied 298 place count 236 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 300 place count 236 transition count 290
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 305 place count 231 transition count 285
Iterating global reduction 3 with 5 rules applied. Total rules applied 310 place count 231 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 311 place count 230 transition count 284
Iterating global reduction 3 with 1 rules applied. Total rules applied 312 place count 230 transition count 284
Applied a total of 312 rules in 105 ms. Remains 230 /388 variables (removed 158) and now considering 284/440 (removed 156) transitions.
// Phase 1: matrix 284 rows 230 cols
[2024-06-02 18:11:26] [INFO ] Computed 4 invariants in 21 ms
[2024-06-02 18:11:27] [INFO ] Implicit Places using invariants in 288 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 320 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 229/388 places, 284/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 450 ms. Remains : 229/388 places, 284/440 transitions.
Support contains 22 out of 229 places after structural reductions.
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 79 ms
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:11:27] [INFO ] Input system was already deterministic with 284 transitions.
RANDOM walk for 40000 steps (116 resets) in 1346 ms. (29 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4001 steps (34 resets) in 60 ms. (65 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (28 resets) in 80 ms. (49 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (39 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (32 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (20 resets) in 81 ms. (48 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (38 resets) in 19 ms. (200 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4001 steps (27 resets) in 21 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (30 resets) in 30 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (32 resets) in 39 ms. (100 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (30 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (29 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (21 resets) in 32 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (33 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (37 resets) in 27 ms. (142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (29 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
// Phase 1: matrix 284 rows 229 cols
[2024-06-02 18:11:28] [INFO ] Computed 3 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 12/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 10/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 88/126 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 167/293 variables, 75/116 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 133/426 variables, 66/182 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 62/488 variables, 36/218 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 15/503 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 9/512 variables, 5/231 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 17 (OVERLAPS) 1/513 variables, 1/232 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 0/513 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 232 constraints, problems are : Problem set: 1 solved, 13 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 12/27 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 10/37 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 86/123 variables, 37/40 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 166/289 variables, 74/117 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 10/127 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 133/422 variables, 66/193 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-06-02 18:11:29] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 1/194 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 62/484 variables, 36/230 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 18/502 variables, 9/239 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/502 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 10/512 variables, 6/245 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/512 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 1/513 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/513 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 0/513 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 246 constraints, problems are : Problem set: 1 solved, 13 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 3039ms problems are : Problem set: 1 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Finished Parikh walk after 28 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=28 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 758 ms.
FORMULA CO4-PT-11-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA CO4-PT-11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 357 edges and 229 vertex of which 224 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 231 edges and 229 vertex of which 3 / 229 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 355 edges and 227 vertex of which 222 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 221 transition count 181
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 127 transition count 179
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 195 place count 126 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 197 place count 124 transition count 177
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 197 place count 124 transition count 155
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 241 place count 102 transition count 155
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 246 place count 97 transition count 150
Iterating global reduction 4 with 5 rules applied. Total rules applied 251 place count 97 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 252 place count 97 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 252 place count 97 transition count 148
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 96 transition count 148
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 255 place count 95 transition count 147
Iterating global reduction 5 with 1 rules applied. Total rules applied 256 place count 95 transition count 147
Performed 34 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 324 place count 61 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 326 place count 61 transition count 100
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 329 place count 58 transition count 97
Iterating global reduction 6 with 3 rules applied. Total rules applied 332 place count 58 transition count 97
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 360 place count 44 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 368 place count 44 transition count 90
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 379 place count 33 transition count 68
Iterating global reduction 7 with 11 rules applied. Total rules applied 390 place count 33 transition count 68
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 397 place count 33 transition count 61
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 400 place count 30 transition count 52
Iterating global reduction 8 with 3 rules applied. Total rules applied 403 place count 30 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 405 place count 30 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 407 place count 29 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 415 place count 29 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 417 place count 29 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 419 place count 27 transition count 48
Applied a total of 419 rules in 51 ms. Remains 27 /229 variables (removed 202) and now considering 48/284 (removed 236) transitions.
[2024-06-02 18:11:32] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 27 cols
[2024-06-02 18:11:32] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:11:32] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 18:11:32] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
[2024-06-02 18:11:32] [INFO ] Invariant cache hit.
[2024-06-02 18:11:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:11:32] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-02 18:11:32] [INFO ] Redundant transitions in 14 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-02 18:11:32] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
[2024-06-02 18:11:32] [INFO ] Invariant cache hit.
[2024-06-02 18:11:32] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 45/71 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/72 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/73 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 32 constraints, problems are : Problem set: 0 solved, 42 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 45/71 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 1/72 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 31/73 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/73 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 74 constraints, problems are : Problem set: 0 solved, 42 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1093ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1095ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/229 places, 48/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1241 ms. Remains : 27/229 places, 48/284 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-04
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA CO4-PT-11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-04 finished in 1570 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 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 240 edges and 229 vertex of which 3 / 229 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 355 edges and 227 vertex of which 222 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 221 transition count 176
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 122 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 203 place count 121 transition count 174
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 203 place count 121 transition count 154
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 243 place count 101 transition count 154
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 246 place count 98 transition count 151
Iterating global reduction 3 with 3 rules applied. Total rules applied 249 place count 98 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 98 transition count 150
Performed 36 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 322 place count 62 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 324 place count 62 transition count 101
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 327 place count 59 transition count 98
Iterating global reduction 5 with 3 rules applied. Total rules applied 330 place count 59 transition count 98
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 360 place count 44 transition count 100
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 369 place count 44 transition count 91
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 380 place count 33 transition count 69
Iterating global reduction 6 with 11 rules applied. Total rules applied 391 place count 33 transition count 69
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 399 place count 33 transition count 61
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 401 place count 31 transition count 55
Iterating global reduction 7 with 2 rules applied. Total rules applied 403 place count 31 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 404 place count 31 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 406 place count 30 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 423 place count 30 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 425 place count 28 transition count 47
Applied a total of 425 rules in 29 ms. Remains 28 /229 variables (removed 201) and now considering 47/284 (removed 237) transitions.
[2024-06-02 18:11:33] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
// Phase 1: matrix 44 rows 28 cols
[2024-06-02 18:11:33] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:11:33] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 18:11:33] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 18:11:33] [INFO ] Invariant cache hit.
[2024-06-02 18:11:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:11:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-02 18:11:33] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2024-06-02 18:11:33] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 18:11:33] [INFO ] Invariant cache hit.
[2024-06-02 18:11:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 43/71 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 1/72 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 32 constraints, problems are : Problem set: 0 solved, 37 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 43/71 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 37/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 1/72 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 69 constraints, problems are : Problem set: 0 solved, 37 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 721ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/229 places, 47/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 830 ms. Remains : 28/229 places, 47/284 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-06
Product exploration explored 100000 steps with 6 reset in 148 ms.
Product exploration explored 100000 steps with 0 reset in 65 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 9204 steps (1321 resets) in 62 ms. (146 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-06-02 18:11:35] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 18:11:35] [INFO ] Invariant cache hit.
[2024-06-02 18:11:35] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 18:11:35] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 18:11:35] [INFO ] Invariant cache hit.
[2024-06-02 18:11:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:11:35] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-02 18:11:35] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2024-06-02 18:11:35] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 18:11:35] [INFO ] Invariant cache hit.
[2024-06-02 18:11:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 43/71 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 1/72 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 32 constraints, problems are : Problem set: 0 solved, 37 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 43/71 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 37/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 1/72 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 69 constraints, problems are : Problem set: 0 solved, 37 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 866ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 867ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 951 ms. Remains : 28/28 places, 47/47 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 34732 steps (5003 resets) in 77 ms. (445 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 65 ms.
Product exploration explored 100000 steps with 12 reset in 65 ms.
Built C files in :
/tmp/ltsmin3303823502400566157
[2024-06-02 18:11:36] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2024-06-02 18:11:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:11:36] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2024-06-02 18:11:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:11:36] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2024-06-02 18:11:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:11:36] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3303823502400566157
Running compilation step : cd /tmp/ltsmin3303823502400566157;'/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 253 ms.
Running link step : cd /tmp/ltsmin3303823502400566157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3303823502400566157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11257068553069002706.hoa' '--buchi-type=spotba'
LTSmin run took 204 ms.
FORMULA CO4-PT-11-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-11-LTLFireability-06 finished in 3488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 220 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 220 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 220 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 214 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 214 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 210 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 210 transition count 263
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 206 transition count 259
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 205 transition count 258
Applied a total of 50 rules in 26 ms. Remains 205 /229 variables (removed 24) and now considering 258/284 (removed 26) transitions.
// Phase 1: matrix 258 rows 205 cols
[2024-06-02 18:11:37] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:11:37] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 18:11:37] [INFO ] Invariant cache hit.
[2024-06-02 18:11:37] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-02 18:11:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:11:41] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:11:41] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 10214 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 467 constraints, problems are : Problem set: 0 solved, 257 unsolved in 14655 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
After SMT, in 24918ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24921ms
Starting structural reductions in LTL mode, iteration 1 : 205/229 places, 258/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25116 ms. Remains : 205/229 places, 258/284 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-08
Entered a terminal (fully accepting) state of product in 68 steps with 2 reset in 0 ms.
FORMULA CO4-PT-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-08 finished in 25228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 233 edges and 229 vertex of which 3 / 229 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 355 edges and 227 vertex of which 222 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 221 transition count 181
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 127 transition count 179
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 194 place count 126 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 125 transition count 178
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 195 place count 125 transition count 158
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 235 place count 105 transition count 158
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 239 place count 101 transition count 154
Iterating global reduction 4 with 4 rules applied. Total rules applied 243 place count 101 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 243 place count 101 transition count 153
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 245 place count 100 transition count 153
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 99 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 99 transition count 152
Performed 35 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 317 place count 64 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 319 place count 64 transition count 105
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 322 place count 61 transition count 102
Iterating global reduction 5 with 3 rules applied. Total rules applied 325 place count 61 transition count 102
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 353 place count 47 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 362 place count 47 transition count 95
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 373 place count 36 transition count 73
Iterating global reduction 6 with 11 rules applied. Total rules applied 384 place count 36 transition count 73
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 392 place count 36 transition count 65
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 395 place count 33 transition count 56
Iterating global reduction 7 with 3 rules applied. Total rules applied 398 place count 33 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 400 place count 33 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 402 place count 32 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 419 place count 32 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 421 place count 30 transition count 52
Applied a total of 421 rules in 40 ms. Remains 30 /229 variables (removed 199) and now considering 52/284 (removed 232) transitions.
[2024-06-02 18:12:02] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
// Phase 1: matrix 47 rows 30 cols
[2024-06-02 18:12:02] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:12:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:12:02] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
[2024-06-02 18:12:02] [INFO ] Invariant cache hit.
[2024-06-02 18:12:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:12:02] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-06-02 18:12:02] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-02 18:12:02] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
[2024-06-02 18:12:02] [INFO ] Invariant cache hit.
[2024-06-02 18:12:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 46/75 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/76 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 35 constraints, problems are : Problem set: 0 solved, 43 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 46/75 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/76 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 1/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (OVERLAPS) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 78 constraints, problems are : Problem set: 0 solved, 43 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1192ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/229 places, 52/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1379 ms. Remains : 30/229 places, 52/284 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-11-LTLFireability-10
Product exploration explored 100000 steps with 5 reset in 161 ms.
Product exploration explored 100000 steps with 2 reset in 135 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 13541 steps (1429 resets) in 26 ms. (501 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 231 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 52/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-06-02 18:12:04] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
[2024-06-02 18:12:04] [INFO ] Invariant cache hit.
[2024-06-02 18:12:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 18:12:05] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
[2024-06-02 18:12:05] [INFO ] Invariant cache hit.
[2024-06-02 18:12:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:12:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-02 18:12:05] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-02 18:12:05] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
[2024-06-02 18:12:05] [INFO ] Invariant cache hit.
[2024-06-02 18:12:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 46/75 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/76 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 35 constraints, problems are : Problem set: 0 solved, 43 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 46/75 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/76 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 1/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (OVERLAPS) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 78 constraints, problems are : Problem set: 0 solved, 43 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1168ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1253 ms. Remains : 30/30 places, 52/52 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 14956 steps (1583 resets) in 38 ms. (383 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 219 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11 reset in 34 ms.
Product exploration explored 100000 steps with 4 reset in 30 ms.
Built C files in :
/tmp/ltsmin1190644374009450920
[2024-06-02 18:12:07] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-06-02 18:12:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:12:07] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-06-02 18:12:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:12:07] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-06-02 18:12:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:12:07] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1190644374009450920
Running compilation step : cd /tmp/ltsmin1190644374009450920;'/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 159 ms.
Running link step : cd /tmp/ltsmin1190644374009450920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1190644374009450920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4024122070381485814.hoa' '--buchi-type=spotba'
LTSmin run took 155 ms.
FORMULA CO4-PT-11-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-11-LTLFireability-10 finished in 4829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)&&(p1||X(p2))))&&F(p3)))'
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 223 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 223 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 223 transition count 277
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 219 transition count 273
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 219 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 219 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 216 transition count 269
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 216 transition count 269
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 213 transition count 266
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 213 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 212 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 212 transition count 265
Applied a total of 36 rules in 20 ms. Remains 212 /229 variables (removed 17) and now considering 265/284 (removed 19) transitions.
// Phase 1: matrix 265 rows 212 cols
[2024-06-02 18:12:07] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:12:07] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:12:07] [INFO ] Invariant cache hit.
[2024-06-02 18:12:07] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-06-02 18:12:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/477 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:12:11] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:12:12] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 217 constraints, problems are : Problem set: 0 solved, 264 unsolved in 11083 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/477 variables, 212/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 264/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 481 constraints, problems are : Problem set: 0 solved, 264 unsolved in 16217 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
After SMT, in 27346ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 27350ms
Starting structural reductions in LTL mode, iteration 1 : 212/229 places, 265/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27535 ms. Remains : 212/229 places, 265/284 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p3) (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p2)), (NOT p3), true]
Running random walk in product with property : CO4-PT-11-LTLFireability-11
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 0 ms.
FORMULA CO4-PT-11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-11 finished in 27759 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&&(p1||X(p1))))))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 220 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 220 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 220 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 214 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 214 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 210 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 210 transition count 263
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 206 transition count 259
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 205 transition count 258
Applied a total of 50 rules in 22 ms. Remains 205 /229 variables (removed 24) and now considering 258/284 (removed 26) transitions.
// Phase 1: matrix 258 rows 205 cols
[2024-06-02 18:12:35] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:12:35] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:12:35] [INFO ] Invariant cache hit.
[2024-06-02 18:12:35] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-02 18:12:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:12:39] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:12:39] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 10425 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 467 constraints, problems are : Problem set: 0 solved, 257 unsolved in 14417 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
After SMT, in 24892ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24895ms
Starting structural reductions in LTL mode, iteration 1 : 205/229 places, 258/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25079 ms. Remains : 205/229 places, 258/284 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-11-LTLFireability-12
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-12 finished in 25180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&G(p1))))))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 220 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 220 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 220 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 214 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 214 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 210 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 210 transition count 263
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 206 transition count 259
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 205 transition count 258
Applied a total of 50 rules in 16 ms. Remains 205 /229 variables (removed 24) and now considering 258/284 (removed 26) transitions.
[2024-06-02 18:13:00] [INFO ] Invariant cache hit.
[2024-06-02 18:13:00] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:13:00] [INFO ] Invariant cache hit.
[2024-06-02 18:13:00] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-02 18:13:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:13:04] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:13:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 10483 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 467 constraints, problems are : Problem set: 0 solved, 257 unsolved in 14143 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
After SMT, in 24661ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24666ms
Starting structural reductions in LTL mode, iteration 1 : 205/229 places, 258/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24856 ms. Remains : 205/229 places, 258/284 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-11-LTLFireability-13
Product exploration explored 100000 steps with 10 reset in 75 ms.
Product exploration explored 100000 steps with 3 reset in 76 ms.
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 327 edges and 205 vertex of which 200 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (50 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (132 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (65 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (57 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (41 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (78 resets) in 108 ms. (366 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (30 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 92677 steps, run visited all 6 properties in 488 ms. (steps per millisecond=189 )
Probabilistic random walk after 92677 steps, saw 23148 distinct states, run finished after 492 ms. (steps per millisecond=188 ) properties seen :6
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p0)))
Knowledge based reduction with 11 factoid took 186 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-11-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-11-LTLFireability-13 finished in 26840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 220 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 220 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 220 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 214 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 214 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 210 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 210 transition count 263
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 206 transition count 259
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 205 transition count 258
Applied a total of 50 rules in 16 ms. Remains 205 /229 variables (removed 24) and now considering 258/284 (removed 26) transitions.
[2024-06-02 18:13:27] [INFO ] Invariant cache hit.
[2024-06-02 18:13:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:13:27] [INFO ] Invariant cache hit.
[2024-06-02 18:13:27] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-02 18:13:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:13:31] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 16 ms to minimize.
[2024-06-02 18:13:31] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 10257 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 467 constraints, problems are : Problem set: 0 solved, 257 unsolved in 14528 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
After SMT, in 24833ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24841ms
Starting structural reductions in LTL mode, iteration 1 : 205/229 places, 258/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25015 ms. Remains : 205/229 places, 258/284 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 93 ms.
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-15 finished in 25197 ms.
All properties solved by simple procedures.
Total runtime 146015 ms.

BK_STOP 1717352032475

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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