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-171734898500068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CO4-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898500068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 152K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-09-LTLFireability-00
FORMULA_NAME CO4-PT-09-LTLFireability-01
FORMULA_NAME CO4-PT-09-LTLFireability-02
FORMULA_NAME CO4-PT-09-LTLFireability-03
FORMULA_NAME CO4-PT-09-LTLFireability-04
FORMULA_NAME CO4-PT-09-LTLFireability-05
FORMULA_NAME CO4-PT-09-LTLFireability-06
FORMULA_NAME CO4-PT-09-LTLFireability-07
FORMULA_NAME CO4-PT-09-LTLFireability-08
FORMULA_NAME CO4-PT-09-LTLFireability-09
FORMULA_NAME CO4-PT-09-LTLFireability-10
FORMULA_NAME CO4-PT-09-LTLFireability-11
FORMULA_NAME CO4-PT-09-LTLFireability-12
FORMULA_NAME CO4-PT-09-LTLFireability-13
FORMULA_NAME CO4-PT-09-LTLFireability-14
FORMULA_NAME CO4-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717351642136

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:07:23] [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:07:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:07:23] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 18:07:23] [INFO ] Transformed 467 places.
[2024-06-02 18:07:23] [INFO ] Transformed 634 transitions.
[2024-06-02 18:07:23] [INFO ] Found NUPN structural information;
[2024-06-02 18:07:23] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 189 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 4 formulas.
Deduced a syphon composed of 108 places in 12 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 469
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 95 place count 266 transition count 388
Iterating global reduction 1 with 80 rules applied. Total rules applied 175 place count 266 transition count 388
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 180 place count 266 transition count 383
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 219 place count 227 transition count 325
Iterating global reduction 2 with 39 rules applied. Total rules applied 258 place count 227 transition count 325
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 267 place count 218 transition count 310
Iterating global reduction 2 with 9 rules applied. Total rules applied 276 place count 218 transition count 310
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 281 place count 213 transition count 305
Iterating global reduction 2 with 5 rules applied. Total rules applied 286 place count 213 transition count 305
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 290 place count 209 transition count 301
Iterating global reduction 2 with 4 rules applied. Total rules applied 294 place count 209 transition count 301
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 298 place count 209 transition count 297
Applied a total of 298 rules in 84 ms. Remains 209 /359 variables (removed 150) and now considering 297/471 (removed 174) transitions.
// Phase 1: matrix 297 rows 209 cols
[2024-06-02 18:07:23] [INFO ] Computed 6 invariants in 23 ms
[2024-06-02 18:07:23] [INFO ] Implicit Places using invariants in 227 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 255 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 208/359 places, 297/471 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 359 ms. Remains : 208/359 places, 297/471 transitions.
Support contains 12 out of 208 places after structural reductions.
[2024-06-02 18:07:24] [INFO ] Flatten gal took : 46 ms
[2024-06-02 18:07:24] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:07:24] [INFO ] Input system was already deterministic with 297 transitions.
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (386 resets) in 1296 ms. (30 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40002 steps (254 resets) in 254 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (212 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (240 resets) in 159 ms. (250 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40001 steps (204 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (184 resets) in 206 ms. (193 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (260 resets) in 95 ms. (416 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (306 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
// Phase 1: matrix 297 rows 208 cols
[2024-06-02 18:07:25] [INFO ] Computed 5 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/34 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 95/129 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 187/316 variables, 65/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 158/474 variables, 87/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 26/500 variables, 19/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/505 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 18:07:25] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 10 ms to minimize.
Problem AtomicPropp6 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 1/214 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/505 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/505 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 214 constraints, problems are : Problem set: 1 solved, 3 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 109/119 variables, 12/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 12/131 variables, 2/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 17/148 variables, 3/26 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 18:07:25] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 211/359 variables, 104/131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 125/484 variables, 73/204 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 16/500 variables, 11/215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/500 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 5/505 variables, 3/218 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/505 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 218 constraints, problems are : Problem set: 1 solved, 3 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 871ms problems are : Problem set: 1 solved, 3 unsolved
Finished Parikh walk after 76 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=38 )
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 3 properties in 7 ms.
FORMULA CO4-PT-09-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-09-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 18 stabilizing places and 28 stable transitions
Graph (complete) has 487 edges and 208 vertex of which 205 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 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 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 297/297 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 201 transition count 286
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 201 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 201 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 200 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 200 transition count 282
Applied a total of 18 rules in 12 ms. Remains 200 /208 variables (removed 8) and now considering 282/297 (removed 15) transitions.
// Phase 1: matrix 282 rows 200 cols
[2024-06-02 18:07:26] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 18:07:26] [INFO ] Implicit Places using invariants in 74 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/208 places, 282/297 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 199/208 places, 282/297 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-03
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 3 ms.
FORMULA CO4-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-03 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 297/297 transitions.
Graph (trivial) has 214 edges and 208 vertex of which 2 / 208 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 486 edges and 207 vertex of which 204 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 203 transition count 224
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 72 rules applied. Total rules applied 142 place count 135 transition count 220
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 144 place count 133 transition count 220
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 144 place count 133 transition count 199
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 186 place count 112 transition count 199
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 191 place count 107 transition count 190
Iterating global reduction 3 with 5 rules applied. Total rules applied 196 place count 107 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 198 place count 107 transition count 188
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 106 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 106 transition count 186
Performed 31 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 262 place count 75 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 270 place count 75 transition count 139
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 274 place count 73 transition count 137
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 276 place count 71 transition count 133
Iterating global reduction 6 with 2 rules applied. Total rules applied 278 place count 71 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 282 place count 69 transition count 131
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 316 place count 52 transition count 148
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 324 place count 52 transition count 140
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 335 place count 41 transition count 96
Iterating global reduction 7 with 11 rules applied. Total rules applied 346 place count 41 transition count 96
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 353 place count 41 transition count 89
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 355 place count 39 transition count 77
Iterating global reduction 8 with 2 rules applied. Total rules applied 357 place count 39 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 358 place count 39 transition count 76
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 366 place count 39 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 368 place count 37 transition count 66
Applied a total of 368 rules in 67 ms. Remains 37 /208 variables (removed 171) and now considering 66/297 (removed 231) transitions.
[2024-06-02 18:07:26] [INFO ] Flow matrix only has 53 transitions (discarded 13 similar events)
// Phase 1: matrix 53 rows 37 cols
[2024-06-02 18:07:26] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:07:26] [INFO ] Implicit Places using invariants in 48 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/208 places, 66/297 transitions.
Applied a total of 0 rules in 4 ms. Remains 36 /36 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 36/208 places, 66/297 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-05
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-05 finished in 164 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&&X(p1)))&&G(p2))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 297/297 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 202 transition count 288
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 202 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 201 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 201 transition count 287
Applied a total of 14 rules in 8 ms. Remains 201 /208 variables (removed 7) and now considering 287/297 (removed 10) transitions.
// Phase 1: matrix 287 rows 201 cols
[2024-06-02 18:07:26] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:07:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:07:26] [INFO ] Invariant cache hit.
[2024-06-02 18:07:26] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 18:07:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 18:07:29] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:07:29] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:07:29] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:07:29] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-06-02 18:07:29] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-06-02 18:07:29] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/488 variables, 201/212 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 18:07:32] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/488 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 213 constraints, problems are : Problem set: 0 solved, 286 unsolved in 12049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/488 variables, 201/213 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 286/499 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/488 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 499 constraints, problems are : Problem set: 0 solved, 286 unsolved in 12483 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 7/7 constraints]
After SMT, in 24680ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 24686ms
Starting structural reductions in LTL mode, iteration 1 : 201/208 places, 287/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24884 ms. Remains : 201/208 places, 287/297 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-09-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-06 finished in 25132 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 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 297/297 transitions.
Graph (trivial) has 215 edges and 208 vertex of which 2 / 208 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 486 edges and 207 vertex of which 204 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 203 transition count 223
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 134 transition count 221
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 142 place count 134 transition count 199
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 186 place count 112 transition count 199
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 191 place count 107 transition count 190
Iterating global reduction 2 with 5 rules applied. Total rules applied 196 place count 107 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 198 place count 107 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 199 place count 106 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 200 place count 106 transition count 186
Performed 30 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 260 place count 76 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 266 place count 76 transition count 143
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 268 place count 75 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 270 place count 73 transition count 138
Iterating global reduction 5 with 2 rules applied. Total rules applied 272 place count 73 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 276 place count 71 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 277 place count 71 transition count 135
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 313 place count 53 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 322 place count 53 transition count 146
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 333 place count 42 transition count 102
Iterating global reduction 7 with 11 rules applied. Total rules applied 344 place count 42 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 352 place count 42 transition count 94
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 355 place count 39 transition count 76
Iterating global reduction 8 with 3 rules applied. Total rules applied 358 place count 39 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 360 place count 39 transition count 74
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 362 place count 38 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 379 place count 38 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 381 place count 36 transition count 63
Applied a total of 381 rules in 46 ms. Remains 36 /208 variables (removed 172) and now considering 63/297 (removed 234) transitions.
[2024-06-02 18:07:51] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 36 cols
[2024-06-02 18:07:51] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:07:51] [INFO ] Implicit Places using invariants in 34 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/208 places, 63/297 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 35/208 places, 63/297 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 131 ms.
Product exploration explored 100000 steps with 38 reset in 67 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5320 steps (635 resets) in 59 ms. (88 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 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-02 18:07:52] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 35 cols
[2024-06-02 18:07:52] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:07:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 18:07:52] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-06-02 18:07:52] [INFO ] Invariant cache hit.
[2024-06-02 18:07:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:07:52] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-06-02 18:07:52] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-02 18:07:52] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-06-02 18:07:52] [INFO ] Invariant cache hit.
[2024-06-02 18:07:52] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 57/92 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 1/93 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 41 constraints, problems are : Problem set: 0 solved, 48 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 57/92 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 48/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 1/93 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 89 constraints, problems are : Problem set: 0 solved, 48 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1241ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1349 ms. Remains : 35/35 places, 63/63 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2160 steps (250 resets) in 36 ms. (58 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 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 69 reset in 76 ms.
Product exploration explored 100000 steps with 29 reset in 58 ms.
Built C files in :
/tmp/ltsmin15504044007379720547
[2024-06-02 18:07:54] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-06-02 18:07:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:07:54] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-06-02 18:07:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:07:54] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-06-02 18:07:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:07:54] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15504044007379720547
Running compilation step : cd /tmp/ltsmin15504044007379720547;'/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 306 ms.
Running link step : cd /tmp/ltsmin15504044007379720547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin15504044007379720547;'/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/stateBased3328693112291899433.hoa' '--buchi-type=spotba'
LTSmin run took 300 ms.
FORMULA CO4-PT-09-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLFireability-11 finished in 3611 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 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 297/297 transitions.
Graph (trivial) has 216 edges and 208 vertex of which 2 / 208 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 486 edges and 207 vertex of which 204 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 203 transition count 222
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 133 transition count 220
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 144 place count 133 transition count 198
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 188 place count 111 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 192 place count 107 transition count 190
Iterating global reduction 2 with 4 rules applied. Total rules applied 196 place count 107 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 198 place count 107 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 199 place count 106 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 200 place count 106 transition count 186
Performed 30 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 260 place count 76 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 268 place count 76 transition count 140
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 272 place count 74 transition count 138
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 274 place count 72 transition count 134
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 72 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 280 place count 70 transition count 132
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 316 place count 52 transition count 152
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 325 place count 52 transition count 143
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 336 place count 41 transition count 99
Iterating global reduction 6 with 11 rules applied. Total rules applied 347 place count 41 transition count 99
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 355 place count 41 transition count 91
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 358 place count 38 transition count 73
Iterating global reduction 7 with 3 rules applied. Total rules applied 361 place count 38 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 363 place count 38 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 371 place count 38 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 373 place count 36 transition count 61
Applied a total of 373 rules in 28 ms. Remains 36 /208 variables (removed 172) and now considering 61/297 (removed 236) transitions.
[2024-06-02 18:07:55] [INFO ] Flow matrix only has 49 transitions (discarded 12 similar events)
// Phase 1: matrix 49 rows 36 cols
[2024-06-02 18:07:55] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:07:55] [INFO ] Implicit Places using invariants in 39 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/208 places, 61/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 70 ms. Remains : 35/208 places, 61/297 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-12
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-12 finished in 132 ms.
All properties solved by simple procedures.
Total runtime 32271 ms.

BK_STOP 1717351675579

--------------------
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-09"
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-09, 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-171734898500068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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