fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r021-smll-171620127700008
Last Updated
July 7, 2024

About the Execution of 2023-gold for ASLink-PT-01a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1345.468 65078.00 170303.00 651.90 FFTFFTFTFTFTFFTF normal

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.r021-smll-171620127700008.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 gold2023
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 r021-smll-171620127700008
=====================================================================

--------------------
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 1716364139406

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 07:49:01] [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-22 07:49:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:49:02] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-05-22 07:49:02] [INFO ] Transformed 431 places.
[2024-05-22 07:49:02] [INFO ] Transformed 735 transitions.
[2024-05-22 07:49:02] [INFO ] Found NUPN structural information;
[2024-05-22 07:49:02] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 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 100 ms. Remains 420 /431 variables (removed 11) and now considering 722/728 (removed 6) transitions.
// Phase 1: matrix 722 rows 420 cols
[2024-05-22 07:49:02] [INFO ] Computed 73 invariants in 39 ms
[2024-05-22 07:49:03] [INFO ] Implicit Places using invariants in 780 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 822 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 99 ms. Remains 361 /394 variables (removed 33) and now considering 689/722 (removed 33) transitions.
// Phase 1: matrix 689 rows 361 cols
[2024-05-22 07:49:03] [INFO ] Computed 47 invariants in 18 ms
[2024-05-22 07:49:03] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-22 07:49:03] [INFO ] Invariant cache hit.
[2024-05-22 07:49:04] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1029 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 2050 ms. Remains : 361/431 places, 689/728 transitions.
Support contains 52 out of 361 places after structural reductions.
[2024-05-22 07:49:04] [INFO ] Flatten gal took : 123 ms
[2024-05-22 07:49:04] [INFO ] Flatten gal took : 68 ms
[2024-05-22 07:49:04] [INFO ] Input system was already deterministic with 689 transitions.
Support contains 47 out of 361 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 25) seen :11
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-22 07:49:07] [INFO ] Invariant cache hit.
[2024-05-22 07:49:07] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-22 07:49:07] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 18 ms returned sat
[2024-05-22 07:49:07] [INFO ] After 707ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-22 07:49:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-22 07:49:08] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 16 ms returned sat
[2024-05-22 07:49:09] [INFO ] After 1326ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :2
[2024-05-22 07:49:09] [INFO ] Deduced a trap composed of 51 places in 248 ms of which 7 ms to minimize.
[2024-05-22 07:49:10] [INFO ] Deduced a trap composed of 99 places in 258 ms of which 1 ms to minimize.
[2024-05-22 07:49:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 642 ms
[2024-05-22 07:49:10] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 1 ms to minimize.
[2024-05-22 07:49:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-22 07:49:10] [INFO ] After 2343ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-22 07:49:10] [INFO ] After 2767ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :2
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 36 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 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 1 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 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 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 2 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 2 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 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 2 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 2 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 338 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 339 ms. Remains : 186/361 places, 404/689 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5571 steps, run visited all 2 properties in 80 ms. (steps per millisecond=69 )
Probabilistic random walk after 5571 steps, saw 2116 distinct states, run finished after 81 ms. (steps per millisecond=68 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
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.202304061127/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 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 3 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 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 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 1 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-22 07:49:11] [INFO ] Computed 28 invariants in 7 ms
[2024-05-22 07:49:12] [INFO ] Implicit Places using invariants in 218 ms returned [20, 73, 111, 123, 124, 162, 183, 189]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 221 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/361 places, 412/689 transitions.
Drop transitions 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 2 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 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 2 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 33 ms. Remains 162 /185 variables (removed 23) and now considering 389/412 (removed 23) transitions.
// Phase 1: matrix 389 rows 162 cols
[2024-05-22 07:49:12] [INFO ] Computed 19 invariants in 6 ms
[2024-05-22 07:49:12] [INFO ] Implicit Places using invariants in 166 ms returned [86, 92, 97]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 169 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 30 ms. Remains 153 /159 variables (removed 6) and now considering 383/389 (removed 6) transitions.
// Phase 1: matrix 383 rows 153 cols
[2024-05-22 07:49:12] [INFO ] Computed 16 invariants in 6 ms
[2024-05-22 07:49:12] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 07:49:12] [INFO ] Invariant cache hit.
[2024-05-22 07:49:12] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 620 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 1252 ms. Remains : 153/361 places, 383/689 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 206 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s92 1) (EQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-01a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-00 finished in 1519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 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 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 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 0 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 1 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 54 ms. Remains 219 /361 variables (removed 142) and now considering 557/689 (removed 132) transitions.
// Phase 1: matrix 557 rows 219 cols
[2024-05-22 07:49:13] [INFO ] Computed 31 invariants in 5 ms
[2024-05-22 07:49:13] [INFO ] Implicit Places using invariants in 233 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 239 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 208/361 places, 557/689 transitions.
Drop transitions 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 1 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 28 ms. Remains 183 /208 variables (removed 25) and now considering 530/557 (removed 27) transitions.
// Phase 1: matrix 530 rows 183 cols
[2024-05-22 07:49:13] [INFO ] Computed 20 invariants in 5 ms
[2024-05-22 07:49:13] [INFO ] Implicit Places using invariants in 198 ms returned [86, 92, 97, 176]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 204 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-22 07:49:13] [INFO ] Computed 16 invariants in 5 ms
[2024-05-22 07:49:13] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 07:49:13] [INFO ] Invariant cache hit.
[2024-05-22 07:49:14] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 621 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 1181 ms. Remains : 171/361 places, 520/689 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s100 1) (EQ s169 1)), p0:(AND (EQ s96 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 26 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 1339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 106 ms. Remains 348 /361 variables (removed 13) and now considering 586/689 (removed 103) transitions.
// Phase 1: matrix 586 rows 348 cols
[2024-05-22 07:49:14] [INFO ] Computed 47 invariants in 5 ms
[2024-05-22 07:49:14] [INFO ] Implicit Places using invariants in 268 ms returned [29, 211, 212, 256]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 271 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 9 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 386 ms. Remains : 344/361 places, 586/689 transitions.
Stuttering acceptance computed with spot in 132 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 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s233 0) (EQ s287 0)), p0:(AND (EQ s41 1) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
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 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 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 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 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 0 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 1 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 81 ms. Remains 207 /361 variables (removed 154) and now considering 531/689 (removed 158) transitions.
// Phase 1: matrix 531 rows 207 cols
[2024-05-22 07:49:15] [INFO ] Computed 28 invariants in 5 ms
[2024-05-22 07:49:15] [INFO ] Implicit Places using invariants in 208 ms returned [20, 73, 111, 123, 124, 176, 197, 203]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 210 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/361 places, 531/689 transitions.
Drop transitions 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 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 0 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 25 ms. Remains 176 /199 variables (removed 23) and now considering 508/531 (removed 23) transitions.
// Phase 1: matrix 508 rows 176 cols
[2024-05-22 07:49:15] [INFO ] Computed 19 invariants in 5 ms
[2024-05-22 07:49:15] [INFO ] Implicit Places using invariants in 191 ms returned [86, 92, 97]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 194 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 1 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 23 ms. Remains 167 /173 variables (removed 6) and now considering 502/508 (removed 6) transitions.
// Phase 1: matrix 502 rows 167 cols
[2024-05-22 07:49:15] [INFO ] Computed 16 invariants in 5 ms
[2024-05-22 07:49:15] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 07:49:15] [INFO ] Invariant cache hit.
[2024-05-22 07:49:16] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 593 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 1127 ms. Remains : 167/361 places, 502/689 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s22 0) (EQ s117 0)), p1:(OR (EQ s22 0) (EQ s117 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3421 reset in 351 ms.
Product exploration explored 100000 steps with 3451 reset in 288 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 92 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 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 147 steps, including 4 resets, run visited all 2 properties in 5 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 121 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 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 69 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 8 ms. Remains 167 /167 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-05-22 07:49:17] [INFO ] Invariant cache hit.
[2024-05-22 07:49:17] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 07:49:17] [INFO ] Invariant cache hit.
[2024-05-22 07:49:17] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2024-05-22 07:49:17] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-22 07:49:17] [INFO ] Invariant cache hit.
[2024-05-22 07:49:18] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 947 ms. Remains : 167/167 places, 502/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 80 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 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 32 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 120 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 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3392 reset in 176 ms.
Product exploration explored 100000 steps with 3451 reset in 249 ms.
Built C files in :
/tmp/ltsmin2457481903960329392
[2024-05-22 07:49:19] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2024-05-22 07:49:19] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:49:19] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2024-05-22 07:49:19] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:49:19] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2024-05-22 07:49:19] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:49:19] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2457481903960329392
Running compilation step : cd /tmp/ltsmin2457481903960329392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1734 ms.
Running link step : cd /tmp/ltsmin2457481903960329392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin2457481903960329392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1558521951204084593.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 7 ms. Remains 167 /167 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-05-22 07:49:34] [INFO ] Invariant cache hit.
[2024-05-22 07:49:34] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-22 07:49:34] [INFO ] Invariant cache hit.
[2024-05-22 07:49:35] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-22 07:49:35] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-22 07:49:35] [INFO ] Invariant cache hit.
[2024-05-22 07:49:35] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 987 ms. Remains : 167/167 places, 502/502 transitions.
Built C files in :
/tmp/ltsmin7303109092981355659
[2024-05-22 07:49:35] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2024-05-22 07:49:35] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:49:35] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2024-05-22 07:49:35] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:49:35] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2024-05-22 07:49:35] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:49:35] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7303109092981355659
Running compilation step : cd /tmp/ltsmin7303109092981355659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1563 ms.
Running link step : cd /tmp/ltsmin7303109092981355659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7303109092981355659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2358706679146886850.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 07:49:50] [INFO ] Flatten gal took : 44 ms
[2024-05-22 07:49:50] [INFO ] Flatten gal took : 39 ms
[2024-05-22 07:49:50] [INFO ] Time to serialize gal into /tmp/LTL13767741610941999845.gal : 7 ms
[2024-05-22 07:49:50] [INFO ] Time to serialize properties into /tmp/LTL17334491725152212063.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13767741610941999845.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7662527974821222018.hoa' '-atoms' '/tmp/LTL17334491725152212063.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17334491725152212063.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7662527974821222018.hoa
Reverse transition relation is NOT exact ! Due to transitions t390, t518, t557.t559.t17.t560.t11.t76.t74.t75.t10, t571.t88.t89.t572, t643.t642, t645.t644, ...885
Computing Next relation with stutter on 4842 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1047 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.5573,230792,1,0,317,419711,708,174,11700,385913,729
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ASLink-PT-01a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ASLink-PT-01a-LTLFireability-07 finished in 46845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 82 ms. Remains 341 /361 variables (removed 20) and now considering 544/689 (removed 145) transitions.
// Phase 1: matrix 544 rows 341 cols
[2024-05-22 07:50:01] [INFO ] Computed 47 invariants in 5 ms
[2024-05-22 07:50:02] [INFO ] Implicit Places using invariants in 274 ms returned [29, 211, 231, 251]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 276 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 6 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 364 ms. Remains : 337/361 places, 544/689 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s210 0) (EQ s309 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1220 steps with 17 reset in 5 ms.
FORMULA ASLink-PT-01a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-08 finished in 467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 91 ms. Remains 341 /361 variables (removed 20) and now considering 544/689 (removed 145) transitions.
[2024-05-22 07:50:02] [INFO ] Invariant cache hit.
[2024-05-22 07:50:02] [INFO ] Implicit Places using invariants in 258 ms returned [29, 211, 212, 231, 251]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 260 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 356 ms. Remains : 336/361 places, 544/689 transitions.
Stuttering acceptance computed with spot in 119 ms :[p0, true, p0, p0]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(NEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 7 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 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 88 ms. Remains 341 /361 variables (removed 20) and now considering 544/689 (removed 145) transitions.
[2024-05-22 07:50:02] [INFO ] Invariant cache hit.
[2024-05-22 07:50:03] [INFO ] Implicit Places using invariants in 298 ms returned [29, 231, 251]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 299 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 393 ms. Remains : 338/361 places, 544/689 transitions.
Stuttering acceptance computed with spot in 111 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 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s127 1) (EQ s130 1) (EQ s133 1) (EQ s210 1)), p1:(AND (EQ s211 1) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-01a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-15 finished in 524 ms.
All properties solved by simple procedures.
Total runtime 61501 ms.

BK_STOP 1716364204484

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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 gold2023"
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 r021-smll-171620127700008"
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 ;