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.r101-tall-167814475500532.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DLCflexbar-PT-3b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475500532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 15:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.5M 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 DLCflexbar-PT-3b-LTLFireability-00
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-01
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-02
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-03
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-04
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-05
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-06
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-07
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-08
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-09
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-10
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-11
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-12
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-13
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-14
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678285213020

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=DLCflexbar-PT-3b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 14:20:14] [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-08 14:20:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 14:20:14] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2023-03-08 14:20:14] [INFO ] Transformed 7245 places.
[2023-03-08 14:20:14] [INFO ] Transformed 10555 transitions.
[2023-03-08 14:20:14] [INFO ] Found NUPN structural information;
[2023-03-08 14:20:15] [INFO ] Parsed PT model containing 7245 places and 10555 transitions and 28284 arcs in 627 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DLCflexbar-PT-3b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 7245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7245/7245 places, 10555/10555 transitions.
Discarding 1194 places :
Symmetric choice reduction at 0 with 1194 rule applications. Total rules 1194 place count 6051 transition count 9361
Iterating global reduction 0 with 1194 rules applied. Total rules applied 2388 place count 6051 transition count 9361
Discarding 1020 places :
Symmetric choice reduction at 0 with 1020 rule applications. Total rules 3408 place count 5031 transition count 8341
Iterating global reduction 0 with 1020 rules applied. Total rules applied 4428 place count 5031 transition count 8341
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 4433 place count 5031 transition count 8336
Discarding 224 places :
Symmetric choice reduction at 1 with 224 rule applications. Total rules 4657 place count 4807 transition count 7919
Iterating global reduction 1 with 224 rules applied. Total rules applied 4881 place count 4807 transition count 7919
Discarding 208 places :
Symmetric choice reduction at 1 with 208 rule applications. Total rules 5089 place count 4599 transition count 7711
Iterating global reduction 1 with 208 rules applied. Total rules applied 5297 place count 4599 transition count 7711
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 5325 place count 4599 transition count 7683
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 5417 place count 4507 transition count 7591
Iterating global reduction 2 with 92 rules applied. Total rules applied 5509 place count 4507 transition count 7591
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 5601 place count 4415 transition count 7499
Iterating global reduction 2 with 92 rules applied. Total rules applied 5693 place count 4415 transition count 7499
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 5783 place count 4325 transition count 7409
Iterating global reduction 2 with 90 rules applied. Total rules applied 5873 place count 4325 transition count 7409
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 5957 place count 4241 transition count 7325
Iterating global reduction 2 with 84 rules applied. Total rules applied 6041 place count 4241 transition count 7325
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 6096 place count 4186 transition count 7270
Iterating global reduction 2 with 55 rules applied. Total rules applied 6151 place count 4186 transition count 7270
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 6206 place count 4131 transition count 7215
Iterating global reduction 2 with 55 rules applied. Total rules applied 6261 place count 4131 transition count 7215
Applied a total of 6261 rules in 5189 ms. Remains 4131 /7245 variables (removed 3114) and now considering 7215/10555 (removed 3340) transitions.
// Phase 1: matrix 7215 rows 4131 cols
[2023-03-08 14:20:20] [INFO ] Computed 355 place invariants in 58 ms
[2023-03-08 14:20:22] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2023-03-08 14:20:22] [INFO ] Invariant cache hit.
[2023-03-08 14:20:23] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 2346 ms to find 0 implicit places.
[2023-03-08 14:20:23] [INFO ] Invariant cache hit.
[2023-03-08 14:20:26] [INFO ] Dead Transitions using invariants and state equation in 3753 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4131/7245 places, 7215/10555 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11291 ms. Remains : 4131/7245 places, 7215/10555 transitions.
Support contains 37 out of 4131 places after structural reductions.
[2023-03-08 14:20:27] [INFO ] Flatten gal took : 335 ms
[2023-03-08 14:20:27] [INFO ] Flatten gal took : 205 ms
[2023-03-08 14:20:28] [INFO ] Input system was already deterministic with 7215 transitions.
Support contains 36 out of 4131 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 856 ms. (steps per millisecond=11 ) properties (out of 28) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-08 14:20:29] [INFO ] Invariant cache hit.
[2023-03-08 14:20:31] [INFO ] [Real]Absence check using 355 positive place invariants in 353 ms returned sat
[2023-03-08 14:20:32] [INFO ] After 2429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-08 14:20:33] [INFO ] [Nat]Absence check using 355 positive place invariants in 346 ms returned sat
[2023-03-08 14:20:39] [INFO ] After 5330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-08 14:20:45] [INFO ] After 10594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 2515 ms.
[2023-03-08 14:20:47] [INFO ] After 15377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 5 different solutions.
Parikh walk visited 9 properties in 352 ms.
Support contains 8 out of 4131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Graph (trivial) has 3606 edges and 4131 vertex of which 672 / 4131 are part of one of the 51 SCC in 15 ms
Free SCC test removed 621 places
Drop transitions removed 710 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 744 transitions.
Drop transitions removed 803 transitions
Trivial Post-agglo rules discarded 803 transitions
Performed 803 trivial Post agglomeration. Transition count delta: 803
Iterating post reduction 0 with 803 rules applied. Total rules applied 804 place count 3510 transition count 5668
Reduce places removed 803 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 1 with 910 rules applied. Total rules applied 1714 place count 2707 transition count 5561
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 73 rules applied. Total rules applied 1787 place count 2636 transition count 5559
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 1790 place count 2635 transition count 5557
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1792 place count 2633 transition count 5557
Performed 414 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 414 Pre rules applied. Total rules applied 1792 place count 2633 transition count 5143
Deduced a syphon composed of 414 places in 43 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 5 with 828 rules applied. Total rules applied 2620 place count 2219 transition count 5143
Discarding 91 places :
Symmetric choice reduction at 5 with 91 rule applications. Total rules 2711 place count 2128 transition count 4375
Iterating global reduction 5 with 91 rules applied. Total rules applied 2802 place count 2128 transition count 4375
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 2831 place count 2128 transition count 4346
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 2831 place count 2128 transition count 4342
Deduced a syphon composed of 4 places in 39 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 2839 place count 2124 transition count 4342
Performed 792 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 792 places in 2 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 6 with 1584 rules applied. Total rules applied 4423 place count 1332 transition count 3545
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 4429 place count 1332 transition count 3539
Renaming transitions due to excessive name length > 1024 char.
Discarding 40 places :
Symmetric choice reduction at 7 with 40 rule applications. Total rules 4469 place count 1292 transition count 3078
Iterating global reduction 7 with 40 rules applied. Total rules applied 4509 place count 1292 transition count 3078
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 7 with 39 rules applied. Total rules applied 4548 place count 1292 transition count 3039
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4552 place count 1290 transition count 3037
Performed 95 Post agglomeration using F-continuation condition with reduction of 150 identical transitions.
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 8 with 190 rules applied. Total rules applied 4742 place count 1195 transition count 3494
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 4748 place count 1195 transition count 3488
Discarding 30 places :
Symmetric choice reduction at 9 with 30 rule applications. Total rules 4778 place count 1165 transition count 3186
Iterating global reduction 9 with 30 rules applied. Total rules applied 4808 place count 1165 transition count 3186
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 9 with 151 rules applied. Total rules applied 4959 place count 1165 transition count 3035
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 10 with 27 rules applied. Total rules applied 4986 place count 1165 transition count 3008
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 4993 place count 1158 transition count 3001
Iterating global reduction 10 with 7 rules applied. Total rules applied 5000 place count 1158 transition count 3001
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 5007 place count 1151 transition count 2763
Iterating global reduction 10 with 7 rules applied. Total rules applied 5014 place count 1151 transition count 2763
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 5021 place count 1151 transition count 2756
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 5031 place count 1146 transition count 2751
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 5035 place count 1142 transition count 2615
Iterating global reduction 11 with 4 rules applied. Total rules applied 5039 place count 1142 transition count 2615
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 5043 place count 1142 transition count 2611
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 5047 place count 1140 transition count 2631
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 5049 place count 1140 transition count 2629
Free-agglomeration rule applied 729 times with reduction of 433 identical transitions.
Iterating global reduction 13 with 729 rules applied. Total rules applied 5778 place count 1140 transition count 1467
Reduce places removed 729 places and 0 transitions.
Drop transitions removed 816 transitions
Reduce isomorphic transitions removed 816 transitions.
Graph (complete) has 1011 edges and 411 vertex of which 167 are kept as prefixes of interest. Removing 244 places using SCC suffix rule.2 ms
Discarding 244 places :
Also discarding 181 output transitions
Drop transitions removed 181 transitions
Iterating post reduction 13 with 1546 rules applied. Total rules applied 7324 place count 167 transition count 470
Drop transitions removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 14 with 79 rules applied. Total rules applied 7403 place count 167 transition count 391
Discarding 102 places :
Symmetric choice reduction at 15 with 102 rule applications. Total rules 7505 place count 65 transition count 148
Iterating global reduction 15 with 102 rules applied. Total rules applied 7607 place count 65 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 7609 place count 64 transition count 153
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 7614 place count 64 transition count 148
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 16 with 15 rules applied. Total rules applied 7629 place count 64 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 7630 place count 64 transition count 133
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 7632 place count 64 transition count 133
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 7633 place count 64 transition count 132
Applied a total of 7633 rules in 1579 ms. Remains 64 /4131 variables (removed 4067) and now considering 132/7215 (removed 7083) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1579 ms. Remains : 64/4131 places, 132/7215 transitions.
Finished random walk after 150 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=50 )
Computed a total of 696 stabilizing places and 696 stable transitions
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(p1)) U (p1||X(p2))))))'
Support contains 4 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4119 transition count 7202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4119 transition count 7202
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 4109 transition count 7192
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 4109 transition count 7192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4109 transition count 7191
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 4102 transition count 7184
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 4102 transition count 7184
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 4095 transition count 7177
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 4095 transition count 7177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 4092 transition count 7174
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 4092 transition count 7174
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 4089 transition count 7171
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 4089 transition count 7171
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 4086 transition count 7168
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 4086 transition count 7168
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 4083 transition count 7165
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 4083 transition count 7165
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 4081 transition count 7163
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 4081 transition count 7163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 4080 transition count 7162
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 4080 transition count 7162
Applied a total of 103 rules in 2720 ms. Remains 4080 /4131 variables (removed 51) and now considering 7162/7215 (removed 53) transitions.
// Phase 1: matrix 7162 rows 4080 cols
[2023-03-08 14:20:52] [INFO ] Computed 355 place invariants in 38 ms
[2023-03-08 14:20:53] [INFO ] Implicit Places using invariants in 1061 ms returned []
[2023-03-08 14:20:53] [INFO ] Invariant cache hit.
[2023-03-08 14:20:55] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 3091 ms to find 0 implicit places.
[2023-03-08 14:20:56] [INFO ] Invariant cache hit.
[2023-03-08 14:20:59] [INFO ] Dead Transitions using invariants and state equation in 3667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4080/4131 places, 7162/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9480 ms. Remains : 4080/4131 places, 7162/7215 transitions.
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s829 1), p0:(EQ s2685 1), p2:(AND (EQ s1474 1) (EQ s2517 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7 reset in 974 ms.
Product exploration explored 100000 steps with 9 reset in 1006 ms.
Computed a total of 680 stabilizing places and 680 stable transitions
Computed a total of 680 stabilizing places and 680 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 480 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 150212 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150212 steps, saw 148381 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-08 14:21:06] [INFO ] Invariant cache hit.
[2023-03-08 14:21:07] [INFO ] [Real]Absence check using 355 positive place invariants in 348 ms returned sat
[2023-03-08 14:21:07] [INFO ] After 1196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 14:21:08] [INFO ] [Nat]Absence check using 355 positive place invariants in 357 ms returned sat
[2023-03-08 14:21:12] [INFO ] After 3789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 14:21:14] [INFO ] After 5416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 880 ms.
[2023-03-08 14:21:15] [INFO ] After 7570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 1187 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=98 )
Parikh walk visited 5 properties in 68 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 484 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-08 14:21:16] [INFO ] Invariant cache hit.
[2023-03-08 14:21:22] [INFO ] [Real]Absence check using 355 positive place invariants in 1738 ms returned sat
[2023-03-08 14:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 14:21:31] [INFO ] [Real]Absence check using state equation in 9187 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 4080 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4080/4080 places, 7162/7162 transitions.
Applied a total of 0 rules in 240 ms. Remains 4080 /4080 variables (removed 0) and now considering 7162/7162 (removed 0) transitions.
[2023-03-08 14:21:31] [INFO ] Invariant cache hit.
[2023-03-08 14:21:32] [INFO ] Implicit Places using invariants in 996 ms returned []
[2023-03-08 14:21:32] [INFO ] Invariant cache hit.
[2023-03-08 14:21:34] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2972 ms to find 0 implicit places.
[2023-03-08 14:21:34] [INFO ] Invariant cache hit.
[2023-03-08 14:21:38] [INFO ] Dead Transitions using invariants and state equation in 3574 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6791 ms. Remains : 4080/4080 places, 7162/7162 transitions.
Computed a total of 680 stabilizing places and 680 stable transitions
Computed a total of 680 stabilizing places and 680 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 409 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 140546 steps, run timeout after 3003 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140546 steps, saw 138752 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-08 14:21:42] [INFO ] Invariant cache hit.
[2023-03-08 14:21:43] [INFO ] [Real]Absence check using 355 positive place invariants in 349 ms returned sat
[2023-03-08 14:21:43] [INFO ] After 1197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 14:21:44] [INFO ] [Nat]Absence check using 355 positive place invariants in 342 ms returned sat
[2023-03-08 14:21:48] [INFO ] After 3731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 14:21:50] [INFO ] After 5331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 895 ms.
[2023-03-08 14:21:50] [INFO ] After 7436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 1186 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=131 )
Parikh walk visited 5 properties in 61 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 562 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-08 14:21:51] [INFO ] Invariant cache hit.
[2023-03-08 14:21:57] [INFO ] [Real]Absence check using 355 positive place invariants in 1679 ms returned sat
[2023-03-08 14:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 14:22:06] [INFO ] [Real]Absence check using state equation in 9355 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 8 reset in 809 ms.
Product exploration explored 100000 steps with 9 reset in 965 ms.
Built C files in :
/tmp/ltsmin3553132662213376293
[2023-03-08 14:22:09] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3553132662213376293
Running compilation step : cd /tmp/ltsmin3553132662213376293;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3553132662213376293;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3553132662213376293;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 4080 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4080/4080 places, 7162/7162 transitions.
Applied a total of 0 rules in 233 ms. Remains 4080 /4080 variables (removed 0) and now considering 7162/7162 (removed 0) transitions.
[2023-03-08 14:22:12] [INFO ] Invariant cache hit.
[2023-03-08 14:22:13] [INFO ] Implicit Places using invariants in 969 ms returned []
[2023-03-08 14:22:13] [INFO ] Invariant cache hit.
[2023-03-08 14:22:15] [INFO ] Implicit Places using invariants and state equation in 1935 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
[2023-03-08 14:22:15] [INFO ] Invariant cache hit.
[2023-03-08 14:22:18] [INFO ] Dead Transitions using invariants and state equation in 3394 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6542 ms. Remains : 4080/4080 places, 7162/7162 transitions.
Built C files in :
/tmp/ltsmin16577916720865101274
[2023-03-08 14:22:18] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16577916720865101274
Running compilation step : cd /tmp/ltsmin16577916720865101274;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16577916720865101274;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16577916720865101274;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 14:22:22] [INFO ] Flatten gal took : 168 ms
[2023-03-08 14:22:22] [INFO ] Flatten gal took : 164 ms
[2023-03-08 14:22:22] [INFO ] Time to serialize gal into /tmp/LTL4875100915391726823.gal : 48 ms
[2023-03-08 14:22:22] [INFO ] Time to serialize properties into /tmp/LTL14235688840306096021.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4875100915391726823.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14609099682858237542.hoa' '-atoms' '/tmp/LTL14235688840306096021.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14235688840306096021.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14609099682858237542.hoa
Detected timeout of ITS tools.
[2023-03-08 14:22:37] [INFO ] Flatten gal took : 143 ms
[2023-03-08 14:22:38] [INFO ] Flatten gal took : 153 ms
[2023-03-08 14:22:38] [INFO ] Time to serialize gal into /tmp/LTL17551229127241512290.gal : 29 ms
[2023-03-08 14:22:38] [INFO ] Time to serialize properties into /tmp/LTL2080040554610338949.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17551229127241512290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2080040554610338949.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((("(p4920==1)")||(X("(p1767==1)")))U(("(p1767==1)")||(X("((p3162==1)&&(p4641==1))")))))))
Formula 0 simplified : GF((!"(p4920==1)" & X!"(p1767==1)") R (!"(p1767==1)" & X!"((p3162==1)&&(p4641==1))"))
Detected timeout of ITS tools.
[2023-03-08 14:22:53] [INFO ] Flatten gal took : 130 ms
[2023-03-08 14:22:53] [INFO ] Applying decomposition
[2023-03-08 14:22:53] [INFO ] Flatten gal took : 131 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16306154630656529897.txt' '-o' '/tmp/graph16306154630656529897.bin' '-w' '/tmp/graph16306154630656529897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16306154630656529897.bin' '-l' '-1' '-v' '-w' '/tmp/graph16306154630656529897.weights' '-q' '0' '-e' '0.001'
[2023-03-08 14:22:53] [INFO ] Decomposing Gal with order
[2023-03-08 14:22:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 14:22:55] [INFO ] Removed a total of 6739 redundant transitions.
[2023-03-08 14:22:55] [INFO ] Flatten gal took : 494 ms
[2023-03-08 14:22:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 239 labels/synchronizations in 115 ms.
[2023-03-08 14:22:55] [INFO ] Time to serialize gal into /tmp/LTL9824434127888441132.gal : 47 ms
[2023-03-08 14:22:55] [INFO ] Time to serialize properties into /tmp/LTL16622759712708981459.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9824434127888441132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16622759712708981459.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((("(i34.u1076.p4920==1)")||(X("(i17.i0.i3.u349.p1767==1)")))U(("(i17.i0.i3.u349.p1767==1)")||(X("((i32.u622.p3162==1)&&(i32.u10...176
Formula 0 simplified : GF((!"(i34.u1076.p4920==1)" & X!"(i17.i0.i3.u349.p1767==1)") R (!"(i17.i0.i3.u349.p1767==1)" & X!"((i32.u622.p3162==1)&&(i32.u1026.p...167
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11122661797169940366
[2023-03-08 14:23:10] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11122661797169940366
Running compilation step : cd /tmp/ltsmin11122661797169940366;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11122661797169940366;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11122661797169940366;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DLCflexbar-PT-3b-LTLFireability-00 finished in 143610 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(X(p0))))'
Support contains 1 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4118 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4118 transition count 7201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 4108 transition count 7191
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 4108 transition count 7191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4108 transition count 7190
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 4101 transition count 7182
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 4101 transition count 7182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 4094 transition count 7175
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 4094 transition count 7175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 4094 transition count 7174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 4092 transition count 7172
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 4090 transition count 7170
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 4090 transition count 7170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 4088 transition count 7168
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 4088 transition count 7168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 4086 transition count 7166
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 4085 transition count 7165
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 4085 transition count 7165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 4084 transition count 7164
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 4084 transition count 7164
Applied a total of 96 rules in 2566 ms. Remains 4084 /4131 variables (removed 47) and now considering 7164/7215 (removed 51) transitions.
// Phase 1: matrix 7164 rows 4084 cols
[2023-03-08 14:23:16] [INFO ] Computed 355 place invariants in 30 ms
[2023-03-08 14:23:17] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2023-03-08 14:23:17] [INFO ] Invariant cache hit.
[2023-03-08 14:23:19] [INFO ] Implicit Places using invariants and state equation in 1969 ms returned []
Implicit Place search using SMT with State Equation took 3003 ms to find 0 implicit places.
[2023-03-08 14:23:19] [INFO ] Invariant cache hit.
[2023-03-08 14:23:22] [INFO ] Dead Transitions using invariants and state equation in 3552 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4084/4131 places, 7164/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9125 ms. Remains : 4084/4131 places, 7164/7215 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s285 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-01 finished in 9342 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' '!(G((p0||(p1&&X(p2)))))'
Support contains 3 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4119 transition count 7202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4119 transition count 7202
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 4110 transition count 7193
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 4110 transition count 7193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 4110 transition count 7192
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 4103 transition count 7184
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 4103 transition count 7184
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 63 place count 4097 transition count 7178
Iterating global reduction 1 with 6 rules applied. Total rules applied 69 place count 4097 transition count 7178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 4097 transition count 7177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 4095 transition count 7175
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 4095 transition count 7175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 4093 transition count 7173
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 4093 transition count 7173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 4091 transition count 7171
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 4091 transition count 7171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 4089 transition count 7169
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 4089 transition count 7169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 4088 transition count 7168
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 4088 transition count 7168
Applied a total of 88 rules in 2359 ms. Remains 4088 /4131 variables (removed 43) and now considering 7168/7215 (removed 47) transitions.
// Phase 1: matrix 7168 rows 4088 cols
[2023-03-08 14:23:25] [INFO ] Computed 355 place invariants in 28 ms
[2023-03-08 14:23:26] [INFO ] Implicit Places using invariants in 1022 ms returned []
[2023-03-08 14:23:26] [INFO ] Invariant cache hit.
[2023-03-08 14:23:28] [INFO ] Implicit Places using invariants and state equation in 1965 ms returned []
Implicit Place search using SMT with State Equation took 2989 ms to find 0 implicit places.
[2023-03-08 14:23:28] [INFO ] Invariant cache hit.
[2023-03-08 14:23:31] [INFO ] Dead Transitions using invariants and state equation in 3251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4088/4131 places, 7168/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8611 ms. Remains : 4088/4131 places, 7168/7215 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s1071 1), p1:(EQ s1147 1), p2:(NEQ s3660 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 221 steps with 0 reset in 3 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-02 finished in 8794 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((G(X(X(G(p0)))) U p1)))'
Support contains 3 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4118 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4118 transition count 7201
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 4107 transition count 7190
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 4107 transition count 7190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 4107 transition count 7189
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 4099 transition count 7180
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 4099 transition count 7180
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 4091 transition count 7172
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 4091 transition count 7172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 4091 transition count 7171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 4088 transition count 7168
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 4088 transition count 7168
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 4085 transition count 7165
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 4085 transition count 7165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 4082 transition count 7162
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 4082 transition count 7162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 4079 transition count 7159
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 4079 transition count 7159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 4077 transition count 7157
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 4077 transition count 7157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 4076 transition count 7156
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 4076 transition count 7156
Applied a total of 112 rules in 2560 ms. Remains 4076 /4131 variables (removed 55) and now considering 7156/7215 (removed 59) transitions.
// Phase 1: matrix 7156 rows 4076 cols
[2023-03-08 14:23:34] [INFO ] Computed 355 place invariants in 28 ms
[2023-03-08 14:23:35] [INFO ] Implicit Places using invariants in 947 ms returned []
[2023-03-08 14:23:35] [INFO ] Invariant cache hit.
[2023-03-08 14:23:37] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2863 ms to find 0 implicit places.
[2023-03-08 14:23:37] [INFO ] Invariant cache hit.
[2023-03-08 14:23:40] [INFO ] Dead Transitions using invariants and state equation in 3544 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4076/4131 places, 7156/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8980 ms. Remains : 4076/4131 places, 7156/7215 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s1622 1) (EQ s2969 1)), p0:(EQ s3573 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-03 finished in 9281 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' '!((G(F(!p0)) U G((p1||X(p2)))))'
Support contains 4 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4118 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4118 transition count 7201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 4108 transition count 7191
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 4108 transition count 7191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4108 transition count 7190
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 4101 transition count 7182
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 4101 transition count 7182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 4094 transition count 7175
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 4094 transition count 7175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 4094 transition count 7174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 4092 transition count 7172
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 4090 transition count 7170
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 4090 transition count 7170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 4088 transition count 7168
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 4088 transition count 7168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 4086 transition count 7166
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 4085 transition count 7165
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 4085 transition count 7165
Applied a total of 94 rules in 2273 ms. Remains 4085 /4131 variables (removed 46) and now considering 7165/7215 (removed 50) transitions.
// Phase 1: matrix 7165 rows 4085 cols
[2023-03-08 14:23:43] [INFO ] Computed 355 place invariants in 26 ms
[2023-03-08 14:23:44] [INFO ] Implicit Places using invariants in 981 ms returned []
[2023-03-08 14:23:44] [INFO ] Invariant cache hit.
[2023-03-08 14:23:46] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2899 ms to find 0 implicit places.
[2023-03-08 14:23:46] [INFO ] Invariant cache hit.
[2023-03-08 14:23:49] [INFO ] Dead Transitions using invariants and state equation in 3511 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4085/4131 places, 7165/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8685 ms. Remains : 4085/4131 places, 7165/7215 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, p0]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s2144 1), p2:(EQ s1071 1), p0:(AND (EQ s1519 1) (EQ s2480 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 771 ms.
Product exploration explored 100000 steps with 6 reset in 975 ms.
Computed a total of 690 stabilizing places and 690 stable transitions
Computed a total of 690 stabilizing places and 690 stable transitions
Detected a total of 690/4085 stabilizing places and 690/7165 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 546 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 14:23:53] [INFO ] Invariant cache hit.
[2023-03-08 14:23:54] [INFO ] [Real]Absence check using 355 positive place invariants in 337 ms returned sat
[2023-03-08 14:23:54] [INFO ] After 1287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 14:23:55] [INFO ] [Nat]Absence check using 355 positive place invariants in 341 ms returned sat
[2023-03-08 14:23:59] [INFO ] After 3872ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 14:24:01] [INFO ] After 5791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1024 ms.
[2023-03-08 14:24:02] [INFO ] After 8127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 1307 steps, including 0 resets, run visited all 6 properties in 13 ms. (steps per millisecond=100 )
Parikh walk visited 6 properties in 14 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F (AND (NOT p2) p0)), (F (OR p1 p2)), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND p1 p0) (AND p2 p0))), (F p0)]
Knowledge based reduction with 12 factoid took 645 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
[2023-03-08 14:24:03] [INFO ] Invariant cache hit.
[2023-03-08 14:24:09] [INFO ] [Real]Absence check using 355 positive place invariants in 1329 ms returned sat
[2023-03-08 14:24:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 14:24:18] [INFO ] [Real]Absence check using state equation in 9599 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 4085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4085/4085 places, 7165/7165 transitions.
Graph (trivial) has 3563 edges and 4085 vertex of which 671 / 4085 are part of one of the 51 SCC in 2 ms
Free SCC test removed 620 places
Ensure Unique test removed 692 transitions
Reduce isomorphic transitions removed 692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 775 transitions
Trivial Post-agglo rules discarded 775 transitions
Performed 775 trivial Post agglomeration. Transition count delta: 775
Iterating post reduction 0 with 775 rules applied. Total rules applied 776 place count 3464 transition count 5697
Reduce places removed 775 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 1 with 880 rules applied. Total rules applied 1656 place count 2689 transition count 5592
Reduce places removed 70 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 72 rules applied. Total rules applied 1728 place count 2619 transition count 5590
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1730 place count 2617 transition count 5590
Performed 412 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 412 Pre rules applied. Total rules applied 1730 place count 2617 transition count 5178
Deduced a syphon composed of 412 places in 46 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2554 place count 2205 transition count 5178
Discarding 87 places :
Symmetric choice reduction at 4 with 87 rule applications. Total rules 2641 place count 2118 transition count 4344
Iterating global reduction 4 with 87 rules applied. Total rules applied 2728 place count 2118 transition count 4344
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 2758 place count 2118 transition count 4314
Performed 792 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 792 places in 1 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 5 with 1584 rules applied. Total rules applied 4342 place count 1326 transition count 3517
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 4347 place count 1326 transition count 3512
Renaming transitions due to excessive name length > 1024 char.
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 4386 place count 1287 transition count 3056
Iterating global reduction 6 with 39 rules applied. Total rules applied 4425 place count 1287 transition count 3056
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 6 with 38 rules applied. Total rules applied 4463 place count 1287 transition count 3018
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4465 place count 1286 transition count 3017
Performed 98 Post agglomeration using F-continuation condition with reduction of 150 identical transitions.
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 7 with 196 rules applied. Total rules applied 4661 place count 1188 transition count 3513
Discarding 30 places :
Symmetric choice reduction at 7 with 30 rule applications. Total rules 4691 place count 1158 transition count 3203
Iterating global reduction 7 with 30 rules applied. Total rules applied 4721 place count 1158 transition count 3203
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 7 with 153 rules applied. Total rules applied 4874 place count 1158 transition count 3050
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 4876 place count 1157 transition count 3062
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 8 with 38 rules applied. Total rules applied 4914 place count 1157 transition count 3024
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 4922 place count 1149 transition count 3008
Iterating global reduction 8 with 8 rules applied. Total rules applied 4930 place count 1149 transition count 3008
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 4938 place count 1141 transition count 2736
Iterating global reduction 8 with 8 rules applied. Total rules applied 4946 place count 1141 transition count 2736
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 4954 place count 1141 transition count 2728
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 4960 place count 1138 transition count 2757
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 4971 place count 1138 transition count 2746
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4973 place count 1137 transition count 2758
Applied a total of 4973 rules in 1123 ms. Remains 1137 /4085 variables (removed 2948) and now considering 2758/7165 (removed 4407) transitions.
[2023-03-08 14:24:19] [INFO ] Flow matrix only has 2669 transitions (discarded 89 similar events)
// Phase 1: matrix 2669 rows 1137 cols
[2023-03-08 14:24:19] [INFO ] Computed 355 place invariants in 10 ms
[2023-03-08 14:24:20] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-08 14:24:20] [INFO ] Flow matrix only has 2669 transitions (discarded 89 similar events)
[2023-03-08 14:24:20] [INFO ] Invariant cache hit.
[2023-03-08 14:24:21] [INFO ] State equation strengthened by 474 read => feed constraints.
[2023-03-08 14:24:22] [INFO ] Implicit Places using invariants and state equation in 2356 ms returned []
Implicit Place search using SMT with State Equation took 2886 ms to find 0 implicit places.
[2023-03-08 14:24:22] [INFO ] Redundant transitions in 236 ms returned []
[2023-03-08 14:24:22] [INFO ] Flow matrix only has 2669 transitions (discarded 89 similar events)
[2023-03-08 14:24:22] [INFO ] Invariant cache hit.
[2023-03-08 14:24:23] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1137/4085 places, 2758/7165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5195 ms. Remains : 1137/4085 places, 2758/7165 transitions.
Computed a total of 5 stabilizing places and 36 stable transitions
Computed a total of 5 stabilizing places and 36 stable transitions
Detected a total of 5/1137 stabilizing places and 36/2758 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR p1 p2))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 16 factoid took 913 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
Finished random walk after 7349 steps, including 2 resets, run visited all 9 properties in 155 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR p1 p2))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F (AND (NOT p2) p0)), (F (OR p1 p2)), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND p1 p0) (AND p2 p0))), (F p0)]
Knowledge based reduction with 16 factoid took 1179 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
[2023-03-08 14:24:26] [INFO ] Flow matrix only has 2669 transitions (discarded 89 similar events)
[2023-03-08 14:24:26] [INFO ] Invariant cache hit.
[2023-03-08 14:24:28] [INFO ] [Real]Absence check using 355 positive place invariants in 191 ms returned sat
[2023-03-08 14:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 14:24:30] [INFO ] [Real]Absence check using state equation in 1614 ms returned sat
[2023-03-08 14:24:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 14:24:32] [INFO ] [Nat]Absence check using 355 positive place invariants in 197 ms returned sat
[2023-03-08 14:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 14:24:33] [INFO ] [Nat]Absence check using state equation in 1573 ms returned sat
[2023-03-08 14:24:33] [INFO ] State equation strengthened by 474 read => feed constraints.
[2023-03-08 14:24:33] [INFO ] [Nat]Added 474 Read/Feed constraints in 55 ms returned sat
[2023-03-08 14:24:33] [INFO ] Computed and/alt/rep : 1542/4374/1542 causal constraints (skipped 1111 transitions) in 175 ms.
[2023-03-08 14:24:34] [INFO ] Added : 21 causal constraints over 5 iterations in 799 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-04 finished in 53619 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((G(p0)||X(X(G(p1))))))'
Support contains 3 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4118 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4118 transition count 7201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 4108 transition count 7191
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 4108 transition count 7191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4108 transition count 7190
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 4100 transition count 7181
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 4100 transition count 7181
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 4092 transition count 7173
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 4092 transition count 7173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 4089 transition count 7169
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 4089 transition count 7169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 4086 transition count 7166
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 4083 transition count 7163
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 4083 transition count 7163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 4080 transition count 7160
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 4080 transition count 7160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 4078 transition count 7158
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 4078 transition count 7158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 4077 transition count 7157
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 4077 transition count 7157
Applied a total of 110 rules in 2513 ms. Remains 4077 /4131 variables (removed 54) and now considering 7157/7215 (removed 58) transitions.
// Phase 1: matrix 7157 rows 4077 cols
[2023-03-08 14:24:37] [INFO ] Computed 355 place invariants in 25 ms
[2023-03-08 14:24:38] [INFO ] Implicit Places using invariants in 1032 ms returned []
[2023-03-08 14:24:38] [INFO ] Invariant cache hit.
[2023-03-08 14:24:40] [INFO ] Implicit Places using invariants and state equation in 1933 ms returned []
Implicit Place search using SMT with State Equation took 2966 ms to find 0 implicit places.
[2023-03-08 14:24:40] [INFO ] Invariant cache hit.
[2023-03-08 14:24:43] [INFO ] Dead Transitions using invariants and state equation in 3517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4077/4131 places, 7157/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9001 ms. Remains : 4077/4131 places, 7157/7215 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 5}]], initial=6, aps=[p1:(NEQ s2729 1), p0:(OR (EQ s1823 0) (EQ s3859 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9900 steps with 0 reset in 84 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-05 finished in 9523 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(F((p0||G(F(p1))))))'
Support contains 2 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4119 transition count 7203
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4119 transition count 7203
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 4110 transition count 7194
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 4110 transition count 7194
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 4103 transition count 7186
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 4103 transition count 7186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 4096 transition count 7179
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 4096 transition count 7179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 4096 transition count 7178
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 4093 transition count 7175
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 4093 transition count 7175
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 4090 transition count 7172
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 4090 transition count 7172
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 4087 transition count 7169
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 4087 transition count 7169
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 4084 transition count 7166
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 4084 transition count 7166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 4082 transition count 7164
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 4082 transition count 7164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 4081 transition count 7163
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 4081 transition count 7163
Applied a total of 101 rules in 2453 ms. Remains 4081 /4131 variables (removed 50) and now considering 7163/7215 (removed 52) transitions.
// Phase 1: matrix 7163 rows 4081 cols
[2023-03-08 14:24:46] [INFO ] Computed 355 place invariants in 23 ms
[2023-03-08 14:24:47] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2023-03-08 14:24:47] [INFO ] Invariant cache hit.
[2023-03-08 14:24:49] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2950 ms to find 0 implicit places.
[2023-03-08 14:24:49] [INFO ] Invariant cache hit.
[2023-03-08 14:24:53] [INFO ] Dead Transitions using invariants and state equation in 3553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4081/4131 places, 7163/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8958 ms. Remains : 4081/4131 places, 7163/7215 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1256 1), p1:(EQ s1024 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 147 reset in 673 ms.
Product exploration explored 100000 steps with 162 reset in 714 ms.
Computed a total of 684 stabilizing places and 684 stable transitions
Computed a total of 684 stabilizing places and 684 stable transitions
Detected a total of 684/4081 stabilizing places and 684/7163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 14:24:55] [INFO ] Invariant cache hit.
[2023-03-08 14:24:56] [INFO ] [Real]Absence check using 355 positive place invariants in 345 ms returned sat
[2023-03-08 14:24:59] [INFO ] After 2915ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 14:24:59] [INFO ] After 3323ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-08 14:24:59] [INFO ] After 4282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 345 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=115 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 4081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4081/4081 places, 7163/7163 transitions.
Applied a total of 0 rules in 216 ms. Remains 4081 /4081 variables (removed 0) and now considering 7163/7163 (removed 0) transitions.
[2023-03-08 14:25:00] [INFO ] Invariant cache hit.
[2023-03-08 14:25:01] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2023-03-08 14:25:01] [INFO ] Invariant cache hit.
[2023-03-08 14:25:03] [INFO ] Implicit Places using invariants and state equation in 1889 ms returned []
Implicit Place search using SMT with State Equation took 2900 ms to find 0 implicit places.
[2023-03-08 14:25:03] [INFO ] Invariant cache hit.
[2023-03-08 14:25:07] [INFO ] Dead Transitions using invariants and state equation in 3532 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6649 ms. Remains : 4081/4081 places, 7163/7163 transitions.
Computed a total of 684 stabilizing places and 684 stable transitions
Computed a total of 684 stabilizing places and 684 stable transitions
Detected a total of 684/4081 stabilizing places and 684/7163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 14:25:07] [INFO ] Invariant cache hit.
[2023-03-08 14:25:08] [INFO ] [Real]Absence check using 355 positive place invariants in 348 ms returned sat
[2023-03-08 14:25:11] [INFO ] After 2871ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 14:25:11] [INFO ] After 3270ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-08 14:25:12] [INFO ] After 4230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 325 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=162 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 95 reset in 712 ms.
Product exploration explored 100000 steps with 89 reset in 950 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 4081 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4081/4081 places, 7163/7163 transitions.
Graph (trivial) has 3564 edges and 4081 vertex of which 685 / 4081 are part of one of the 50 SCC in 4 ms
Free SCC test removed 635 places
Ensure Unique test removed 711 transitions
Reduce isomorphic transitions removed 711 transitions.
Performed 765 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 765 rules applied. Total rules applied 766 place count 3446 transition count 6452
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 70 rules applied. Total rules applied 836 place count 3446 transition count 6417
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 836 place count 3446 transition count 6447
Deduced a syphon composed of 861 places in 48 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 897 place count 3446 transition count 6447
Discarding 382 places :
Symmetric choice reduction at 2 with 382 rule applications. Total rules 1279 place count 3064 transition count 5285
Deduced a syphon composed of 568 places in 39 ms
Iterating global reduction 2 with 382 rules applied. Total rules applied 1661 place count 3064 transition count 5285
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1691 place count 3064 transition count 5255
Performed 1165 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1733 places in 1 ms
Iterating global reduction 3 with 1165 rules applied. Total rules applied 2856 place count 3064 transition count 5260
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2861 place count 3064 transition count 5255
Renaming transitions due to excessive name length > 1024 char.
Discarding 907 places :
Symmetric choice reduction at 4 with 907 rule applications. Total rules 3768 place count 2157 transition count 3898
Deduced a syphon composed of 866 places in 1 ms
Iterating global reduction 4 with 907 rules applied. Total rules applied 4675 place count 2157 transition count 3898
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 4715 place count 2157 transition count 3858
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 4720 place count 2152 transition count 3853
Deduced a syphon composed of 861 places in 1 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 4725 place count 2152 transition count 3853
Performed 101 Post agglomeration using F-continuation condition with reduction of 150 identical transitions.
Deduced a syphon composed of 962 places in 1 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 4826 place count 2152 transition count 4669
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 5 with 65 rules applied. Total rules applied 4891 place count 2152 transition count 4604
Discarding 136 places :
Symmetric choice reduction at 6 with 136 rule applications. Total rules 5027 place count 2016 transition count 4057
Deduced a syphon composed of 856 places in 1 ms
Iterating global reduction 6 with 136 rules applied. Total rules applied 5163 place count 2016 transition count 4057
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 6 with 180 rules applied. Total rules applied 5343 place count 2016 transition count 3877
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 5403 place count 1956 transition count 3757
Deduced a syphon composed of 796 places in 1 ms
Iterating global reduction 7 with 60 rules applied. Total rules applied 5463 place count 1956 transition count 3757
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 798 places in 1 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 5465 place count 1956 transition count 3787
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 5467 place count 1954 transition count 3783
Deduced a syphon composed of 796 places in 1 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 5469 place count 1954 transition count 3783
Deduced a syphon composed of 796 places in 1 ms
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 5494 place count 1954 transition count 3758
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 5504 place count 1944 transition count 3738
Deduced a syphon composed of 796 places in 1 ms
Iterating global reduction 7 with 10 rules applied. Total rules applied 5514 place count 1944 transition count 3738
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 5524 place count 1934 transition count 3394
Deduced a syphon composed of 796 places in 1 ms
Iterating global reduction 7 with 10 rules applied. Total rules applied 5534 place count 1934 transition count 3394
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 5549 place count 1934 transition count 3379
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 5559 place count 1924 transition count 3364
Deduced a syphon composed of 786 places in 1 ms
Iterating global reduction 8 with 10 rules applied. Total rules applied 5569 place count 1924 transition count 3364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 787 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 5570 place count 1924 transition count 3375
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5571 place count 1923 transition count 3373
Deduced a syphon composed of 786 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 5572 place count 1923 transition count 3373
Deduced a syphon composed of 786 places in 1 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 5576 place count 1923 transition count 3369
Deduced a syphon composed of 786 places in 1 ms
Applied a total of 5576 rules in 5908 ms. Remains 1923 /4081 variables (removed 2158) and now considering 3369/7163 (removed 3794) transitions.
[2023-03-08 14:25:20] [INFO ] Redundant transitions in 196 ms returned []
[2023-03-08 14:25:20] [INFO ] Flow matrix only has 3327 transitions (discarded 42 similar events)
// Phase 1: matrix 3327 rows 1923 cols
[2023-03-08 14:25:20] [INFO ] Computed 355 place invariants in 256 ms
[2023-03-08 14:25:22] [INFO ] Dead Transitions using invariants and state equation in 1915 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1923/4081 places, 3369/7163 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8032 ms. Remains : 1923/4081 places, 3369/7163 transitions.
Built C files in :
/tmp/ltsmin12323939535302513345
[2023-03-08 14:25:22] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12323939535302513345
Running compilation step : cd /tmp/ltsmin12323939535302513345;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12323939535302513345;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12323939535302513345;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 4081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4081/4081 places, 7163/7163 transitions.
Applied a total of 0 rules in 230 ms. Remains 4081 /4081 variables (removed 0) and now considering 7163/7163 (removed 0) transitions.
// Phase 1: matrix 7163 rows 4081 cols
[2023-03-08 14:25:25] [INFO ] Computed 355 place invariants in 24 ms
[2023-03-08 14:25:26] [INFO ] Implicit Places using invariants in 1023 ms returned []
[2023-03-08 14:25:26] [INFO ] Invariant cache hit.
[2023-03-08 14:25:28] [INFO ] Implicit Places using invariants and state equation in 1939 ms returned []
Implicit Place search using SMT with State Equation took 2963 ms to find 0 implicit places.
[2023-03-08 14:25:28] [INFO ] Invariant cache hit.
[2023-03-08 14:25:32] [INFO ] Dead Transitions using invariants and state equation in 3541 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6737 ms. Remains : 4081/4081 places, 7163/7163 transitions.
Built C files in :
/tmp/ltsmin10018482067944345367
[2023-03-08 14:25:32] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10018482067944345367
Running compilation step : cd /tmp/ltsmin10018482067944345367;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10018482067944345367;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10018482067944345367;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 14:25:35] [INFO ] Flatten gal took : 133 ms
[2023-03-08 14:25:35] [INFO ] Flatten gal took : 145 ms
[2023-03-08 14:25:36] [INFO ] Time to serialize gal into /tmp/LTL9762058264955245203.gal : 86 ms
[2023-03-08 14:25:36] [INFO ] Time to serialize properties into /tmp/LTL12715675272685693679.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9762058264955245203.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4163008210541745052.hoa' '-atoms' '/tmp/LTL12715675272685693679.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12715675272685693679.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4163008210541745052.hoa
Detected timeout of ITS tools.
[2023-03-08 14:25:51] [INFO ] Flatten gal took : 124 ms
[2023-03-08 14:25:51] [INFO ] Flatten gal took : 130 ms
[2023-03-08 14:25:51] [INFO ] Time to serialize gal into /tmp/LTL16254958923604098585.gal : 25 ms
[2023-03-08 14:25:51] [INFO ] Time to serialize properties into /tmp/LTL10324473608269828229.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16254958923604098585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10324473608269828229.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p2696==1)")||(G(F("(p2196==0)")))))))
Formula 0 simplified : XG(!"(p2696==1)" & FG!"(p2196==0)")
Detected timeout of ITS tools.
[2023-03-08 14:26:06] [INFO ] Flatten gal took : 125 ms
[2023-03-08 14:26:06] [INFO ] Applying decomposition
[2023-03-08 14:26:06] [INFO ] Flatten gal took : 130 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2616723498726257925.txt' '-o' '/tmp/graph2616723498726257925.bin' '-w' '/tmp/graph2616723498726257925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2616723498726257925.bin' '-l' '-1' '-v' '-w' '/tmp/graph2616723498726257925.weights' '-q' '0' '-e' '0.001'
[2023-03-08 14:26:07] [INFO ] Decomposing Gal with order
[2023-03-08 14:26:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 14:26:08] [INFO ] Removed a total of 6694 redundant transitions.
[2023-03-08 14:26:08] [INFO ] Flatten gal took : 221 ms
[2023-03-08 14:26:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 280 labels/synchronizations in 67 ms.
[2023-03-08 14:26:08] [INFO ] Time to serialize gal into /tmp/LTL6326351666990266970.gal : 42 ms
[2023-03-08 14:26:08] [INFO ] Time to serialize properties into /tmp/LTL15530323054953080732.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6326351666990266970.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15530323054953080732.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i26.i1.i3.u520.p2696==1)")||(G(F("(i20.i0.i3.u427.p2196==0)")))))))
Formula 0 simplified : XG(!"(i26.i1.i3.u520.p2696==1)" & FG!"(i20.i0.i3.u427.p2196==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7661207424837268974
[2023-03-08 14:26:23] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7661207424837268974
Running compilation step : cd /tmp/ltsmin7661207424837268974;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7661207424837268974;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7661207424837268974;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DLCflexbar-PT-3b-LTLFireability-09 finished in 102332 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((p0&&((p1 U (p2||G(p1))) U ((X(p3)&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1)))))))))'
Support contains 3 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4118 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4118 transition count 7201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 4108 transition count 7191
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 4108 transition count 7191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4108 transition count 7190
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 4101 transition count 7182
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 4101 transition count 7182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 4094 transition count 7175
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 4094 transition count 7175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 4094 transition count 7174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 4092 transition count 7172
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 4090 transition count 7170
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 4090 transition count 7170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 4088 transition count 7168
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 4088 transition count 7168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 4086 transition count 7166
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 4084 transition count 7164
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 4084 transition count 7164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 4083 transition count 7163
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 4083 transition count 7163
Applied a total of 98 rules in 2685 ms. Remains 4083 /4131 variables (removed 48) and now considering 7163/7215 (removed 52) transitions.
// Phase 1: matrix 7163 rows 4083 cols
[2023-03-08 14:26:29] [INFO ] Computed 355 place invariants in 22 ms
[2023-03-08 14:26:30] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2023-03-08 14:26:30] [INFO ] Invariant cache hit.
[2023-03-08 14:26:32] [INFO ] Implicit Places using invariants and state equation in 1925 ms returned []
Implicit Place search using SMT with State Equation took 2979 ms to find 0 implicit places.
[2023-03-08 14:26:32] [INFO ] Invariant cache hit.
[2023-03-08 14:26:35] [INFO ] Dead Transitions using invariants and state equation in 3512 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4083/4131 places, 7163/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9178 ms. Remains : 4083/4131 places, 7163/7215 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NEQ s1688 1) (NEQ s575 1)), p1:(NEQ s575 1), p0:(NEQ s1688 1), p3:(NEQ s290 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2151 ms.
Product exploration explored 100000 steps with 50000 reset in 2141 ms.
Computed a total of 680 stabilizing places and 680 stable transitions
Computed a total of 680 stabilizing places and 680 stable transitions
Detected a total of 680/4083 stabilizing places and 680/7163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) p1 p0))), (X (OR (AND p2 p0) (AND p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (OR (AND p2 p0) (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 p1 p0 p3)
Knowledge based reduction with 18 factoid took 486 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCflexbar-PT-3b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCflexbar-PT-3b-LTLFireability-11 finished in 14445 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(p0)&&F((p1||X(F(p2))))&&(!p3 U (p4||G(!p3)))))'
Support contains 6 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4119 transition count 7202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4119 transition count 7202
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 4109 transition count 7192
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 4109 transition count 7192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4109 transition count 7191
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 4102 transition count 7183
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 4102 transition count 7183
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 4095 transition count 7176
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 4095 transition count 7176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 4095 transition count 7175
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 4092 transition count 7172
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 4089 transition count 7169
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 4089 transition count 7169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 4086 transition count 7166
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 4083 transition count 7163
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 4083 transition count 7163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 4081 transition count 7161
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 4081 transition count 7161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 4080 transition count 7160
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 4080 transition count 7160
Applied a total of 104 rules in 2702 ms. Remains 4080 /4131 variables (removed 51) and now considering 7160/7215 (removed 55) transitions.
// Phase 1: matrix 7160 rows 4080 cols
[2023-03-08 14:26:43] [INFO ] Computed 355 place invariants in 25 ms
[2023-03-08 14:26:44] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2023-03-08 14:26:44] [INFO ] Invariant cache hit.
[2023-03-08 14:26:46] [INFO ] Implicit Places using invariants and state equation in 1915 ms returned []
Implicit Place search using SMT with State Equation took 2935 ms to find 0 implicit places.
[2023-03-08 14:26:46] [INFO ] Invariant cache hit.
[2023-03-08 14:26:49] [INFO ] Dead Transitions using invariants and state equation in 3257 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4080/4131 places, 7160/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8899 ms. Remains : 4080/4131 places, 7160/7215 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), true, (NOT p0), (AND (NOT p4) p3), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p4) p3), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p4) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p4:(AND (EQ s3179 1) (NOT (AND (EQ s939 1) (EQ s3832 1)))), p3:(AND (EQ s939 1) (EQ s3832 1)), p0:(EQ s3549 0), p1:(EQ s1049 1), p2:(EQ s1097 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 23394 steps with 1 reset in 178 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-12 finished in 9357 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((F(G(p0)) U p0)))'
Support contains 1 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4117 transition count 7200
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4117 transition count 7200
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 4106 transition count 7189
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 4106 transition count 7189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 4106 transition count 7188
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 4099 transition count 7180
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 4099 transition count 7180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 72 place count 4092 transition count 7173
Iterating global reduction 1 with 7 rules applied. Total rules applied 79 place count 4092 transition count 7173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 4089 transition count 7169
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 4089 transition count 7169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 4086 transition count 7166
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 4083 transition count 7163
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 4083 transition count 7163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 4080 transition count 7160
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 4080 transition count 7160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 4078 transition count 7158
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 4078 transition count 7158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 4077 transition count 7157
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 4077 transition count 7157
Applied a total of 110 rules in 2686 ms. Remains 4077 /4131 variables (removed 54) and now considering 7157/7215 (removed 58) transitions.
// Phase 1: matrix 7157 rows 4077 cols
[2023-03-08 14:26:53] [INFO ] Computed 355 place invariants in 21 ms
[2023-03-08 14:26:54] [INFO ] Implicit Places using invariants in 993 ms returned []
[2023-03-08 14:26:54] [INFO ] Invariant cache hit.
[2023-03-08 14:26:56] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2931 ms to find 0 implicit places.
[2023-03-08 14:26:56] [INFO ] Invariant cache hit.
[2023-03-08 14:26:59] [INFO ] Dead Transitions using invariants and state equation in 3554 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4077/4131 places, 7157/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9173 ms. Remains : 4077/4131 places, 7157/7215 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1097 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 19666 steps with 0 reset in 172 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-14 finished in 9540 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(F((G(F(p1))||p0))))'
Support contains 6 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4117 transition count 7200
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4117 transition count 7200
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 4106 transition count 7189
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 4106 transition count 7189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 4106 transition count 7188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 4098 transition count 7179
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 4098 transition count 7179
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 4090 transition count 7171
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 4090 transition count 7171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 4090 transition count 7170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 4087 transition count 7167
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 4087 transition count 7167
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 4084 transition count 7164
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 4084 transition count 7164
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 4081 transition count 7161
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 4081 transition count 7161
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 4078 transition count 7158
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 4078 transition count 7158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 4076 transition count 7156
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 4076 transition count 7156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 4075 transition count 7155
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 4075 transition count 7155
Applied a total of 114 rules in 2634 ms. Remains 4075 /4131 variables (removed 56) and now considering 7155/7215 (removed 60) transitions.
// Phase 1: matrix 7155 rows 4075 cols
[2023-03-08 14:27:02] [INFO ] Computed 355 place invariants in 29 ms
[2023-03-08 14:27:03] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2023-03-08 14:27:03] [INFO ] Invariant cache hit.
[2023-03-08 14:27:05] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2887 ms to find 0 implicit places.
[2023-03-08 14:27:05] [INFO ] Invariant cache hit.
[2023-03-08 14:27:08] [INFO ] Dead Transitions using invariants and state equation in 3470 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4075/4131 places, 7155/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8992 ms. Remains : 4075/4131 places, 7155/7215 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1138 0) (EQ s3520 0)), p1:(OR (EQ s671 0) (EQ s3035 0) (EQ s1618 0) (EQ s2938 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2047 ms.
Product exploration explored 100000 steps with 50000 reset in 2057 ms.
Computed a total of 680 stabilizing places and 680 stable transitions
Computed a total of 680 stabilizing places and 680 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCflexbar-PT-3b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCflexbar-PT-3b-LTLFireability-15 finished in 13620 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(p1)) U (p1||X(p2))))))'
Found a Lengthening insensitive property : DLCflexbar-PT-3b-LTLFireability-00
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Graph (trivial) has 3616 edges and 4131 vertex of which 686 / 4131 are part of one of the 50 SCC in 3 ms
Free SCC test removed 636 places
Ensure Unique test removed 711 transitions
Reduce isomorphic transitions removed 711 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 799 transitions
Trivial Post-agglo rules discarded 799 transitions
Performed 799 trivial Post agglomeration. Transition count delta: 799
Iterating post reduction 0 with 799 rules applied. Total rules applied 800 place count 3494 transition count 5704
Reduce places removed 799 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 1 with 906 rules applied. Total rules applied 1706 place count 2695 transition count 5597
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 2 with 71 rules applied. Total rules applied 1777 place count 2624 transition count 5597
Performed 412 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 412 Pre rules applied. Total rules applied 1777 place count 2624 transition count 5185
Deduced a syphon composed of 412 places in 42 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 3 with 824 rules applied. Total rules applied 2601 place count 2212 transition count 5185
Discarding 95 places :
Symmetric choice reduction at 3 with 95 rule applications. Total rules 2696 place count 2117 transition count 4347
Iterating global reduction 3 with 95 rules applied. Total rules applied 2791 place count 2117 transition count 4347
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 2820 place count 2117 transition count 4318
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 2820 place count 2117 transition count 4314
Deduced a syphon composed of 4 places in 35 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2828 place count 2113 transition count 4314
Performed 789 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 789 places in 1 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 4 with 1578 rules applied. Total rules applied 4406 place count 1324 transition count 3520
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 4412 place count 1324 transition count 3514
Renaming transitions due to excessive name length > 1024 char.
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 4453 place count 1283 transition count 3019
Iterating global reduction 5 with 41 rules applied. Total rules applied 4494 place count 1283 transition count 3019
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 5 with 41 rules applied. Total rules applied 4535 place count 1283 transition count 2978
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4537 place count 1282 transition count 2977
Performed 95 Post agglomeration using F-continuation condition with reduction of 150 identical transitions.
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 6 with 190 rules applied. Total rules applied 4727 place count 1187 transition count 3438
Discarding 30 places :
Symmetric choice reduction at 6 with 30 rule applications. Total rules 4757 place count 1157 transition count 3132
Iterating global reduction 6 with 30 rules applied. Total rules applied 4787 place count 1157 transition count 3132
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 6 with 151 rules applied. Total rules applied 4938 place count 1157 transition count 2981
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 4942 place count 1157 transition count 2977
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 4944 place count 1157 transition count 2977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4945 place count 1157 transition count 2976
Applied a total of 4945 rules in 654 ms. Remains 1157 /4131 variables (removed 2974) and now considering 2976/7215 (removed 4239) transitions.
[2023-03-08 14:27:14] [INFO ] Flow matrix only has 2922 transitions (discarded 54 similar events)
// Phase 1: matrix 2922 rows 1157 cols
[2023-03-08 14:27:14] [INFO ] Computed 355 place invariants in 17 ms
[2023-03-08 14:27:14] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-08 14:27:14] [INFO ] Flow matrix only has 2922 transitions (discarded 54 similar events)
[2023-03-08 14:27:14] [INFO ] Invariant cache hit.
[2023-03-08 14:27:15] [INFO ] State equation strengthened by 486 read => feed constraints.
[2023-03-08 14:27:17] [INFO ] Implicit Places using invariants and state equation in 2268 ms returned []
Implicit Place search using SMT with State Equation took 2737 ms to find 0 implicit places.
[2023-03-08 14:27:17] [INFO ] Flow matrix only has 2922 transitions (discarded 54 similar events)
[2023-03-08 14:27:17] [INFO ] Invariant cache hit.
[2023-03-08 14:27:18] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1157/4131 places, 2976/7215 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4388 ms. Remains : 1157/4131 places, 2976/7215 transitions.
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s85 1), p0:(EQ s459 1), p2:(AND (EQ s157 1) (EQ s375 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property DLCflexbar-PT-3b-LTLFireability-00 finished in 4586 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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(F((p0||G(F(p1))))))'
Found a Shortening insensitive property : DLCflexbar-PT-3b-LTLFireability-09
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Graph (trivial) has 3616 edges and 4131 vertex of which 686 / 4131 are part of one of the 50 SCC in 2 ms
Free SCC test removed 636 places
Ensure Unique test removed 711 transitions
Reduce isomorphic transitions removed 711 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 797 transitions
Trivial Post-agglo rules discarded 797 transitions
Performed 797 trivial Post agglomeration. Transition count delta: 797
Iterating post reduction 0 with 797 rules applied. Total rules applied 798 place count 3494 transition count 5706
Reduce places removed 797 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 1 with 904 rules applied. Total rules applied 1702 place count 2697 transition count 5599
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 73 rules applied. Total rules applied 1775 place count 2626 transition count 5597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1776 place count 2625 transition count 5597
Performed 412 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 412 Pre rules applied. Total rules applied 1776 place count 2625 transition count 5185
Deduced a syphon composed of 412 places in 42 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2600 place count 2213 transition count 5185
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 2696 place count 2117 transition count 4313
Iterating global reduction 4 with 96 rules applied. Total rules applied 2792 place count 2117 transition count 4313
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 2821 place count 2117 transition count 4284
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 2821 place count 2117 transition count 4279
Deduced a syphon composed of 5 places in 34 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 2831 place count 2112 transition count 4279
Performed 789 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 789 places in 1 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 5 with 1578 rules applied. Total rules applied 4409 place count 1323 transition count 3485
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4415 place count 1323 transition count 3479
Renaming transitions due to excessive name length > 1024 char.
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 4456 place count 1282 transition count 2984
Iterating global reduction 6 with 41 rules applied. Total rules applied 4497 place count 1282 transition count 2984
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 4538 place count 1282 transition count 2943
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 7 with 2 rules applied. Total rules applied 4540 place count 1281 transition count 2942
Performed 95 Post agglomeration using F-continuation condition with reduction of 150 identical transitions.
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 7 with 190 rules applied. Total rules applied 4730 place count 1186 transition count 3402
Discarding 30 places :
Symmetric choice reduction at 7 with 30 rule applications. Total rules 4760 place count 1156 transition count 3096
Iterating global reduction 7 with 30 rules applied. Total rules applied 4790 place count 1156 transition count 3096
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 7 with 151 rules applied. Total rules applied 4941 place count 1156 transition count 2945
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 4945 place count 1156 transition count 2941
Applied a total of 4945 rules in 648 ms. Remains 1156 /4131 variables (removed 2975) and now considering 2941/7215 (removed 4274) transitions.
[2023-03-08 14:27:19] [INFO ] Flow matrix only has 2887 transitions (discarded 54 similar events)
// Phase 1: matrix 2887 rows 1156 cols
[2023-03-08 14:27:19] [INFO ] Computed 355 place invariants in 11 ms
[2023-03-08 14:27:19] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-08 14:27:19] [INFO ] Flow matrix only has 2887 transitions (discarded 54 similar events)
[2023-03-08 14:27:19] [INFO ] Invariant cache hit.
[2023-03-08 14:27:20] [INFO ] State equation strengthened by 485 read => feed constraints.
[2023-03-08 14:27:21] [INFO ] Implicit Places using invariants and state equation in 2397 ms returned []
Implicit Place search using SMT with State Equation took 2869 ms to find 0 implicit places.
[2023-03-08 14:27:21] [INFO ] Flow matrix only has 2887 transitions (discarded 54 similar events)
[2023-03-08 14:27:21] [INFO ] Invariant cache hit.
[2023-03-08 14:27:22] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1156/4131 places, 2941/7215 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4512 ms. Remains : 1156/4131 places, 2941/7215 transitions.
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s132 1), p1:(EQ s107 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 303 steps with 0 reset in 20 ms.
Treatment of property DLCflexbar-PT-3b-LTLFireability-09 finished in 4740 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-08 14:27:23] [INFO ] Flatten gal took : 121 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3961516339066496628
[2023-03-08 14:27:23] [INFO ] Too many transitions (7215) to apply POR reductions. Disabling POR matrices.
[2023-03-08 14:27:23] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3961516339066496628
Running compilation step : cd /tmp/ltsmin3961516339066496628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
[2023-03-08 14:27:23] [INFO ] Applying decomposition
[2023-03-08 14:27:23] [INFO ] Flatten gal took : 135 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16704488608929910127.txt' '-o' '/tmp/graph16704488608929910127.bin' '-w' '/tmp/graph16704488608929910127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16704488608929910127.bin' '-l' '-1' '-v' '-w' '/tmp/graph16704488608929910127.weights' '-q' '0' '-e' '0.001'
[2023-03-08 14:27:23] [INFO ] Decomposing Gal with order
[2023-03-08 14:27:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 14:27:24] [INFO ] Removed a total of 6783 redundant transitions.
[2023-03-08 14:27:24] [INFO ] Flatten gal took : 228 ms
[2023-03-08 14:27:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 283 labels/synchronizations in 60 ms.
[2023-03-08 14:27:24] [INFO ] Time to serialize gal into /tmp/LTLFireability11476516563627586931.gal : 38 ms
[2023-03-08 14:27:24] [INFO ] Time to serialize properties into /tmp/LTLFireability3720125296153985986.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11476516563627586931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3720125296153985986.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i25.u551.p2696==1)")||(G(F("(i19.i1.i3.u442.p2196==0)")))))))
Formula 0 simplified : XG(!"(i25.u551.p2696==1)" & FG!"(i19.i1.i3.u442.p2196==0)")
Compilation finished in 28935 ms.
Running link step : cd /tmp/ltsmin3961516339066496628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin3961516339066496628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp3==true)||[](<>((LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-08 14:49:55] [INFO ] Applying decomposition
[2023-03-08 14:49:56] [INFO ] Flatten gal took : 1143 ms
[2023-03-08 14:49:57] [INFO ] Decomposing Gal with order
[2023-03-08 14:50:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 14:50:22] [INFO ] Removed a total of 5540 redundant transitions.
[2023-03-08 14:50:22] [INFO ] Flatten gal took : 542 ms
[2023-03-08 14:51:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 99034 labels/synchronizations in 45437 ms.
[2023-03-08 14:51:15] [INFO ] Time to serialize gal into /tmp/LTLFireability16068242484874688688.gal : 124 ms
[2023-03-08 14:51:15] [INFO ] Time to serialize properties into /tmp/LTLFireability14260342013551337858.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16068242484874688688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14260342013551337858.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u60.p2696==1)")||(G(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u55.p2196==0)")))))))
Formula 0 simplified : XG(!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u60.p2696==1)" & FG!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u55.p2196==0)")
ITS-tools command line returned an error code 137
[2023-03-08 15:06:43] [INFO ] Flatten gal took : 587 ms
[2023-03-08 15:06:47] [INFO ] Input system was already deterministic with 7215 transitions.
[2023-03-08 15:06:48] [INFO ] Transformed 4131 places.
[2023-03-08 15:06:48] [INFO ] Transformed 7215 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-08 15:06:55] [INFO ] Time to serialize gal into /tmp/LTLFireability17657183126257772168.gal : 47 ms
[2023-03-08 15:06:55] [INFO ] Time to serialize properties into /tmp/LTLFireability3551396241555509122.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17657183126257772168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3551396241555509122.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(p2696==1)")||(G(F("(p2196==0)")))))))
Formula 0 simplified : XG(!"(p2696==1)" & FG!"(p2196==0)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3786248 kB
After kill :
MemTotal: 16393216 kB
MemFree: 12198028 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DLCflexbar-PT-3b"
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 DLCflexbar-PT-3b, 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 r101-tall-167814475500532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCflexbar-PT-3b.tgz
mv DLCflexbar-PT-3b 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 ;