fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r005-oct2-167813592600028
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ASLink-PT-02a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1541.855 74220.00 129818.00 22.60 FFTFTFTFTFFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592600028.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592600028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 13:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 279K Mar 5 18:22 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-02a-LTLFireability-00
FORMULA_NAME ASLink-PT-02a-LTLFireability-01
FORMULA_NAME ASLink-PT-02a-LTLFireability-02
FORMULA_NAME ASLink-PT-02a-LTLFireability-03
FORMULA_NAME ASLink-PT-02a-LTLFireability-04
FORMULA_NAME ASLink-PT-02a-LTLFireability-05
FORMULA_NAME ASLink-PT-02a-LTLFireability-06
FORMULA_NAME ASLink-PT-02a-LTLFireability-07
FORMULA_NAME ASLink-PT-02a-LTLFireability-08
FORMULA_NAME ASLink-PT-02a-LTLFireability-09
FORMULA_NAME ASLink-PT-02a-LTLFireability-10
FORMULA_NAME ASLink-PT-02a-LTLFireability-11
FORMULA_NAME ASLink-PT-02a-LTLFireability-12
FORMULA_NAME ASLink-PT-02a-LTLFireability-13
FORMULA_NAME ASLink-PT-02a-LTLFireability-14
FORMULA_NAME ASLink-PT-02a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678485932473

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 22:05:34] [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]
[2023-03-10 22:05:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:05:34] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-10 22:05:34] [INFO ] Transformed 626 places.
[2023-03-10 22:05:34] [INFO ] Transformed 1008 transitions.
[2023-03-10 22:05:34] [INFO ] Found NUPN structural information;
[2023-03-10 22:05:34] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 614 transition count 998
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 607 transition count 973
Ensure Unique test removed 1 places
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 606 transition count 973
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 606 transition count 971
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 605 transition count 963
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 605 transition count 963
Applied a total of 31 rules in 122 ms. Remains 605 /626 variables (removed 21) and now considering 963/998 (removed 35) transitions.
// Phase 1: matrix 963 rows 605 cols
[2023-03-10 22:05:35] [INFO ] Computed 105 place invariants in 60 ms
[2023-03-10 22:05:35] [INFO ] Implicit Places using invariants in 604 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 220, 221, 239, 257, 386, 391, 403, 409, 410, 445, 448, 466, 467, 468, 469, 486, 494, 502, 508, 514, 520, 526, 534, 540, 546, 554]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 639 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 570/626 places, 963/998 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 557 transition count 950
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 557 transition count 950
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 547 transition count 940
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 547 transition count 940
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 542 transition count 935
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 542 transition count 935
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 540 transition count 933
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 540 transition count 933
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 538 transition count 931
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 538 transition count 931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 537 transition count 930
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 537 transition count 930
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 536 transition count 929
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 536 transition count 929
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 535 transition count 928
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 535 transition count 928
Applied a total of 70 rules in 160 ms. Remains 535 /570 variables (removed 35) and now considering 928/963 (removed 35) transitions.
// Phase 1: matrix 928 rows 535 cols
[2023-03-10 22:05:35] [INFO ] Computed 70 place invariants in 29 ms
[2023-03-10 22:05:36] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-10 22:05:36] [INFO ] Invariant cache hit.
[2023-03-10 22:05:37] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 535/626 places, 928/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2348 ms. Remains : 535/626 places, 928/998 transitions.
Support contains 56 out of 535 places after structural reductions.
[2023-03-10 22:05:37] [INFO ] Flatten gal took : 112 ms
[2023-03-10 22:05:37] [INFO ] Flatten gal took : 56 ms
[2023-03-10 22:05:37] [INFO ] Input system was already deterministic with 928 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 26) seen :8
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-10 22:05:38] [INFO ] Invariant cache hit.
[2023-03-10 22:05:38] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-10 22:05:38] [INFO ] [Real]Absence check using 14 positive and 56 generalized place invariants in 20 ms returned sat
[2023-03-10 22:05:39] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-10 22:05:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-10 22:05:39] [INFO ] [Nat]Absence check using 14 positive and 56 generalized place invariants in 36 ms returned sat
[2023-03-10 22:05:55] [INFO ] After 15676ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :6
[2023-03-10 22:06:04] [INFO ] After 24298ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-10 22:06:04] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :5
Fused 18 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 16 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 928/928 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 535 transition count 845
Reduce places removed 83 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 88 rules applied. Total rules applied 171 place count 452 transition count 840
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 176 place count 447 transition count 840
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 176 place count 447 transition count 783
Deduced a syphon composed of 57 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 309 place count 371 transition count 783
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 15 rules applied. Total rules applied 324 place count 365 transition count 774
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 333 place count 356 transition count 774
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 339 place count 350 transition count 761
Iterating global reduction 5 with 6 rules applied. Total rules applied 345 place count 350 transition count 761
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 349 place count 350 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 350 place count 349 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 350 place count 349 transition count 756
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 352 place count 348 transition count 756
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 353 place count 347 transition count 748
Iterating global reduction 7 with 1 rules applied. Total rules applied 354 place count 347 transition count 748
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 355 place count 346 transition count 740
Iterating global reduction 7 with 1 rules applied. Total rules applied 356 place count 346 transition count 740
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 357 place count 345 transition count 732
Iterating global reduction 7 with 1 rules applied. Total rules applied 358 place count 345 transition count 732
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 359 place count 344 transition count 724
Iterating global reduction 7 with 1 rules applied. Total rules applied 360 place count 344 transition count 724
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 361 place count 343 transition count 716
Iterating global reduction 7 with 1 rules applied. Total rules applied 362 place count 343 transition count 716
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 363 place count 342 transition count 708
Iterating global reduction 7 with 1 rules applied. Total rules applied 364 place count 342 transition count 708
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 365 place count 341 transition count 700
Iterating global reduction 7 with 1 rules applied. Total rules applied 366 place count 341 transition count 700
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 367 place count 340 transition count 692
Iterating global reduction 7 with 1 rules applied. Total rules applied 368 place count 340 transition count 692
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 369 place count 339 transition count 684
Iterating global reduction 7 with 1 rules applied. Total rules applied 370 place count 339 transition count 684
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 432 place count 308 transition count 653
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 434 place count 308 transition count 651
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 436 place count 306 transition count 651
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 8 with 14 rules applied. Total rules applied 450 place count 306 transition count 637
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 465 place count 291 transition count 637
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 466 place count 291 transition count 636
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 473 place count 291 transition count 636
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 474 place count 290 transition count 635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 476 place count 288 transition count 635
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 476 place count 288 transition count 631
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 486 place count 282 transition count 631
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 488 place count 280 transition count 629
Iterating global reduction 10 with 2 rules applied. Total rules applied 490 place count 280 transition count 629
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 492 place count 280 transition count 627
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 494 place count 279 transition count 626
Applied a total of 494 rules in 281 ms. Remains 279 /535 variables (removed 256) and now considering 626/928 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 279/535 places, 626/928 transitions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 626 rows 279 cols
[2023-03-10 22:06:05] [INFO ] Computed 40 place invariants in 10 ms
[2023-03-10 22:06:05] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-10 22:06:05] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-10 22:06:05] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 22:06:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-10 22:06:05] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-10 22:06:14] [INFO ] After 9335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 22:06:15] [INFO ] After 9684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-10 22:06:15] [INFO ] After 10075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 14 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 626/626 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 625
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 278 transition count 624
Applied a total of 3 rules in 44 ms. Remains 278 /279 variables (removed 1) and now considering 624/626 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 278/279 places, 624/626 transitions.
Incomplete random walk after 10000 steps, including 228 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 762780 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1}
Probabilistic random walk after 762780 steps, saw 247351 distinct states, run finished after 3002 ms. (steps per millisecond=254 ) properties seen :5
Running SMT prover for 1 properties.
// Phase 1: matrix 624 rows 278 cols
[2023-03-10 22:06:19] [INFO ] Computed 40 place invariants in 13 ms
[2023-03-10 22:06:19] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 22:06:19] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-10 22:06:19] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:06:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-10 22:06:19] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 17 ms returned sat
[2023-03-10 22:06:20] [INFO ] After 928ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-02a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-02a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 928/928 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 534 transition count 837
Reduce places removed 92 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 183 place count 442 transition count 836
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 190 place count 441 transition count 830
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 196 place count 435 transition count 830
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 196 place count 435 transition count 769
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 143 rules applied. Total rules applied 339 place count 353 transition count 769
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 22 rules applied. Total rules applied 361 place count 344 transition count 756
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 374 place count 331 transition count 756
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 374 place count 331 transition count 755
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 376 place count 330 transition count 755
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 384 place count 322 transition count 740
Iterating global reduction 6 with 8 rules applied. Total rules applied 392 place count 322 transition count 740
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 398 place count 322 transition count 734
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 399 place count 321 transition count 734
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 399 place count 321 transition count 733
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 401 place count 320 transition count 733
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 402 place count 319 transition count 725
Iterating global reduction 8 with 1 rules applied. Total rules applied 403 place count 319 transition count 725
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 404 place count 318 transition count 717
Iterating global reduction 8 with 1 rules applied. Total rules applied 405 place count 318 transition count 717
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 406 place count 317 transition count 709
Iterating global reduction 8 with 1 rules applied. Total rules applied 407 place count 317 transition count 709
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 408 place count 316 transition count 701
Iterating global reduction 8 with 1 rules applied. Total rules applied 409 place count 316 transition count 701
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 410 place count 315 transition count 693
Iterating global reduction 8 with 1 rules applied. Total rules applied 411 place count 315 transition count 693
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 412 place count 314 transition count 685
Iterating global reduction 8 with 1 rules applied. Total rules applied 413 place count 314 transition count 685
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 414 place count 313 transition count 677
Iterating global reduction 8 with 1 rules applied. Total rules applied 415 place count 313 transition count 677
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 416 place count 312 transition count 669
Iterating global reduction 8 with 1 rules applied. Total rules applied 417 place count 312 transition count 669
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 418 place count 311 transition count 661
Iterating global reduction 8 with 1 rules applied. Total rules applied 419 place count 311 transition count 661
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 420 place count 310 transition count 653
Iterating global reduction 8 with 1 rules applied. Total rules applied 421 place count 310 transition count 653
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 422 place count 309 transition count 645
Iterating global reduction 8 with 1 rules applied. Total rules applied 423 place count 309 transition count 645
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 424 place count 308 transition count 637
Iterating global reduction 8 with 1 rules applied. Total rules applied 425 place count 308 transition count 637
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 426 place count 307 transition count 629
Iterating global reduction 8 with 1 rules applied. Total rules applied 427 place count 307 transition count 629
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 428 place count 306 transition count 621
Iterating global reduction 8 with 1 rules applied. Total rules applied 429 place count 306 transition count 621
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 495 place count 273 transition count 588
Applied a total of 495 rules in 142 ms. Remains 273 /535 variables (removed 262) and now considering 588/928 (removed 340) transitions.
// Phase 1: matrix 588 rows 273 cols
[2023-03-10 22:06:21] [INFO ] Computed 38 place invariants in 12 ms
[2023-03-10 22:06:21] [INFO ] Implicit Places using invariants in 163 ms returned [72, 112, 164, 198, 210, 228, 270]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 165 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 266/535 places, 588/928 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 266 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 265 transition count 587
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 265 transition count 579
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 257 transition count 579
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 36 place count 248 transition count 570
Applied a total of 36 rules in 18 ms. Remains 248 /266 variables (removed 18) and now considering 570/588 (removed 18) transitions.
// Phase 1: matrix 570 rows 248 cols
[2023-03-10 22:06:21] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-10 22:06:21] [INFO ] Implicit Places using invariants in 124 ms returned [87, 93, 98, 172, 178, 183]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 126 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/535 places, 570/928 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 238 transition count 566
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 238 transition count 566
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 234 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 234 transition count 562
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 232 transition count 560
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 232 transition count 560
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 230 transition count 558
Applied a total of 24 rules in 24 ms. Remains 230 /242 variables (removed 12) and now considering 558/570 (removed 12) transitions.
// Phase 1: matrix 558 rows 230 cols
[2023-03-10 22:06:21] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-10 22:06:21] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-10 22:06:21] [INFO ] Invariant cache hit.
[2023-03-10 22:06:21] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 230/535 places, 558/928 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1031 ms. Remains : 230/535 places, 558/928 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s90 1)), p1:(AND (EQ s127 1) (EQ s172 1))], nbAcceptance=2, 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 42 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-02a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-01 finished in 1346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 928/928 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 534 transition count 833
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 192 place count 438 transition count 831
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 195 place count 436 transition count 830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 435 transition count 830
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 196 place count 435 transition count 769
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 143 rules applied. Total rules applied 339 place count 353 transition count 769
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 22 rules applied. Total rules applied 361 place count 344 transition count 756
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 374 place count 331 transition count 756
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 374 place count 331 transition count 755
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 376 place count 330 transition count 755
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 384 place count 322 transition count 740
Iterating global reduction 6 with 8 rules applied. Total rules applied 392 place count 322 transition count 740
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 398 place count 322 transition count 734
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 399 place count 321 transition count 734
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 399 place count 321 transition count 733
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 401 place count 320 transition count 733
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 402 place count 319 transition count 725
Iterating global reduction 8 with 1 rules applied. Total rules applied 403 place count 319 transition count 725
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 404 place count 318 transition count 717
Iterating global reduction 8 with 1 rules applied. Total rules applied 405 place count 318 transition count 717
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 406 place count 317 transition count 709
Iterating global reduction 8 with 1 rules applied. Total rules applied 407 place count 317 transition count 709
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 408 place count 316 transition count 701
Iterating global reduction 8 with 1 rules applied. Total rules applied 409 place count 316 transition count 701
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 410 place count 315 transition count 693
Iterating global reduction 8 with 1 rules applied. Total rules applied 411 place count 315 transition count 693
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 412 place count 314 transition count 685
Iterating global reduction 8 with 1 rules applied. Total rules applied 413 place count 314 transition count 685
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 414 place count 313 transition count 677
Iterating global reduction 8 with 1 rules applied. Total rules applied 415 place count 313 transition count 677
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 416 place count 312 transition count 669
Iterating global reduction 8 with 1 rules applied. Total rules applied 417 place count 312 transition count 669
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 418 place count 311 transition count 661
Iterating global reduction 8 with 1 rules applied. Total rules applied 419 place count 311 transition count 661
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 420 place count 310 transition count 653
Iterating global reduction 8 with 1 rules applied. Total rules applied 421 place count 310 transition count 653
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 422 place count 309 transition count 645
Iterating global reduction 8 with 1 rules applied. Total rules applied 423 place count 309 transition count 645
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 424 place count 308 transition count 637
Iterating global reduction 8 with 1 rules applied. Total rules applied 425 place count 308 transition count 637
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 426 place count 307 transition count 629
Iterating global reduction 8 with 1 rules applied. Total rules applied 427 place count 307 transition count 629
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 428 place count 306 transition count 621
Iterating global reduction 8 with 1 rules applied. Total rules applied 429 place count 306 transition count 621
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 493 place count 274 transition count 589
Applied a total of 493 rules in 131 ms. Remains 274 /535 variables (removed 261) and now considering 589/928 (removed 339) transitions.
// Phase 1: matrix 589 rows 274 cols
[2023-03-10 22:06:22] [INFO ] Computed 38 place invariants in 11 ms
[2023-03-10 22:06:22] [INFO ] Implicit Places using invariants in 225 ms returned [72, 113, 165, 199, 211, 229, 271]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 226 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 267/535 places, 589/928 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 267 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 266 transition count 588
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 266 transition count 580
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 258 transition count 580
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 36 place count 249 transition count 571
Applied a total of 36 rules in 15 ms. Remains 249 /267 variables (removed 18) and now considering 571/589 (removed 18) transitions.
// Phase 1: matrix 571 rows 249 cols
[2023-03-10 22:06:22] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-10 22:06:22] [INFO ] Implicit Places using invariants in 148 ms returned [87, 93, 99, 173, 179, 184]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 150 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 243/535 places, 571/928 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 239 transition count 567
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 239 transition count 567
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 235 transition count 563
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 235 transition count 563
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 233 transition count 561
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 233 transition count 561
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 231 transition count 559
Applied a total of 24 rules in 19 ms. Remains 231 /243 variables (removed 12) and now considering 559/571 (removed 12) transitions.
// Phase 1: matrix 559 rows 231 cols
[2023-03-10 22:06:22] [INFO ] Computed 25 place invariants in 4 ms
[2023-03-10 22:06:22] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-10 22:06:22] [INFO ] Invariant cache hit.
[2023-03-10 22:06:23] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 231/535 places, 559/928 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1029 ms. Remains : 231/535 places, 559/928 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s89 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2175 reset in 244 ms.
Stack based approach found an accepted trace after 63815 steps with 1429 reset with depth 12 and stack size 12 in 130 ms.
FORMULA ASLink-PT-02a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02a-LTLFireability-09 finished in 1463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(G(p2))||p1)))))'
Support contains 8 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 928/928 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 534 transition count 835
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 96 rules applied. Total rules applied 188 place count 440 transition count 833
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 190 place count 438 transition count 833
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 190 place count 438 transition count 772
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 331 place count 358 transition count 772
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 22 rules applied. Total rules applied 353 place count 349 transition count 759
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 366 place count 336 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 366 place count 336 transition count 758
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 368 place count 335 transition count 758
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 376 place count 327 transition count 743
Iterating global reduction 5 with 8 rules applied. Total rules applied 384 place count 327 transition count 743
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 390 place count 327 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 391 place count 326 transition count 737
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 391 place count 326 transition count 736
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 393 place count 325 transition count 736
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 394 place count 324 transition count 728
Iterating global reduction 7 with 1 rules applied. Total rules applied 395 place count 324 transition count 728
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 396 place count 323 transition count 720
Iterating global reduction 7 with 1 rules applied. Total rules applied 397 place count 323 transition count 720
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 398 place count 322 transition count 712
Iterating global reduction 7 with 1 rules applied. Total rules applied 399 place count 322 transition count 712
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 400 place count 321 transition count 704
Iterating global reduction 7 with 1 rules applied. Total rules applied 401 place count 321 transition count 704
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 402 place count 320 transition count 696
Iterating global reduction 7 with 1 rules applied. Total rules applied 403 place count 320 transition count 696
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 404 place count 319 transition count 688
Iterating global reduction 7 with 1 rules applied. Total rules applied 405 place count 319 transition count 688
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 406 place count 318 transition count 680
Iterating global reduction 7 with 1 rules applied. Total rules applied 407 place count 318 transition count 680
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 408 place count 317 transition count 672
Iterating global reduction 7 with 1 rules applied. Total rules applied 409 place count 317 transition count 672
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 410 place count 316 transition count 664
Iterating global reduction 7 with 1 rules applied. Total rules applied 411 place count 316 transition count 664
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 58 rules applied. Total rules applied 469 place count 287 transition count 635
Applied a total of 469 rules in 106 ms. Remains 287 /535 variables (removed 248) and now considering 635/928 (removed 293) transitions.
// Phase 1: matrix 635 rows 287 cols
[2023-03-10 22:06:23] [INFO ] Computed 40 place invariants in 11 ms
[2023-03-10 22:06:24] [INFO ] Implicit Places using invariants in 229 ms returned [72, 173, 207, 219, 242, 284]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 231 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/535 places, 635/928 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 281 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 280 transition count 634
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 280 transition count 630
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 276 transition count 630
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 28 place count 267 transition count 621
Applied a total of 28 rules in 15 ms. Remains 267 /281 variables (removed 14) and now considering 621/635 (removed 14) transitions.
// Phase 1: matrix 621 rows 267 cols
[2023-03-10 22:06:24] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-10 22:06:24] [INFO ] Implicit Places using invariants in 171 ms returned [186, 192, 197]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 174 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 264/535 places, 621/928 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 262 transition count 619
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 262 transition count 619
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 260 transition count 617
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 260 transition count 617
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 259 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 259 transition count 616
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 258 transition count 615
Applied a total of 12 rules in 17 ms. Remains 258 /264 variables (removed 6) and now considering 615/621 (removed 6) transitions.
// Phase 1: matrix 615 rows 258 cols
[2023-03-10 22:06:24] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-10 22:06:24] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-10 22:06:24] [INFO ] Invariant cache hit.
[2023-03-10 22:06:24] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 258/535 places, 615/928 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1119 ms. Remains : 258/535 places, 615/928 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s82 0) (EQ s84 0) (EQ s86 0) (EQ s119 0)), p0:(OR (EQ s82 0) (EQ s84 0) (EQ s86 0) (EQ s119 0) (AND (EQ s130 1) (EQ s213 1) (OR (EQ s13 0) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2144 reset in 343 ms.
Product exploration explored 100000 steps with 2146 reset in 253 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 p1 p0 (NOT p2)), (X p0), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND p0 p2))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 742 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 265325 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 265325 steps, saw 105345 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :2
Running SMT prover for 4 properties.
[2023-03-10 22:06:30] [INFO ] Invariant cache hit.
[2023-03-10 22:06:30] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 22:06:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-10 22:06:30] [INFO ] [Nat]Absence check using 9 positive and 22 generalized place invariants in 6 ms returned sat
[2023-03-10 22:06:30] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND p0 p2))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (G (NOT (AND p0 p2))), (G (OR (NOT p0) (AND p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 17 factoid took 1268 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Support contains 8 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 615/615 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2023-03-10 22:06:31] [INFO ] Invariant cache hit.
[2023-03-10 22:06:32] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-10 22:06:32] [INFO ] Invariant cache hit.
[2023-03-10 22:06:32] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2023-03-10 22:06:32] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-10 22:06:32] [INFO ] Invariant cache hit.
[2023-03-10 22:06:33] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1181 ms. Remains : 258/258 places, 615/615 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 23836 steps, run visited all 1 properties in 118 ms. (steps per millisecond=202 )
Probabilistic random walk after 23836 steps, saw 12709 distinct states, run finished after 118 ms. (steps per millisecond=202 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2084 reset in 184 ms.
Product exploration explored 100000 steps with 2029 reset in 233 ms.
Built C files in :
/tmp/ltsmin1861721069984039118
[2023-03-10 22:06:34] [INFO ] Computing symmetric may disable matrix : 615 transitions.
[2023-03-10 22:06:34] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:06:34] [INFO ] Computing symmetric may enable matrix : 615 transitions.
[2023-03-10 22:06:34] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:06:34] [INFO ] Computing Do-Not-Accords matrix : 615 transitions.
[2023-03-10 22:06:34] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:06:34] [INFO ] Built C files in 143ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1861721069984039118
Running compilation step : cd /tmp/ltsmin1861721069984039118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1546 ms.
Running link step : cd /tmp/ltsmin1861721069984039118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin1861721069984039118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16815864210168365798.hoa' '--buchi-type=spotba'
LTSmin run took 8115 ms.
FORMULA ASLink-PT-02a-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-02a-LTLFireability-10 finished in 20541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 928/928 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 534 transition count 920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 534 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 533 transition count 912
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 533 transition count 912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 532 transition count 904
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 532 transition count 904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 531 transition count 896
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 531 transition count 896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 530 transition count 888
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 530 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 529 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 529 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 528 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 528 transition count 872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 527 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 527 transition count 864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 526 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 526 transition count 856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 525 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 525 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 524 transition count 840
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 524 transition count 840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 523 transition count 832
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 523 transition count 832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 522 transition count 824
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 522 transition count 824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 521 transition count 816
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 521 transition count 816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 520 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 520 transition count 808
Applied a total of 30 rules in 109 ms. Remains 520 /535 variables (removed 15) and now considering 808/928 (removed 120) transitions.
// Phase 1: matrix 808 rows 520 cols
[2023-03-10 22:06:44] [INFO ] Computed 70 place invariants in 13 ms
[2023-03-10 22:06:44] [INFO ] Implicit Places using invariants in 610 ms returned [210, 392, 410]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 613 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 517/535 places, 808/928 transitions.
Applied a total of 0 rules in 14 ms. Remains 517 /517 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 736 ms. Remains : 517/535 places, 808/928 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, p0, p0, p0]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s88 1) (EQ s202 1))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1338 steps with 16 reset in 6 ms.
FORMULA ASLink-PT-02a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-12 finished in 931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 928/928 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 534 transition count 832
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 99 rules applied. Total rules applied 194 place count 437 transition count 830
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 196 place count 435 transition count 830
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 196 place count 435 transition count 769
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 143 rules applied. Total rules applied 339 place count 353 transition count 769
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 22 rules applied. Total rules applied 361 place count 344 transition count 756
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 374 place count 331 transition count 756
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 374 place count 331 transition count 755
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 376 place count 330 transition count 755
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 384 place count 322 transition count 740
Iterating global reduction 5 with 8 rules applied. Total rules applied 392 place count 322 transition count 740
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 398 place count 322 transition count 734
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 399 place count 321 transition count 734
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 399 place count 321 transition count 733
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 401 place count 320 transition count 733
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 402 place count 319 transition count 725
Iterating global reduction 7 with 1 rules applied. Total rules applied 403 place count 319 transition count 725
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 404 place count 318 transition count 717
Iterating global reduction 7 with 1 rules applied. Total rules applied 405 place count 318 transition count 717
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 406 place count 317 transition count 709
Iterating global reduction 7 with 1 rules applied. Total rules applied 407 place count 317 transition count 709
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 408 place count 316 transition count 701
Iterating global reduction 7 with 1 rules applied. Total rules applied 409 place count 316 transition count 701
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 410 place count 315 transition count 693
Iterating global reduction 7 with 1 rules applied. Total rules applied 411 place count 315 transition count 693
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 412 place count 314 transition count 685
Iterating global reduction 7 with 1 rules applied. Total rules applied 413 place count 314 transition count 685
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 414 place count 313 transition count 677
Iterating global reduction 7 with 1 rules applied. Total rules applied 415 place count 313 transition count 677
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 416 place count 312 transition count 669
Iterating global reduction 7 with 1 rules applied. Total rules applied 417 place count 312 transition count 669
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 418 place count 311 transition count 661
Iterating global reduction 7 with 1 rules applied. Total rules applied 419 place count 311 transition count 661
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 420 place count 310 transition count 653
Iterating global reduction 7 with 1 rules applied. Total rules applied 421 place count 310 transition count 653
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 422 place count 309 transition count 645
Iterating global reduction 7 with 1 rules applied. Total rules applied 423 place count 309 transition count 645
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 424 place count 308 transition count 637
Iterating global reduction 7 with 1 rules applied. Total rules applied 425 place count 308 transition count 637
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 426 place count 307 transition count 629
Iterating global reduction 7 with 1 rules applied. Total rules applied 427 place count 307 transition count 629
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 428 place count 306 transition count 621
Iterating global reduction 7 with 1 rules applied. Total rules applied 429 place count 306 transition count 621
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 495 place count 273 transition count 588
Applied a total of 495 rules in 160 ms. Remains 273 /535 variables (removed 262) and now considering 588/928 (removed 340) transitions.
// Phase 1: matrix 588 rows 273 cols
[2023-03-10 22:06:45] [INFO ] Computed 38 place invariants in 10 ms
[2023-03-10 22:06:45] [INFO ] Implicit Places using invariants in 242 ms returned [72, 112, 164, 198, 210, 228, 270]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 256 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 266/535 places, 588/928 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 266 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 265 transition count 587
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 265 transition count 579
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 257 transition count 579
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 36 place count 248 transition count 570
Applied a total of 36 rules in 13 ms. Remains 248 /266 variables (removed 18) and now considering 570/588 (removed 18) transitions.
// Phase 1: matrix 570 rows 248 cols
[2023-03-10 22:06:45] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-10 22:06:45] [INFO ] Implicit Places using invariants in 223 ms returned [87, 93, 98, 172, 178, 183]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 224 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/535 places, 570/928 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 238 transition count 566
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 238 transition count 566
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 234 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 234 transition count 562
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 232 transition count 560
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 232 transition count 560
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 230 transition count 558
Applied a total of 24 rules in 17 ms. Remains 230 /242 variables (removed 12) and now considering 558/570 (removed 12) transitions.
// Phase 1: matrix 558 rows 230 cols
[2023-03-10 22:06:45] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-10 22:06:45] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-10 22:06:45] [INFO ] Invariant cache hit.
[2023-03-10 22:06:46] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 230/535 places, 558/928 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1234 ms. Remains : 230/535 places, 558/928 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-15 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 s8 1) (EQ s62 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 10 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-15 finished in 1295 ms.
All properties solved by simple procedures.
Total runtime 71839 ms.

BK_STOP 1678486006693

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-02a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02a, 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 r005-oct2-167813592600028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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