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.r004-smll-171620117600012.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 ASLink-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117600012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 201K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716212504306

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-20 13:41:46] [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-05-20 13:41:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 13:41:46] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-05-20 13:41:46] [INFO ] Transformed 431 places.
[2024-05-20 13:41:46] [INFO ] Transformed 735 transitions.
[2024-05-20 13:41:46] [INFO ] Found NUPN structural information;
[2024-05-20 13:41:46] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 100 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 431 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 425 transition count 728
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 421 transition count 724
Ensure Unique test removed 1 places
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 420 transition count 724
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 420 transition count 722
Applied a total of 17 rules in 297 ms. Remains 420 /431 variables (removed 11) and now considering 722/728 (removed 6) transitions.
// Phase 1: matrix 722 rows 420 cols
[2024-05-20 13:41:47] [INFO ] Computed 73 invariants in 92 ms
[2024-05-20 13:41:49] [INFO ] Implicit Places using invariants in 1252 ms returned [1, 19, 20, 23, 52, 70, 199, 204, 216, 222, 258, 263, 281, 282, 283, 301, 309, 317, 323, 329, 335, 341, 349, 355, 361, 369]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1375 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 394/431 places, 722/728 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 382 transition count 710
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 382 transition count 710
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 373 transition count 701
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 373 transition count 701
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 368 transition count 696
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 368 transition count 696
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 366 transition count 694
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 366 transition count 694
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 364 transition count 692
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 364 transition count 692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 363 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 363 transition count 691
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 362 transition count 690
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 362 transition count 690
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 361 transition count 689
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 361 transition count 689
Applied a total of 66 rules in 117 ms. Remains 361 /394 variables (removed 33) and now considering 689/722 (removed 33) transitions.
// Phase 1: matrix 689 rows 361 cols
[2024-05-20 13:41:49] [INFO ] Computed 47 invariants in 29 ms
[2024-05-20 13:41:49] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-20 13:41:49] [INFO ] Invariant cache hit.
[2024-05-20 13:41:50] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1675 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 361/431 places, 689/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3524 ms. Remains : 361/431 places, 689/728 transitions.
Support contains 52 out of 361 places after structural reductions.
[2024-05-20 13:41:51] [INFO ] Flatten gal took : 200 ms
[2024-05-20 13:41:51] [INFO ] Flatten gal took : 104 ms
[2024-05-20 13:41:51] [INFO ] Input system was already deterministic with 689 transitions.
Support contains 47 out of 361 places (down from 52) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (781 resets) in 3156 ms. (12 steps per ms) remains 13/24 properties
BEST_FIRST walk for 40003 steps (266 resets) in 526 ms. (75 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (296 resets) in 318 ms. (125 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (294 resets) in 388 ms. (102 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (300 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (279 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (287 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (271 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (314 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (292 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (279 resets) in 140 ms. (283 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (276 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (296 resets) in 432 ms. (92 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (290 resets) in 307 ms. (129 steps per ms) remains 13/13 properties
[2024-05-20 13:41:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 80/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 83/189 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 6 (OVERLAPS) 164/353 variables, 30/43 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-20 13:41:55] [INFO ] Deduced a trap composed of 24 places in 387 ms of which 62 ms to minimize.
[2024-05-20 13:41:55] [INFO ] Deduced a trap composed of 52 places in 397 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 2/45 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 8/361 variables, 4/49 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-20 13:41:56] [INFO ] Deduced a trap composed of 55 places in 376 ms of which 13 ms to minimize.
[2024-05-20 13:41:56] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 3 ms to minimize.
[2024-05-20 13:41:57] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 3/52 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-20 13:41:57] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 3 ms to minimize.
[2024-05-20 13:41:57] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 2/54 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 689/1050 variables, 361/415 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1050 variables, 0/415 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/1050 variables, 0/415 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1050/1050 variables, and 415 constraints, problems are : Problem set: 1 solved, 12 unsolved in 4663 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 50/72 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 114/186 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-20 13:41:59] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 167/353 variables, 30/44 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/46 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-20 13:41:59] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2024-05-20 13:41:59] [INFO ] Deduced a trap composed of 115 places in 224 ms of which 4 ms to minimize.
[2024-05-20 13:42:00] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-05-20 13:42:00] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2024-05-20 13:42:00] [INFO ] Deduced a trap composed of 85 places in 195 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 5/51 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 8/361 variables, 4/55 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 5/60 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-20 13:42:01] [INFO ] Deduced a trap composed of 90 places in 200 ms of which 3 ms to minimize.
[2024-05-20 13:42:01] [INFO ] Deduced a trap composed of 113 places in 237 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-20 13:42:01] [INFO ] Deduced a trap composed of 113 places in 266 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 16 (OVERLAPS) 689/1050 variables, 361/424 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1050 variables, 2/426 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1050 variables, 0/426 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1050 variables, 0/426 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1050/1050 variables, and 426 constraints, problems are : Problem set: 11 solved, 2 unsolved in 4277 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 16/16 constraints]
After SMT, in 9053ms problems are : Problem set: 11 solved, 2 unsolved
Parikh walk visited 0 properties in 880 ms.
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 689/689 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 361 transition count 642
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 314 transition count 642
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 94 place count 314 transition count 607
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 176 place count 267 transition count 607
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 2 with 1 rules applied. Total rules applied 177 place count 267 transition count 606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 178 place count 266 transition count 606
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 182 place count 262 transition count 589
Iterating global reduction 4 with 4 rules applied. Total rules applied 186 place count 262 transition count 589
Discarding 4 places :
Implicit places reduction removed 4 places
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 4 with 5 rules applied. Total rules applied 191 place count 258 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 192 place count 257 transition count 588
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 196 place count 253 transition count 577
Iterating global reduction 6 with 4 rules applied. Total rules applied 200 place count 253 transition count 577
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 203 place count 250 transition count 567
Iterating global reduction 6 with 3 rules applied. Total rules applied 206 place count 250 transition count 567
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 209 place count 247 transition count 557
Iterating global reduction 6 with 3 rules applied. Total rules applied 212 place count 247 transition count 557
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 214 place count 247 transition count 555
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 215 place count 246 transition count 547
Iterating global reduction 7 with 1 rules applied. Total rules applied 216 place count 246 transition count 547
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 217 place count 245 transition count 539
Iterating global reduction 7 with 1 rules applied. Total rules applied 218 place count 245 transition count 539
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 219 place count 244 transition count 531
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 244 transition count 531
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 221 place count 243 transition count 523
Iterating global reduction 7 with 1 rules applied. Total rules applied 222 place count 243 transition count 523
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 223 place count 242 transition count 515
Iterating global reduction 7 with 1 rules applied. Total rules applied 224 place count 242 transition count 515
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 225 place count 241 transition count 507
Iterating global reduction 7 with 1 rules applied. Total rules applied 226 place count 241 transition count 507
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 227 place count 240 transition count 499
Iterating global reduction 7 with 1 rules applied. Total rules applied 228 place count 240 transition count 499
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 229 place count 239 transition count 491
Iterating global reduction 7 with 1 rules applied. Total rules applied 230 place count 239 transition count 491
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 231 place count 238 transition count 483
Iterating global reduction 7 with 1 rules applied. Total rules applied 232 place count 238 transition count 483
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 233 place count 237 transition count 475
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 237 transition count 475
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 235 place count 236 transition count 467
Iterating global reduction 7 with 1 rules applied. Total rules applied 236 place count 236 transition count 467
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 237 place count 235 transition count 459
Iterating global reduction 7 with 1 rules applied. Total rules applied 238 place count 235 transition count 459
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 239 place count 234 transition count 451
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 234 transition count 451
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 59 rules applied. Total rules applied 299 place count 204 transition count 422
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 301 place count 202 transition count 420
Iterating global reduction 7 with 2 rules applied. Total rules applied 303 place count 202 transition count 420
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 303 place count 202 transition count 419
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 305 place count 201 transition count 419
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 307 place count 201 transition count 417
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 309 place count 199 transition count 417
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 315 place count 199 transition count 411
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 321 place count 193 transition count 411
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 327 place count 193 transition count 411
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 328 place count 192 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 329 place count 191 transition count 410
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 329 place count 191 transition count 408
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 334 place count 188 transition count 408
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 335 place count 187 transition count 407
Iterating global reduction 10 with 1 rules applied. Total rules applied 336 place count 187 transition count 407
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 337 place count 187 transition count 406
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 339 place count 186 transition count 405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 340 place count 186 transition count 404
Applied a total of 340 rules in 379 ms. Remains 186 /361 variables (removed 175) and now considering 404/689 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 381 ms. Remains : 186/361 places, 404/689 transitions.
RANDOM walk for 40000 steps (1028 resets) in 729 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (523 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (527 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5571 steps, run visited all 2 properties in 71 ms. (steps per millisecond=78 )
Probabilistic random walk after 5571 steps, saw 2116 distinct states, run finished after 76 ms. (steps per millisecond=73 ) properties seen :2
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
FORMULA ASLink-PT-01a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-01a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 689/689 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 360 transition count 641
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 312 transition count 641
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 95 place count 312 transition count 603
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 183 place count 262 transition count 603
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 187 place count 261 transition count 600
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 190 place count 258 transition count 600
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 195 place count 253 transition count 582
Iterating global reduction 4 with 5 rules applied. Total rules applied 200 place count 253 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
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 4 with 6 rules applied. Total rules applied 206 place count 249 transition count 580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 207 place count 248 transition count 580
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 211 place count 244 transition count 569
Iterating global reduction 6 with 4 rules applied. Total rules applied 215 place count 244 transition count 569
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 218 place count 241 transition count 559
Iterating global reduction 6 with 3 rules applied. Total rules applied 221 place count 241 transition count 559
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 224 place count 238 transition count 549
Iterating global reduction 6 with 3 rules applied. Total rules applied 227 place count 238 transition count 549
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 229 place count 238 transition count 547
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 230 place count 237 transition count 539
Iterating global reduction 7 with 1 rules applied. Total rules applied 231 place count 237 transition count 539
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 232 place count 236 transition count 531
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 236 transition count 531
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 234 place count 235 transition count 523
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 235 transition count 523
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 236 place count 234 transition count 515
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 234 transition count 515
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 238 place count 233 transition count 507
Iterating global reduction 7 with 1 rules applied. Total rules applied 239 place count 233 transition count 507
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 240 place count 232 transition count 499
Iterating global reduction 7 with 1 rules applied. Total rules applied 241 place count 232 transition count 499
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 242 place count 231 transition count 491
Iterating global reduction 7 with 1 rules applied. Total rules applied 243 place count 231 transition count 491
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 244 place count 230 transition count 483
Iterating global reduction 7 with 1 rules applied. Total rules applied 245 place count 230 transition count 483
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 246 place count 229 transition count 475
Iterating global reduction 7 with 1 rules applied. Total rules applied 247 place count 229 transition count 475
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 248 place count 228 transition count 467
Iterating global reduction 7 with 1 rules applied. Total rules applied 249 place count 228 transition count 467
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 250 place count 227 transition count 459
Iterating global reduction 7 with 1 rules applied. Total rules applied 251 place count 227 transition count 459
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 252 place count 226 transition count 451
Iterating global reduction 7 with 1 rules applied. Total rules applied 253 place count 226 transition count 451
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 254 place count 225 transition count 443
Iterating global reduction 7 with 1 rules applied. Total rules applied 255 place count 225 transition count 443
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 57 rules applied. Total rules applied 312 place count 196 transition count 415
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 314 place count 194 transition count 413
Iterating global reduction 7 with 2 rules applied. Total rules applied 316 place count 194 transition count 413
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 316 place count 194 transition count 412
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 318 place count 193 transition count 412
Applied a total of 318 rules in 177 ms. Remains 193 /361 variables (removed 168) and now considering 412/689 (removed 277) transitions.
// Phase 1: matrix 412 rows 193 cols
[2024-05-20 13:42:05] [INFO ] Computed 28 invariants in 4 ms
[2024-05-20 13:42:05] [INFO ] Implicit Places using invariants in 223 ms returned [20, 73, 111, 123, 124, 162, 183, 189]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 227 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/361 places, 412/689 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 185 transition count 402
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 175 transition count 402
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 20 place count 175 transition count 397
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 170 transition count 397
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 33 place count 169 transition count 395
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 167 transition count 395
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 166 transition count 394
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 166 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 38 place count 166 transition count 393
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 46 place count 162 transition count 389
Applied a total of 46 rules in 38 ms. Remains 162 /185 variables (removed 23) and now considering 389/412 (removed 23) transitions.
// Phase 1: matrix 389 rows 162 cols
[2024-05-20 13:42:05] [INFO ] Computed 19 invariants in 4 ms
[2024-05-20 13:42:05] [INFO ] Implicit Places using invariants in 184 ms returned [86, 92, 97]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 186 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 159/361 places, 389/689 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 157 transition count 387
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 157 transition count 387
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 155 transition count 385
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 155 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 154 transition count 384
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 154 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 153 transition count 383
Applied a total of 12 rules in 26 ms. Remains 153 /159 variables (removed 6) and now considering 383/389 (removed 6) transitions.
// Phase 1: matrix 383 rows 153 cols
[2024-05-20 13:42:05] [INFO ] Computed 16 invariants in 5 ms
[2024-05-20 13:42:05] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-20 13:42:05] [INFO ] Invariant cache hit.
[2024-05-20 13:42:06] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 153/361 places, 383/689 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1225 ms. Remains : 153/361 places, 383/689 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-01a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-00 finished in 1498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((G(p1)&&p0))) U (false U p1)))'
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 689/689 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 360 transition count 641
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 312 transition count 641
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 95 place count 312 transition count 603
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 183 place count 262 transition count 603
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 187 place count 261 transition count 600
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 190 place count 258 transition count 600
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 194 place count 254 transition count 591
Iterating global reduction 4 with 4 rules applied. Total rules applied 198 place count 254 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 3 rules applied. Total rules applied 201 place count 253 transition count 589
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 202 place count 252 transition count 589
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 202 place count 252 transition count 588
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 204 place count 251 transition count 588
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 205 place count 250 transition count 587
Iterating global reduction 6 with 1 rules applied. Total rules applied 206 place count 250 transition count 587
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 55 rules applied. Total rules applied 261 place count 222 transition count 560
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 263 place count 220 transition count 558
Iterating global reduction 6 with 2 rules applied. Total rules applied 265 place count 220 transition count 558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 265 place count 220 transition count 557
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 267 place count 219 transition count 557
Applied a total of 267 rules in 55 ms. Remains 219 /361 variables (removed 142) and now considering 557/689 (removed 132) transitions.
// Phase 1: matrix 557 rows 219 cols
[2024-05-20 13:42:06] [INFO ] Computed 31 invariants in 5 ms
[2024-05-20 13:42:06] [INFO ] Implicit Places using invariants in 301 ms returned [20, 73, 111, 123, 124, 178, 199, 203, 207, 211, 215]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 304 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 208/361 places, 557/689 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 208 transition count 550
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 201 transition count 550
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 201 transition count 545
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 196 transition count 545
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 194 transition count 543
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 194 transition count 543
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 193 transition count 541
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 193 transition count 541
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 193 transition count 540
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 183 transition count 530
Applied a total of 51 rules in 34 ms. Remains 183 /208 variables (removed 25) and now considering 530/557 (removed 27) transitions.
// Phase 1: matrix 530 rows 183 cols
[2024-05-20 13:42:06] [INFO ] Computed 20 invariants in 8 ms
[2024-05-20 13:42:07] [INFO ] Implicit Places using invariants in 283 ms returned [86, 92, 97, 176]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 286 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 179/361 places, 530/689 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 177 transition count 528
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 177 transition count 528
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 175 transition count 526
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 175 transition count 526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 174 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 174 transition count 525
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 172 transition count 523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 171 transition count 521
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 171 transition count 521
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 171 transition count 520
Applied a total of 17 rules in 33 ms. Remains 171 /179 variables (removed 8) and now considering 520/530 (removed 10) transitions.
// Phase 1: matrix 520 rows 171 cols
[2024-05-20 13:42:07] [INFO ] Computed 16 invariants in 6 ms
[2024-05-20 13:42:07] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-20 13:42:07] [INFO ] Invariant cache hit.
[2024-05-20 13:42:08] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 171/361 places, 520/689 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1467 ms. Remains : 171/361 places, 520/689 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-01
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-01a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-01 finished in 1638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 689/689 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 359 transition count 674
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 359 transition count 674
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 358 transition count 666
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 358 transition count 666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 357 transition count 658
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 357 transition count 658
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 356 transition count 650
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 356 transition count 650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 355 transition count 642
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 355 transition count 642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 354 transition count 634
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 354 transition count 634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 353 transition count 626
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 353 transition count 626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 352 transition count 618
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 352 transition count 618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 351 transition count 610
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 351 transition count 610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 350 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 350 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 349 transition count 594
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 349 transition count 594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 348 transition count 586
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 348 transition count 586
Applied a total of 26 rules in 69 ms. Remains 348 /361 variables (removed 13) and now considering 586/689 (removed 103) transitions.
// Phase 1: matrix 586 rows 348 cols
[2024-05-20 13:42:08] [INFO ] Computed 47 invariants in 5 ms
[2024-05-20 13:42:08] [INFO ] Implicit Places using invariants in 279 ms returned [29, 211, 212, 256]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 281 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 344/361 places, 586/689 transitions.
Applied a total of 0 rules in 5 ms. Remains 344 /344 variables (removed 0) and now considering 586/586 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 356 ms. Remains : 344/361 places, 586/689 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-04 finished in 516 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(p1)||p0)))'
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 689/689 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 360 transition count 641
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 312 transition count 641
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 95 place count 312 transition count 603
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 183 place count 262 transition count 603
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 187 place count 261 transition count 600
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 190 place count 258 transition count 600
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 195 place count 253 transition count 582
Iterating global reduction 4 with 5 rules applied. Total rules applied 200 place count 253 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
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 4 with 6 rules applied. Total rules applied 206 place count 249 transition count 580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 207 place count 248 transition count 580
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 207 place count 248 transition count 579
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 209 place count 247 transition count 579
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 213 place count 243 transition count 568
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 243 transition count 568
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 219 place count 241 transition count 566
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 241 transition count 566
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 223 place count 239 transition count 564
Iterating global reduction 6 with 2 rules applied. Total rules applied 225 place count 239 transition count 564
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 227 place count 239 transition count 562
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 57 rules applied. Total rules applied 284 place count 210 transition count 534
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 286 place count 208 transition count 532
Iterating global reduction 7 with 2 rules applied. Total rules applied 288 place count 208 transition count 532
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 288 place count 208 transition count 531
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 290 place count 207 transition count 531
Applied a total of 290 rules in 104 ms. Remains 207 /361 variables (removed 154) and now considering 531/689 (removed 158) transitions.
// Phase 1: matrix 531 rows 207 cols
[2024-05-20 13:42:08] [INFO ] Computed 28 invariants in 5 ms
[2024-05-20 13:42:09] [INFO ] Implicit Places using invariants in 292 ms returned [20, 73, 111, 123, 124, 176, 197, 203]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 296 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/361 places, 531/689 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 199 transition count 521
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 189 transition count 521
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 20 place count 189 transition count 516
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 184 transition count 516
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 33 place count 183 transition count 514
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 181 transition count 514
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 180 transition count 513
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 180 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 38 place count 180 transition count 512
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 46 place count 176 transition count 508
Applied a total of 46 rules in 36 ms. Remains 176 /199 variables (removed 23) and now considering 508/531 (removed 23) transitions.
// Phase 1: matrix 508 rows 176 cols
[2024-05-20 13:42:09] [INFO ] Computed 19 invariants in 4 ms
[2024-05-20 13:42:09] [INFO ] Implicit Places using invariants in 213 ms returned [86, 92, 97]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 216 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 173/361 places, 508/689 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 171 transition count 506
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 171 transition count 506
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 169 transition count 504
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 169 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 168 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 168 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 167 transition count 502
Applied a total of 12 rules in 19 ms. Remains 167 /173 variables (removed 6) and now considering 502/508 (removed 6) transitions.
// Phase 1: matrix 502 rows 167 cols
[2024-05-20 13:42:09] [INFO ] Computed 16 invariants in 5 ms
[2024-05-20 13:42:09] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-20 13:42:09] [INFO ] Invariant cache hit.
[2024-05-20 13:42:10] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 167/361 places, 502/689 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1395 ms. Remains : 167/361 places, 502/689 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-07
Product exploration explored 100000 steps with 3411 reset in 526 ms.
Product exploration explored 100000 steps with 3418 reset in 490 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 458 steps (15 resets) in 9 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 502/502 transitions.
Applied a total of 0 rules in 14 ms. Remains 167 /167 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-05-20 13:42:11] [INFO ] Invariant cache hit.
[2024-05-20 13:42:12] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-20 13:42:12] [INFO ] Invariant cache hit.
[2024-05-20 13:42:12] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2024-05-20 13:42:12] [INFO ] Redundant transitions in 36 ms returned []
Running 491 sub problems to find dead transitions.
[2024-05-20 13:42:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (OVERLAPS) 1/167 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-20 13:42:24] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 3 ms to minimize.
[2024-05-20 13:42:26] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 7 (OVERLAPS) 502/669 variables, 167/185 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-20 13:42:40] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 669/669 variables, and 186 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 491 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (OVERLAPS) 1/167 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
At refinement iteration 7 (OVERLAPS) 502/669 variables, 167/186 constraints. Problems are: Problem set: 329 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 162/348 constraints. Problems are: Problem set: 329 solved, 162 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/669 variables, and 348 constraints, problems are : Problem set: 329 solved, 162 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 162/491 constraints, Known Traps: 3/3 constraints]
After SMT, in 60826ms problems are : Problem set: 329 solved, 162 unsolved
Search for dead transitions found 329 dead transitions in 60843ms
Found 329 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 329 transitions
Dead transitions reduction (with SMT) removed 329 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 167/167 places, 173/502 transitions.
Ensure Unique test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 151 transition count 158
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 136 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 135 transition count 157
Applied a total of 32 rules in 9 ms. Remains 135 /167 variables (removed 32) and now considering 157/173 (removed 16) transitions.
// Phase 1: matrix 157 rows 135 cols
[2024-05-20 13:43:13] [INFO ] Computed 28 invariants in 1 ms
[2024-05-20 13:43:13] [INFO ] Implicit Places using invariants in 174 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 176 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/167 places, 157/502 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 122 transition count 133
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 98 transition count 133
Applied a total of 48 rules in 4 ms. Remains 98 /122 variables (removed 24) and now considering 133/157 (removed 24) transitions.
// Phase 1: matrix 133 rows 98 cols
[2024-05-20 13:43:13] [INFO ] Computed 15 invariants in 1 ms
[2024-05-20 13:43:13] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-20 13:43:13] [INFO ] Invariant cache hit.
[2024-05-20 13:43:14] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 98/167 places, 133/502 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 62442 ms. Remains : 98/167 places, 133/502 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 317 steps (16 resets) in 5 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5458 reset in 123 ms.
Product exploration explored 100000 steps with 5579 reset in 277 ms.
Built C files in :
/tmp/ltsmin4009099663669700457
[2024-05-20 13:43:15] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2024-05-20 13:43:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 13:43:15] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2024-05-20 13:43:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 13:43:15] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2024-05-20 13:43:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 13:43:15] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4009099663669700457
Running compilation step : cd /tmp/ltsmin4009099663669700457;'/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 1027 ms.
Running link step : cd /tmp/ltsmin4009099663669700457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin4009099663669700457;'/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/stateBased15468874761482743627.hoa' '--buchi-type=spotba'
LTSmin run took 6397 ms.
FORMULA ASLink-PT-01a-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-01a-LTLFireability-07 finished in 74069 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 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 689/689 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 358 transition count 673
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 358 transition count 673
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 356 transition count 664
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 356 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 355 transition count 656
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 355 transition count 656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 354 transition count 648
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 354 transition count 648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 353 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 353 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 352 transition count 632
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 352 transition count 632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 351 transition count 624
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 351 transition count 624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 350 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 350 transition count 616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 349 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 349 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 348 transition count 600
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 348 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 347 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 347 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 346 transition count 584
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 346 transition count 584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 345 transition count 576
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 345 transition count 576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 344 transition count 568
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 344 transition count 568
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 343 transition count 560
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 343 transition count 560
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 342 transition count 552
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 342 transition count 552
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 341 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 341 transition count 544
Applied a total of 40 rules in 122 ms. Remains 341 /361 variables (removed 20) and now considering 544/689 (removed 145) transitions.
// Phase 1: matrix 544 rows 341 cols
[2024-05-20 13:43:22] [INFO ] Computed 47 invariants in 8 ms
[2024-05-20 13:43:23] [INFO ] Implicit Places using invariants in 522 ms returned [29, 211, 231, 251]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 524 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 337/361 places, 544/689 transitions.
Applied a total of 0 rules in 4 ms. Remains 337 /337 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 650 ms. Remains : 337/361 places, 544/689 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 36 steps with 1 reset in 0 ms.
FORMULA ASLink-PT-01a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-08 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(!p0)))'
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 689/689 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 358 transition count 673
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 358 transition count 673
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 356 transition count 664
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 356 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 355 transition count 656
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 355 transition count 656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 354 transition count 648
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 354 transition count 648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 353 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 353 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 352 transition count 632
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 352 transition count 632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 351 transition count 624
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 351 transition count 624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 350 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 350 transition count 616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 349 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 349 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 348 transition count 600
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 348 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 347 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 347 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 346 transition count 584
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 346 transition count 584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 345 transition count 576
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 345 transition count 576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 344 transition count 568
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 344 transition count 568
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 343 transition count 560
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 343 transition count 560
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 342 transition count 552
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 342 transition count 552
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 341 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 341 transition count 544
Applied a total of 40 rules in 72 ms. Remains 341 /361 variables (removed 20) and now considering 544/689 (removed 145) transitions.
[2024-05-20 13:43:23] [INFO ] Invariant cache hit.
[2024-05-20 13:43:24] [INFO ] Implicit Places using invariants in 443 ms returned [29, 211, 212, 231, 251]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 444 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 336/361 places, 544/689 transitions.
Applied a total of 0 rules in 4 ms. Remains 336 /336 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 521 ms. Remains : 336/361 places, 544/689 transitions.
Stuttering acceptance computed with spot in 154 ms :[p0, true, p0, p0]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-12
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-12 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 689/689 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 358 transition count 673
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 358 transition count 673
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 356 transition count 664
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 356 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 355 transition count 656
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 355 transition count 656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 354 transition count 648
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 354 transition count 648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 353 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 353 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 352 transition count 632
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 352 transition count 632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 351 transition count 624
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 351 transition count 624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 350 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 350 transition count 616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 349 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 349 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 348 transition count 600
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 348 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 347 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 347 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 346 transition count 584
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 346 transition count 584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 345 transition count 576
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 345 transition count 576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 344 transition count 568
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 344 transition count 568
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 343 transition count 560
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 343 transition count 560
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 342 transition count 552
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 342 transition count 552
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 341 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 341 transition count 544
Applied a total of 40 rules in 74 ms. Remains 341 /361 variables (removed 20) and now considering 544/689 (removed 145) transitions.
[2024-05-20 13:43:24] [INFO ] Invariant cache hit.
[2024-05-20 13:43:24] [INFO ] Implicit Places using invariants in 324 ms returned [29, 231, 251]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 330 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 338/361 places, 544/689 transitions.
Applied a total of 0 rules in 4 ms. Remains 338 /338 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 410 ms. Remains : 338/361 places, 544/689 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-15 finished in 577 ms.
All properties solved by simple procedures.
Total runtime 98521 ms.

BK_STOP 1716212604890

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

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