Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 1019K Feb 26 04:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 26 04:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 04:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.5M Feb 26 04:25 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 228K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 609K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 612K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6M Feb 26 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Feb 26 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Feb 26 05:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12M Feb 26 05:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.8M 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 BART-PT-020-LTLFireability-00
FORMULA_NAME BART-PT-020-LTLFireability-01
FORMULA_NAME BART-PT-020-LTLFireability-02
FORMULA_NAME BART-PT-020-LTLFireability-03
FORMULA_NAME BART-PT-020-LTLFireability-04
FORMULA_NAME BART-PT-020-LTLFireability-05
FORMULA_NAME BART-PT-020-LTLFireability-06
FORMULA_NAME BART-PT-020-LTLFireability-07
FORMULA_NAME BART-PT-020-LTLFireability-08
FORMULA_NAME BART-PT-020-LTLFireability-09
FORMULA_NAME BART-PT-020-LTLFireability-10
FORMULA_NAME BART-PT-020-LTLFireability-11
FORMULA_NAME BART-PT-020-LTLFireability-12
FORMULA_NAME BART-PT-020-LTLFireability-13
FORMULA_NAME BART-PT-020-LTLFireability-14
FORMULA_NAME BART-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678526434328

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=BART-PT-020
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 09:20:36] [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-11 09:20:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:20:37] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2023-03-11 09:20:37] [INFO ] Transformed 2850 places.
[2023-03-11 09:20:37] [INFO ] Transformed 4040 transitions.
[2023-03-11 09:20:37] [INFO ] Found NUPN structural information;
[2023-03-11 09:20:37] [INFO ] Parsed PT model containing 2850 places and 4040 transitions and 32400 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-020-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1581 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 189 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2023-03-11 09:20:38] [INFO ] Computed 20 place invariants in 46 ms
[2023-03-11 09:20:38] [INFO ] Implicit Places using invariants in 673 ms returned []
[2023-03-11 09:20:38] [INFO ] Invariant cache hit.
[2023-03-11 09:20:39] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-03-11 09:20:39] [INFO ] Invariant cache hit.
[2023-03-11 09:20:42] [INFO ] Dead Transitions using invariants and state equation in 3294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4785 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Support contains 1581 out of 2640 places after structural reductions.
[2023-03-11 09:20:43] [INFO ] Flatten gal took : 240 ms
[2023-03-11 09:20:43] [INFO ] Flatten gal took : 185 ms
[2023-03-11 09:20:44] [INFO ] Input system was already deterministic with 4040 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:20:44] [INFO ] Invariant cache hit.
[2023-03-11 09:20:45] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2023-03-11 09:20:47] [INFO ] After 2149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 09:20:48] [INFO ] After 2471ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-11 09:20:48] [INFO ] After 3346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 144 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 5 ms.
Computed a total of 0 stabilizing places and 0 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' '!(X(F((G(F(!p0))||((G(F(!p0))||(F(!p0)&&F(!p1)))&&X(G(p2)))))))'
Support contains 200 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 460 places :
Symmetric choice reduction at 0 with 460 rule applications. Total rules 460 place count 2180 transition count 3580
Iterating global reduction 0 with 460 rules applied. Total rules applied 920 place count 2180 transition count 3580
Discarding 380 places :
Symmetric choice reduction at 0 with 380 rule applications. Total rules 1300 place count 1800 transition count 3200
Iterating global reduction 0 with 380 rules applied. Total rules applied 1680 place count 1800 transition count 3200
Applied a total of 1680 rules in 430 ms. Remains 1800 /2640 variables (removed 840) and now considering 3200/4040 (removed 840) transitions.
// Phase 1: matrix 3200 rows 1800 cols
[2023-03-11 09:20:49] [INFO ] Computed 20 place invariants in 11 ms
[2023-03-11 09:20:49] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-11 09:20:49] [INFO ] Invariant cache hit.
[2023-03-11 09:20:51] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2023-03-11 09:20:51] [INFO ] Invariant cache hit.
[2023-03-11 09:20:52] [INFO ] Dead Transitions using invariants and state equation in 1811 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1800/2640 places, 3200/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4171 ms. Remains : 1800/2640 places, 3200/4040 transitions.
Stuttering acceptance computed with spot in 639 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 p1), p0, (AND p1 p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s367 1) (EQ s140 1) (EQ s247 1) (EQ s307 1) (EQ s677 1) (EQ s300 1) (EQ s254 1) (EQ s670 1) (EQ s360 1) (EQ s615 1) (EQ s154 1) (EQ s498 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 1096 ms.
Product exploration explored 100000 steps with 30 reset in 856 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 807 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 479 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 p1), p0, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:21:00] [INFO ] Invariant cache hit.
[2023-03-11 09:21:00] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F p0), (F (AND p1 p0)), (F (AND p1 p2)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 9 factoid took 1143 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 295 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Support contains 200 out of 1800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 3200/3200 transitions.
Applied a total of 0 rules in 106 ms. Remains 1800 /1800 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2023-03-11 09:21:02] [INFO ] Invariant cache hit.
[2023-03-11 09:21:02] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-11 09:21:02] [INFO ] Invariant cache hit.
[2023-03-11 09:21:04] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
[2023-03-11 09:21:04] [INFO ] Invariant cache hit.
[2023-03-11 09:21:05] [INFO ] Dead Transitions using invariants and state equation in 1451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3324 ms. Remains : 1800/1800 places, 3200/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 415 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 198 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), p0]
Finished random walk after 248 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F p0)]
Knowledge based reduction with 5 factoid took 437 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 190 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), p0]
Product exploration explored 100000 steps with 35 reset in 676 ms.
Product exploration explored 100000 steps with 47 reset in 692 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), p0]
Support contains 200 out of 1800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1800/1800 places, 3200/3200 transitions.
Performed 220 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 1800 transition count 3200
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 80 Pre rules applied. Total rules applied 220 place count 1800 transition count 3200
Deduced a syphon composed of 300 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 300 place count 1800 transition count 3200
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 320 place count 1780 transition count 3180
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 340 place count 1780 transition count 3180
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 680 places in 2 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 740 place count 1780 transition count 3200
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 760 place count 1780 transition count 3180
Discarding 380 places :
Symmetric choice reduction at 2 with 380 rule applications. Total rules 1140 place count 1400 transition count 2800
Deduced a syphon composed of 300 places in 1 ms
Iterating global reduction 2 with 380 rules applied. Total rules applied 1520 place count 1400 transition count 2800
Performed 101 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 401 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1621 place count 1400 transition count 3208
Ensure Unique test removed 284 transitions
Reduce isomorphic transitions removed 284 transitions.
Iterating post reduction 2 with 284 rules applied. Total rules applied 1905 place count 1400 transition count 2924
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1945 place count 1360 transition count 2804
Deduced a syphon composed of 361 places in 2 ms
Iterating global reduction 3 with 40 rules applied. Total rules applied 1985 place count 1360 transition count 2804
Performed 101 Post agglomeration using F-continuation condition with reduction of 124 identical transitions.
Deduced a syphon composed of 462 places in 2 ms
Iterating global reduction 3 with 101 rules applied. Total rules applied 2086 place count 1360 transition count 3776
Ensure Unique test removed 628 transitions
Reduce isomorphic transitions removed 628 transitions.
Iterating post reduction 3 with 628 rules applied. Total rules applied 2714 place count 1360 transition count 3148
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 2776 place count 1298 transition count 2776
Deduced a syphon composed of 400 places in 1 ms
Iterating global reduction 4 with 62 rules applied. Total rules applied 2838 place count 1298 transition count 2776
Performed 101 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 501 places in 2 ms
Iterating global reduction 4 with 101 rules applied. Total rules applied 2939 place count 1298 transition count 4210
Ensure Unique test removed 781 transitions
Reduce isomorphic transitions removed 781 transitions.
Iterating post reduction 4 with 781 rules applied. Total rules applied 3720 place count 1298 transition count 3429
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 3741 place count 1277 transition count 3291
Deduced a syphon composed of 480 places in 0 ms
Iterating global reduction 5 with 21 rules applied. Total rules applied 3762 place count 1277 transition count 3291
Performed 101 Post agglomeration using F-continuation condition with reduction of 162 identical transitions.
Deduced a syphon composed of 581 places in 2 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 3863 place count 1277 transition count 5109
Ensure Unique test removed 1111 transitions
Reduce isomorphic transitions removed 1111 transitions.
Iterating post reduction 5 with 1111 rules applied. Total rules applied 4974 place count 1277 transition count 3998
Discarding 101 places :
Symmetric choice reduction at 6 with 101 rule applications. Total rules 5075 place count 1176 transition count 2988
Deduced a syphon composed of 480 places in 1 ms
Iterating global reduction 6 with 101 rules applied. Total rules applied 5176 place count 1176 transition count 2988
Performed 101 Post agglomeration using F-continuation condition with reduction of 162 identical transitions.
Deduced a syphon composed of 581 places in 2 ms
Iterating global reduction 6 with 101 rules applied. Total rules applied 5277 place count 1176 transition count 4806
Ensure Unique test removed 1111 transitions
Reduce isomorphic transitions removed 1111 transitions.
Iterating post reduction 6 with 1111 rules applied. Total rules applied 6388 place count 1176 transition count 3695
Discarding 101 places :
Symmetric choice reduction at 7 with 101 rule applications. Total rules 6489 place count 1075 transition count 2685
Deduced a syphon composed of 480 places in 1 ms
Iterating global reduction 7 with 101 rules applied. Total rules applied 6590 place count 1075 transition count 2685
Performed 101 Post agglomeration using F-continuation condition with reduction of 162 identical transitions.
Deduced a syphon composed of 581 places in 1 ms
Iterating global reduction 7 with 101 rules applied. Total rules applied 6691 place count 1075 transition count 4503
Ensure Unique test removed 1111 transitions
Reduce isomorphic transitions removed 1111 transitions.
Iterating post reduction 7 with 1111 rules applied. Total rules applied 7802 place count 1075 transition count 3392
Discarding 101 places :
Symmetric choice reduction at 8 with 101 rule applications. Total rules 7903 place count 974 transition count 2382
Deduced a syphon composed of 480 places in 1 ms
Iterating global reduction 8 with 101 rules applied. Total rules applied 8004 place count 974 transition count 2382
Performed 54 Post agglomeration using F-continuation condition with reduction of 68 identical transitions.
Deduced a syphon composed of 534 places in 0 ms
Iterating global reduction 8 with 54 rules applied. Total rules applied 8058 place count 974 transition count 3354
Ensure Unique test removed 594 transitions
Reduce isomorphic transitions removed 594 transitions.
Iterating post reduction 8 with 594 rules applied. Total rules applied 8652 place count 974 transition count 2760
Discarding 74 places :
Symmetric choice reduction at 9 with 74 rule applications. Total rules 8726 place count 900 transition count 2020
Deduced a syphon composed of 460 places in 0 ms
Iterating global reduction 9 with 74 rules applied. Total rules applied 8800 place count 900 transition count 2020
Deduced a syphon composed of 460 places in 1 ms
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 8820 place count 900 transition count 2000
Deduced a syphon composed of 460 places in 0 ms
Applied a total of 8820 rules in 1586 ms. Remains 900 /1800 variables (removed 900) and now considering 2000/3200 (removed 1200) transitions.
[2023-03-11 09:21:11] [INFO ] Redundant transitions in 128 ms returned []
// Phase 1: matrix 2000 rows 900 cols
[2023-03-11 09:21:11] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-11 09:21:14] [INFO ] Dead Transitions using invariants and state equation in 2432 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 900/1800 places, 2000/3200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4167 ms. Remains : 900/1800 places, 2000/3200 transitions.
Built C files in :
/tmp/ltsmin3666047021256891827
[2023-03-11 09:21:14] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3666047021256891827
Running compilation step : cd /tmp/ltsmin3666047021256891827;'/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/ltsmin3666047021256891827;'/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/ltsmin3666047021256891827;'/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 200 out of 1800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 3200/3200 transitions.
Applied a total of 0 rules in 120 ms. Remains 1800 /1800 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 1800 cols
[2023-03-11 09:21:17] [INFO ] Computed 20 place invariants in 21 ms
[2023-03-11 09:21:17] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-11 09:21:17] [INFO ] Invariant cache hit.
[2023-03-11 09:21:19] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
[2023-03-11 09:21:19] [INFO ] Invariant cache hit.
[2023-03-11 09:21:20] [INFO ] Dead Transitions using invariants and state equation in 1743 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3467 ms. Remains : 1800/1800 places, 3200/3200 transitions.
Built C files in :
/tmp/ltsmin6875472229775989930
[2023-03-11 09:21:20] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6875472229775989930
Running compilation step : cd /tmp/ltsmin6875472229775989930;'/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/ltsmin6875472229775989930;'/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/ltsmin6875472229775989930;'/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-11 09:21:24] [INFO ] Flatten gal took : 71 ms
[2023-03-11 09:21:24] [INFO ] Flatten gal took : 82 ms
[2023-03-11 09:21:24] [INFO ] Time to serialize gal into /tmp/LTL7294909612240832949.gal : 19 ms
[2023-03-11 09:21:24] [INFO ] Time to serialize properties into /tmp/LTL15281064841360533448.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/LTL7294909612240832949.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5661299369411274042.hoa' '-atoms' '/tmp/LTL15281064841360533448.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/LTL15281064841360533448.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5661299369411274042.hoa
Detected timeout of ITS tools.
[2023-03-11 09:21:39] [INFO ] Flatten gal took : 93 ms
[2023-03-11 09:21:39] [INFO ] Flatten gal took : 73 ms
[2023-03-11 09:21:39] [INFO ] Time to serialize gal into /tmp/LTL1988356639180237843.gal : 12 ms
[2023-03-11 09:21:39] [INFO ] Time to serialize properties into /tmp/LTL13322102043729285731.ltl : 19 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/LTL1988356639180237843.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13322102043729285731.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 : !((X(F((G(F("((((((TrainState_13_1_1!=1)&&(TrainState_14_1_1!=1))&&((TrainState_15_1_1!=1)&&(TrainState_16_1_1!=1)))&&(((TrainState_17...15640
Formula 0 simplified : XG(FG!"((((((TrainState_13_1_1!=1)&&(TrainState_14_1_1!=1))&&((TrainState_15_1_1!=1)&&(TrainState_16_1_1!=1)))&&(((TrainState_17_1_1...15618
Detected timeout of ITS tools.
[2023-03-11 09:21:55] [INFO ] Flatten gal took : 103 ms
[2023-03-11 09:21:55] [INFO ] Applying decomposition
[2023-03-11 09:21:55] [INFO ] Flatten gal took : 75 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/graph1723871880785879484.txt' '-o' '/tmp/graph1723871880785879484.bin' '-w' '/tmp/graph1723871880785879484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1723871880785879484.bin' '-l' '-1' '-v' '-w' '/tmp/graph1723871880785879484.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:21:55] [INFO ] Decomposing Gal with order
[2023-03-11 09:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:21:55] [INFO ] Removed a total of 240 redundant transitions.
[2023-03-11 09:21:55] [INFO ] Flatten gal took : 187 ms
[2023-03-11 09:21:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-11 09:21:55] [INFO ] Time to serialize gal into /tmp/LTL1421813393074784623.gal : 26 ms
[2023-03-11 09:21:55] [INFO ] Time to serialize properties into /tmp/LTL2072595413912275571.ltl : 4 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/LTL1421813393074784623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2072595413912275571.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...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((((((i14.u12.TrainState_13_1_1!=1)&&(i10.u13.TrainState_14_1_1!=1))&&((i19.u39.TrainState_15_1_1!=1)&&(i17.u14.TrainStat...20569
Formula 0 simplified : XG(FG!"((((((i14.u12.TrainState_13_1_1!=1)&&(i10.u13.TrainState_14_1_1!=1))&&((i19.u39.TrainState_15_1_1!=1)&&(i17.u14.TrainState_16...20547
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
115 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.42813,44360,1,0,38723,9252,12208,52824,1029,20289,129588
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-020-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-020-LTLFireability-00 finished in 68816 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' '!((p0 U X(G((p1 U (G(p3)||p2))))))'
Support contains 1400 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 2580 transition count 3980
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 2580 transition count 3980
Applied a total of 120 rules in 82 ms. Remains 2580 /2640 variables (removed 60) and now considering 3980/4040 (removed 60) transitions.
// Phase 1: matrix 3980 rows 2580 cols
[2023-03-11 09:21:57] [INFO ] Computed 20 place invariants in 39 ms
[2023-03-11 09:21:58] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-11 09:21:58] [INFO ] Invariant cache hit.
[2023-03-11 09:22:00] [INFO ] Implicit Places using invariants and state equation in 2321 ms returned []
Implicit Place search using SMT with State Equation took 2721 ms to find 0 implicit places.
[2023-03-11 09:22:00] [INFO ] Invariant cache hit.
[2023-03-11 09:22:03] [INFO ] Dead Transitions using invariants and state equation in 3005 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2580/2640 places, 3980/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5824 ms. Remains : 2580/2640 places, 3980/4040 transitions.
Stuttering acceptance computed with spot in 604 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BART-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p2 p3 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p3) (AND p0 p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p3 p1), acceptance={1} source=1 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3) p1), acceptance={0, 1} source=1 dest: 6}, { cond=(AND p0 (NOT p2) p3 (NOT p1)), acceptance={1} source=1 dest: 7}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p3 p1), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(OR (AND p2 (NOT p3)) (AND (NOT p3) p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 p3) (AND p3 p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2) p3 p1), acceptance={1} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3) p1), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 (NOT p2) p3 (NOT p1)), acceptance={1} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)), acceptance={0} source=7 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2) p3 p1), acceptance={1} source=7 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3) p1), acceptance={0, 1} source=7 dest: 6}, { cond=(OR (AND p0 p2 p3) (AND p0 p3 p1)), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2) p3 (NOT p1)), acceptance={1} source=7 dest: 7}]], initial=1, aps=[p2:(OR (EQ s9 1) (EQ s8 1) (EQ s12 1) (EQ s7 1) (EQ s3 1) (EQ s13 1) (EQ s4 1) (EQ s18 1) (EQ s17 1) (EQ s2 1) (EQ s6 1) (EQ s0 1) (EQ s5 1) (EQ s16 1) (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 21 steps with 0 reset in 2 ms.
FORMULA BART-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-01 finished in 6494 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' '!((!p0 U (p0&&G(!p1))))'
Support contains 1540 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Iterating post reduction 0 with 480 rules applied. Total rules applied 480 place count 2640 transition count 3560
Reduce places removed 480 places and 0 transitions.
Iterating post reduction 1 with 480 rules applied. Total rules applied 960 place count 2160 transition count 3560
Applied a total of 960 rules in 158 ms. Remains 2160 /2640 variables (removed 480) and now considering 3560/4040 (removed 480) transitions.
// Phase 1: matrix 3560 rows 2160 cols
[2023-03-11 09:22:04] [INFO ] Computed 20 place invariants in 16 ms
[2023-03-11 09:22:04] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-11 09:22:04] [INFO ] Invariant cache hit.
[2023-03-11 09:22:06] [INFO ] Implicit Places using invariants and state equation in 2101 ms returned []
Implicit Place search using SMT with State Equation took 2531 ms to find 0 implicit places.
[2023-03-11 09:22:06] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-11 09:22:06] [INFO ] Invariant cache hit.
[2023-03-11 09:22:10] [INFO ] Dead Transitions using invariants and state equation in 3275 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2160/2640 places, 3560/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6102 ms. Remains : 2160/2640 places, 3560/4040 transitions.
Stuttering acceptance computed with spot in 145 ms :[p1, true, (OR (NOT p0) p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (EQ s185 1) (EQ s1508 1) (EQ s301 1) (EQ s901 1) (EQ s812 1) (EQ s2031 1) (EQ s273 1) (EQ s1439 1) (EQ s44 1) (EQ s1939 1) (EQ s1336 1) (EQ s1004 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 3 ms.
FORMULA BART-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-03 finished in 6289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1360 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2640 transition count 3980
Reduce places removed 60 places and 0 transitions.
Performed 540 Post agglomeration using F-continuation condition.Transition count delta: 540
Iterating post reduction 1 with 600 rules applied. Total rules applied 660 place count 2580 transition count 3440
Reduce places removed 540 places and 0 transitions.
Iterating post reduction 2 with 540 rules applied. Total rules applied 1200 place count 2040 transition count 3440
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1220 place count 2020 transition count 3420
Iterating global reduction 3 with 20 rules applied. Total rules applied 1240 place count 2020 transition count 3420
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1400 place count 1940 transition count 3340
Applied a total of 1400 rules in 243 ms. Remains 1940 /2640 variables (removed 700) and now considering 3340/4040 (removed 700) transitions.
// Phase 1: matrix 3340 rows 1940 cols
[2023-03-11 09:22:10] [INFO ] Computed 20 place invariants in 10 ms
[2023-03-11 09:22:10] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-11 09:22:10] [INFO ] Invariant cache hit.
[2023-03-11 09:22:12] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
[2023-03-11 09:22:12] [INFO ] Redundant transitions in 114 ms returned []
[2023-03-11 09:22:12] [INFO ] Invariant cache hit.
[2023-03-11 09:22:14] [INFO ] Dead Transitions using invariants and state equation in 1966 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1940/2640 places, 3340/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3910 ms. Remains : 1940/2640 places, 3340/4040 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s185 1) (EQ s1288 1) (EQ s261 1) (EQ s701 1) (EQ s632 1) (EQ s1811 1) (EQ s253 1) (EQ s1219 1) (EQ s44 1) (EQ s1719 1) (EQ s1116 1) (EQ s784 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1152 ms.
Product exploration explored 100000 steps with 0 reset in 1287 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0)]
[2023-03-11 09:22:19] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1360 out of 1940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1940/1940 places, 3340/3340 transitions.
Applied a total of 0 rules in 59 ms. Remains 1940 /1940 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2023-03-11 09:22:34] [INFO ] Invariant cache hit.
[2023-03-11 09:22:35] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-11 09:22:35] [INFO ] Invariant cache hit.
[2023-03-11 09:22:36] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2023-03-11 09:22:36] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-11 09:22:36] [INFO ] Invariant cache hit.
[2023-03-11 09:22:38] [INFO ] Dead Transitions using invariants and state equation in 1794 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3719 ms. Remains : 1940/1940 places, 3340/3340 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 270 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-11 09:22:41] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1106 ms.
Product exploration explored 100000 steps with 0 reset in 1294 ms.
Built C files in :
/tmp/ltsmin2007431217757557483
[2023-03-11 09:22:59] [INFO ] Too many transitions (3340) to apply POR reductions. Disabling POR matrices.
[2023-03-11 09:22:59] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2007431217757557483
Running compilation step : cd /tmp/ltsmin2007431217757557483;'/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/ltsmin2007431217757557483;'/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/ltsmin2007431217757557483;'/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 1360 out of 1940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1940/1940 places, 3340/3340 transitions.
Applied a total of 0 rules in 57 ms. Remains 1940 /1940 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2023-03-11 09:23:02] [INFO ] Invariant cache hit.
[2023-03-11 09:23:02] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-11 09:23:02] [INFO ] Invariant cache hit.
[2023-03-11 09:23:04] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1921 ms to find 0 implicit places.
[2023-03-11 09:23:04] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-11 09:23:04] [INFO ] Invariant cache hit.
[2023-03-11 09:23:06] [INFO ] Dead Transitions using invariants and state equation in 2162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4232 ms. Remains : 1940/1940 places, 3340/3340 transitions.
Built C files in :
/tmp/ltsmin12988683491246671489
[2023-03-11 09:23:06] [INFO ] Too many transitions (3340) to apply POR reductions. Disabling POR matrices.
[2023-03-11 09:23:06] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12988683491246671489
Running compilation step : cd /tmp/ltsmin12988683491246671489;'/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/ltsmin12988683491246671489;'/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/ltsmin12988683491246671489;'/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-11 09:23:09] [INFO ] Flatten gal took : 79 ms
[2023-03-11 09:23:09] [INFO ] Flatten gal took : 72 ms
[2023-03-11 09:23:10] [INFO ] Time to serialize gal into /tmp/LTL10059566610130860231.gal : 14 ms
[2023-03-11 09:23:10] [INFO ] Time to serialize properties into /tmp/LTL12057303133405333447.prop : 4 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/LTL10059566610130860231.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1419916592975819620.hoa' '-atoms' '/tmp/LTL12057303133405333447.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/LTL12057303133405333447.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1419916592975819620.hoa
Detected timeout of ITS tools.
[2023-03-11 09:23:25] [INFO ] Flatten gal took : 58 ms
[2023-03-11 09:23:25] [INFO ] Flatten gal took : 75 ms
[2023-03-11 09:23:25] [INFO ] Time to serialize gal into /tmp/LTL14367979503321899890.gal : 28 ms
[2023-03-11 09:23:25] [INFO ] Time to serialize properties into /tmp/LTL17412204764672308918.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/LTL14367979503321899890.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17412204764672308918.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 : !((F(G("((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainState_13_...35898
Formula 0 simplified : GF!"((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainState_13_4_...35892
Detected timeout of ITS tools.
[2023-03-11 09:23:40] [INFO ] Flatten gal took : 123 ms
[2023-03-11 09:23:40] [INFO ] Applying decomposition
[2023-03-11 09:23:40] [INFO ] Flatten gal took : 75 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/graph2255869518823961800.txt' '-o' '/tmp/graph2255869518823961800.bin' '-w' '/tmp/graph2255869518823961800.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2255869518823961800.bin' '-l' '-1' '-v' '-w' '/tmp/graph2255869518823961800.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:23:40] [INFO ] Decomposing Gal with order
[2023-03-11 09:23:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:23:41] [INFO ] Removed a total of 206 redundant transitions.
[2023-03-11 09:23:41] [INFO ] Flatten gal took : 163 ms
[2023-03-11 09:23:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 16 ms.
[2023-03-11 09:23:41] [INFO ] Time to serialize gal into /tmp/LTL15090548558152936250.gal : 28 ms
[2023-03-11 09:23:41] [INFO ] Time to serialize properties into /tmp/LTL16524337278665673171.ltl : 4 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/LTL15090548558152936250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16524337278665673171.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((((i2.u33.TrainState_6_1_7==1)||(i9.u298.TrainState_9_1_27==1))||((i5.u37.TrainState_2_1_9==1)||(i5.u37.TrainState_2_...46798
Formula 0 simplified : GF!"((((((((((((i2.u33.TrainState_6_1_7==1)||(i9.u298.TrainState_9_1_27==1))||((i5.u37.TrainState_2_1_9==1)||(i5.u37.TrainState_2_1_...46792
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
221 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.50159,73400,1,0,96760,13446,14642,216727,2142,37692,180736
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-020-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-020-LTLFireability-05 finished in 94078 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((!p0 U X(X(p0)))) U p0)&&F(G(p1))))'
Support contains 1540 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 84 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2023-03-11 09:23:44] [INFO ] Computed 20 place invariants in 37 ms
[2023-03-11 09:23:45] [INFO ] Implicit Places using invariants in 702 ms returned []
[2023-03-11 09:23:45] [INFO ] Invariant cache hit.
[2023-03-11 09:23:45] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2023-03-11 09:23:45] [INFO ] Invariant cache hit.
[2023-03-11 09:23:48] [INFO ] Dead Transitions using invariants and state equation in 3130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4440 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : BART-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s205 1) (EQ s1728 1) (EQ s321 1) (EQ s921 1) (EQ s832 1) (EQ s2431 1) (EQ s293 1) (EQ s1639 1) (EQ s64 1) (EQ s2299 1) (EQ s1496 1) (EQ s1064 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 814 ms.
Product exploration explored 100000 steps with 0 reset in 767 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 439 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 45 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 478 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
[2023-03-11 09:23:54] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-11 09:24:09] [INFO ] Invariant cache hit.
[2023-03-11 09:24:13] [INFO ] [Real]Absence check using 20 positive place invariants in 160 ms returned sat
[2023-03-11 09:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:24:24] [INFO ] [Real]Absence check using state equation in 11167 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1540 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 51 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2023-03-11 09:24:24] [INFO ] Invariant cache hit.
[2023-03-11 09:24:25] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-11 09:24:25] [INFO ] Invariant cache hit.
[2023-03-11 09:24:26] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2023-03-11 09:24:26] [INFO ] Invariant cache hit.
[2023-03-11 09:24:29] [INFO ] Dead Transitions using invariants and state equation in 3220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4844 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 33 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 396 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
[2023-03-11 09:24:34] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-11 09:24:49] [INFO ] Invariant cache hit.
[2023-03-11 09:24:52] [INFO ] [Real]Absence check using 20 positive place invariants in 123 ms returned sat
[2023-03-11 09:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:25:04] [INFO ] [Real]Absence check using state equation in 11764 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 3 reset in 884 ms.
Product exploration explored 100000 steps with 3 reset in 933 ms.
Applying partial POR strategy [false, true, false, false, true, true]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1540 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 480 rules applied. Total rules applied 480 place count 2640 transition count 4040
Deduced a syphon composed of 480 places in 1 ms
Applied a total of 480 rules in 226 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2023-03-11 09:25:07] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 4040 rows 2640 cols
[2023-03-11 09:25:07] [INFO ] Computed 20 place invariants in 18 ms
[2023-03-11 09:25:10] [INFO ] Dead Transitions using invariants and state equation in 3235 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2640/2640 places, 4040/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3584 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Built C files in :
/tmp/ltsmin17537829344046679158
[2023-03-11 09:25:10] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17537829344046679158
Running compilation step : cd /tmp/ltsmin17537829344046679158;'/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/ltsmin17537829344046679158;'/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/ltsmin17537829344046679158;'/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 1540 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 63 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2023-03-11 09:25:13] [INFO ] Computed 20 place invariants in 16 ms
[2023-03-11 09:25:14] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-11 09:25:14] [INFO ] Invariant cache hit.
[2023-03-11 09:25:14] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2023-03-11 09:25:14] [INFO ] Invariant cache hit.
[2023-03-11 09:25:18] [INFO ] Dead Transitions using invariants and state equation in 3234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4481 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Built C files in :
/tmp/ltsmin11879208644166305459
[2023-03-11 09:25:18] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11879208644166305459
Running compilation step : cd /tmp/ltsmin11879208644166305459;'/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/ltsmin11879208644166305459;'/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/ltsmin11879208644166305459;'/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-11 09:25:21] [INFO ] Flatten gal took : 135 ms
[2023-03-11 09:25:21] [INFO ] Flatten gal took : 89 ms
[2023-03-11 09:25:21] [INFO ] Time to serialize gal into /tmp/LTL17070606114774576079.gal : 15 ms
[2023-03-11 09:25:21] [INFO ] Time to serialize properties into /tmp/LTL17360994730282272098.prop : 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/LTL17070606114774576079.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4725317011551668795.hoa' '-atoms' '/tmp/LTL17360994730282272098.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/LTL17360994730282272098.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4725317011551668795.hoa
Detected timeout of ITS tools.
[2023-03-11 09:25:36] [INFO ] Flatten gal took : 120 ms
[2023-03-11 09:25:36] [INFO ] Flatten gal took : 110 ms
[2023-03-11 09:25:36] [INFO ] Time to serialize gal into /tmp/LTL17446894857044385774.gal : 14 ms
[2023-03-11 09:25:36] [INFO ] Time to serialize properties into /tmp/LTL11384889358547848881.ltl : 9 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/LTL17446894857044385774.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11384889358547848881.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((!("((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainState_...112335
Formula 0 simplified : GF!"(((((((((TrainState_8_3_9==1)||(TrainState_1_2_5==1))||((TrainState_8_3_7==1)||(TrainState_8_3_8==1)))||(((TrainState_18_4_14==1...148191
Detected timeout of ITS tools.
[2023-03-11 09:25:52] [INFO ] Flatten gal took : 101 ms
[2023-03-11 09:25:52] [INFO ] Applying decomposition
[2023-03-11 09:25:52] [INFO ] Flatten gal took : 167 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/graph15468076843745330243.txt' '-o' '/tmp/graph15468076843745330243.bin' '-w' '/tmp/graph15468076843745330243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15468076843745330243.bin' '-l' '-1' '-v' '-w' '/tmp/graph15468076843745330243.weights' '-q' '0' '-e' '0.001'
[2023-03-11 09:25:52] [INFO ] Decomposing Gal with order
[2023-03-11 09:25:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 09:25:52] [INFO ] Removed a total of 319 redundant transitions.
[2023-03-11 09:25:53] [INFO ] Flatten gal took : 200 ms
[2023-03-11 09:25:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 20 ms.
[2023-03-11 09:25:54] [INFO ] Time to serialize gal into /tmp/LTL11089749026145357324.gal : 23 ms
[2023-03-11 09:25:54] [INFO ] Time to serialize properties into /tmp/LTL9506852776659831784.ltl : 16 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/LTL11089749026145357324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9506852776659831784.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((!("((((((((((((i16.i0.u41.TrainState_6_1_7==1)||(i12.i0.u49.TrainState_9_1_27==1))||((i9.i0.u349.TrainState_2_1_9==1)||(i9.i0....159879
Formula 0 simplified : GF!"(((((((((i10.i0.u116.TrainState_8_3_9==1)||(i0.i0.u23.TrainState_1_2_5==1))||((i10.i0.u77.TrainState_8_3_7==1)||(i10.i0.u103.Tra...210915
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
317 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.52609,119516,1,0,169208,6996,19597,551457,1722,14793,245841
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-020-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-020-LTLFireability-06 finished in 134497 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 U p1)&&F(p2))))))'
Support contains 3 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 639 places :
Symmetric choice reduction at 0 with 639 rule applications. Total rules 639 place count 2001 transition count 3401
Iterating global reduction 0 with 639 rules applied. Total rules applied 1278 place count 2001 transition count 3401
Discarding 539 places :
Symmetric choice reduction at 0 with 539 rule applications. Total rules 1817 place count 1462 transition count 2862
Iterating global reduction 0 with 539 rules applied. Total rules applied 2356 place count 1462 transition count 2862
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2436 place count 1382 transition count 2782
Iterating global reduction 0 with 80 rules applied. Total rules applied 2516 place count 1382 transition count 2782
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2576 place count 1322 transition count 2722
Iterating global reduction 0 with 60 rules applied. Total rules applied 2636 place count 1322 transition count 2722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2696 place count 1262 transition count 2662
Iterating global reduction 0 with 60 rules applied. Total rules applied 2756 place count 1262 transition count 2662
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2816 place count 1202 transition count 2602
Iterating global reduction 0 with 60 rules applied. Total rules applied 2876 place count 1202 transition count 2602
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2936 place count 1142 transition count 2542
Iterating global reduction 0 with 60 rules applied. Total rules applied 2996 place count 1142 transition count 2542
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3056 place count 1082 transition count 2482
Iterating global reduction 0 with 60 rules applied. Total rules applied 3116 place count 1082 transition count 2482
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3156 place count 1042 transition count 2442
Iterating global reduction 0 with 40 rules applied. Total rules applied 3196 place count 1042 transition count 2442
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3236 place count 1002 transition count 2402
Iterating global reduction 0 with 40 rules applied. Total rules applied 3276 place count 1002 transition count 2402
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3296 place count 982 transition count 2382
Iterating global reduction 0 with 20 rules applied. Total rules applied 3316 place count 982 transition count 2382
Applied a total of 3316 rules in 712 ms. Remains 982 /2640 variables (removed 1658) and now considering 2382/4040 (removed 1658) transitions.
// Phase 1: matrix 2382 rows 982 cols
[2023-03-11 09:25:59] [INFO ] Computed 20 place invariants in 17 ms
[2023-03-11 09:26:00] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-11 09:26:00] [INFO ] Invariant cache hit.
[2023-03-11 09:26:01] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2023-03-11 09:26:01] [INFO ] Invariant cache hit.
[2023-03-11 09:26:02] [INFO ] Dead Transitions using invariants and state equation in 1418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 982/2640 places, 2382/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3626 ms. Remains : 982/2640 places, 2382/4040 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p2:(EQ s13 1), p1:(NEQ s35 1), p0:(NEQ s400 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2487 reset in 862 ms.
Product exploration explored 100000 steps with 2472 reset in 757 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 553 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:26:05] [INFO ] Invariant cache hit.
[2023-03-11 09:26:06] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2023-03-11 09:26:07] [INFO ] After 1068ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 09:26:07] [INFO ] After 1264ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-11 09:26:07] [INFO ] After 1691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 340 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=113 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p2 p1 p0), true]
False Knowledge obtained : [(F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 354 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 446 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 511 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 3 out of 982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 982/982 places, 2382/2382 transitions.
Applied a total of 0 rules in 74 ms. Remains 982 /982 variables (removed 0) and now considering 2382/2382 (removed 0) transitions.
[2023-03-11 09:26:08] [INFO ] Invariant cache hit.
[2023-03-11 09:26:09] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-11 09:26:09] [INFO ] Invariant cache hit.
[2023-03-11 09:26:10] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2023-03-11 09:26:10] [INFO ] Invariant cache hit.
[2023-03-11 09:26:11] [INFO ] Dead Transitions using invariants and state equation in 1162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2358 ms. Remains : 982/982 places, 2382/2382 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 485 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:26:12] [INFO ] Invariant cache hit.
[2023-03-11 09:26:12] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-11 09:26:13] [INFO ] After 810ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 09:26:13] [INFO ] After 934ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-11 09:26:13] [INFO ] After 1261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 328 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=109 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p2 p0 p1), true]
False Knowledge obtained : [(F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 295 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 456 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 484 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Product exploration explored 100000 steps with 2527 reset in 785 ms.
Product exploration explored 100000 steps with 2325 reset in 702 ms.
Applying partial POR strategy [true, true, true, false, false, false, true]
Stuttering acceptance computed with spot in 424 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 3 out of 982 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 982/982 places, 2382/2382 transitions.
Graph (trivial) has 2341 edges and 982 vertex of which 882 / 982 are part of one of the 18 SCC in 4 ms
Free SCC test removed 864 places
Ensure Unique test removed 2123 transitions
Reduce isomorphic transitions removed 2123 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 101 transition count 243
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 20 place count 101 transition count 243
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 101 transition count 243
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 98 transition count 240
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 98 transition count 240
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 48 place count 98 transition count 242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 98 transition count 236
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 70 place count 82 transition count 220
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 86 place count 82 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 82 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 82 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 80 transition count 214
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 80 transition count 214
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 80 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 102 place count 80 transition count 210
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 78 transition count 208
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 78 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 78 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 112 place count 78 transition count 204
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 114 place count 76 transition count 202
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 116 place count 76 transition count 202
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 76 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 122 place count 76 transition count 198
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 124 place count 74 transition count 196
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 126 place count 74 transition count 196
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 128 place count 74 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 132 place count 74 transition count 192
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 134 place count 72 transition count 190
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 136 place count 72 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 138 place count 72 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 142 place count 72 transition count 186
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 144 place count 70 transition count 184
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 146 place count 70 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 148 place count 70 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 152 place count 70 transition count 180
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 154 place count 68 transition count 178
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 156 place count 68 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 15 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 158 place count 68 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 162 place count 68 transition count 174
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 164 place count 66 transition count 172
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 166 place count 66 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 168 place count 66 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 172 place count 66 transition count 168
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 174 place count 64 transition count 166
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 176 place count 64 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 178 place count 64 transition count 166
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 182 place count 64 transition count 162
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 184 place count 62 transition count 160
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 12 with 2 rules applied. Total rules applied 186 place count 62 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 12 with 2 rules applied. Total rules applied 188 place count 62 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 192 place count 62 transition count 156
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 194 place count 60 transition count 154
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 13 with 2 rules applied. Total rules applied 196 place count 60 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 13 with 2 rules applied. Total rules applied 198 place count 60 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 202 place count 60 transition count 150
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 204 place count 58 transition count 148
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 14 with 2 rules applied. Total rules applied 206 place count 58 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 14 with 2 rules applied. Total rules applied 208 place count 58 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 212 place count 58 transition count 144
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 214 place count 56 transition count 142
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 15 with 2 rules applied. Total rules applied 216 place count 56 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 15 with 2 rules applied. Total rules applied 218 place count 56 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 222 place count 56 transition count 138
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 224 place count 54 transition count 136
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 16 with 2 rules applied. Total rules applied 226 place count 54 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 16 with 2 rules applied. Total rules applied 228 place count 54 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 232 place count 54 transition count 132
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 234 place count 52 transition count 130
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 17 with 2 rules applied. Total rules applied 236 place count 52 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 17 with 2 rules applied. Total rules applied 238 place count 52 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 242 place count 52 transition count 126
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 244 place count 50 transition count 124
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 18 with 2 rules applied. Total rules applied 246 place count 50 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 18 with 2 rules applied. Total rules applied 248 place count 50 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 252 place count 50 transition count 120
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 254 place count 48 transition count 118
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 19 with 2 rules applied. Total rules applied 256 place count 48 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 19 with 2 rules applied. Total rules applied 258 place count 48 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 262 place count 48 transition count 114
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 264 place count 46 transition count 112
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 20 with 2 rules applied. Total rules applied 266 place count 46 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 20 with 2 rules applied. Total rules applied 268 place count 46 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 272 place count 46 transition count 108
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 274 place count 44 transition count 106
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 21 with 2 rules applied. Total rules applied 276 place count 44 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 21 with 2 rules applied. Total rules applied 278 place count 44 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 282 place count 44 transition count 102
Discarding 2 places :
Symmetric choice reduction at 22 with 2 rule applications. Total rules 284 place count 42 transition count 100
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 22 with 2 rules applied. Total rules applied 286 place count 42 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 22 with 2 rules applied. Total rules applied 288 place count 42 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 292 place count 42 transition count 96
Discarding 2 places :
Symmetric choice reduction at 23 with 2 rule applications. Total rules 294 place count 40 transition count 94
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 23 with 2 rules applied. Total rules applied 296 place count 40 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 23 with 2 rules applied. Total rules applied 298 place count 40 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 302 place count 40 transition count 90
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 304 place count 38 transition count 88
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 24 with 2 rules applied. Total rules applied 306 place count 38 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 24 with 2 rules applied. Total rules applied 308 place count 38 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 312 place count 38 transition count 84
Discarding 2 places :
Symmetric choice reduction at 25 with 2 rule applications. Total rules 314 place count 36 transition count 82
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 25 with 2 rules applied. Total rules applied 316 place count 36 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 25 with 2 rules applied. Total rules applied 318 place count 36 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 322 place count 36 transition count 78
Discarding 2 places :
Symmetric choice reduction at 26 with 2 rule applications. Total rules 324 place count 34 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 26 with 2 rules applied. Total rules applied 326 place count 34 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 26 with 2 rules applied. Total rules applied 328 place count 34 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 332 place count 34 transition count 72
Discarding 2 places :
Symmetric choice reduction at 27 with 2 rule applications. Total rules 334 place count 32 transition count 70
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 27 with 2 rules applied. Total rules applied 336 place count 32 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 27 with 2 rules applied. Total rules applied 338 place count 32 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 342 place count 32 transition count 66
Discarding 2 places :
Symmetric choice reduction at 28 with 2 rule applications. Total rules 344 place count 30 transition count 64
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 28 with 2 rules applied. Total rules applied 346 place count 30 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 28 with 2 rules applied. Total rules applied 348 place count 30 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 352 place count 30 transition count 60
Discarding 2 places :
Symmetric choice reduction at 29 with 2 rule applications. Total rules 354 place count 28 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 29 with 2 rules applied. Total rules applied 356 place count 28 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 29 with 2 rules applied. Total rules applied 358 place count 28 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 362 place count 28 transition count 54
Discarding 2 places :
Symmetric choice reduction at 30 with 2 rule applications. Total rules 364 place count 26 transition count 52
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 30 with 2 rules applied. Total rules applied 366 place count 26 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 30 with 2 rules applied. Total rules applied 368 place count 26 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 372 place count 26 transition count 48
Discarding 2 places :
Symmetric choice reduction at 31 with 2 rule applications. Total rules 374 place count 24 transition count 46
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 31 with 2 rules applied. Total rules applied 376 place count 24 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 31 with 2 rules applied. Total rules applied 378 place count 24 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 382 place count 24 transition count 42
Discarding 2 places :
Symmetric choice reduction at 32 with 2 rule applications. Total rules 384 place count 22 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 32 with 2 rules applied. Total rules applied 386 place count 22 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 32 with 2 rules applied. Total rules applied 388 place count 22 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 392 place count 22 transition count 36
Discarding 2 places :
Symmetric choice reduction at 33 with 2 rule applications. Total rules 394 place count 20 transition count 34
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 33 with 2 rules applied. Total rules applied 396 place count 20 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 33 with 2 rules applied. Total rules applied 398 place count 20 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 402 place count 20 transition count 30
Discarding 2 places :
Symmetric choice reduction at 34 with 2 rule applications. Total rules 404 place count 18 transition count 28
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 34 with 2 rules applied. Total rules applied 406 place count 18 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 34 with 2 rules applied. Total rules applied 408 place count 18 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 412 place count 18 transition count 24
Discarding 2 places :
Symmetric choice reduction at 35 with 2 rule applications. Total rules 414 place count 16 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 35 with 2 rules applied. Total rules applied 416 place count 16 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 35 with 2 rules applied. Total rules applied 418 place count 16 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 422 place count 16 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 422 place count 16 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 423 place count 16 transition count 18
Discarding 6 places :
Symmetric choice reduction at 36 with 6 rule applications. Total rules 429 place count 10 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 36 with 6 rules applied. Total rules applied 435 place count 10 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 436 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 436 place count 10 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 437 place count 10 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 437 rules in 96 ms. Remains 10 /982 variables (removed 972) and now considering 11/2382 (removed 2371) transitions.
[2023-03-11 09:26:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2023-03-11 09:26:17] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 09:26:17] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/982 places, 11/2382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 10/982 places, 11/2382 transitions.
Built C files in :
/tmp/ltsmin8352624783396449549
[2023-03-11 09:26:17] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8352624783396449549
Running compilation step : cd /tmp/ltsmin8352624783396449549;'/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/ltsmin8352624783396449549;'/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/ltsmin8352624783396449549;'/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 3 out of 982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 982/982 places, 2382/2382 transitions.
Applied a total of 0 rules in 67 ms. Remains 982 /982 variables (removed 0) and now considering 2382/2382 (removed 0) transitions.
// Phase 1: matrix 2382 rows 982 cols
[2023-03-11 09:26:20] [INFO ] Computed 20 place invariants in 17 ms
[2023-03-11 09:26:20] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-11 09:26:20] [INFO ] Invariant cache hit.
[2023-03-11 09:26:21] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-03-11 09:26:21] [INFO ] Invariant cache hit.
[2023-03-11 09:26:22] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2148 ms. Remains : 982/982 places, 2382/2382 transitions.
Built C files in :
/tmp/ltsmin9125006285645969817
[2023-03-11 09:26:22] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9125006285645969817
Running compilation step : cd /tmp/ltsmin9125006285645969817;'/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/ltsmin9125006285645969817;'/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/ltsmin9125006285645969817;'/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-11 09:26:25] [INFO ] Flatten gal took : 34 ms
[2023-03-11 09:26:25] [INFO ] Flatten gal took : 34 ms
[2023-03-11 09:26:25] [INFO ] Time to serialize gal into /tmp/LTL9989490777441188638.gal : 7 ms
[2023-03-11 09:26:25] [INFO ] Time to serialize properties into /tmp/LTL7456614027395513937.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/LTL9989490777441188638.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11876651419250183391.hoa' '-atoms' '/tmp/LTL7456614027395513937.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/LTL7456614027395513937.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11876651419250183391.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
1400 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.1978,332328,1,0,206,1.85243e+06,38,97,24303,1.30859e+06,514
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-020-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.
Treatment of property BART-PT-020-LTLFireability-08 finished in 41934 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((X(p0) U p1)))))'
Support contains 2 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 681 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2023-03-11 09:26:41] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-11 09:26:41] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-11 09:26:41] [INFO ] Invariant cache hit.
[2023-03-11 09:26:42] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2023-03-11 09:26:42] [INFO ] Invariant cache hit.
[2023-03-11 09:26:43] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2958 ms. Remains : 980/2640 places, 2380/4040 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s30 1), p0:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 46 reset in 573 ms.
Product exploration explored 100000 steps with 44 reset in 476 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 365 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1)]
Finished random walk after 211 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 407 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
[2023-03-11 09:26:46] [INFO ] Invariant cache hit.
[2023-03-11 09:26:47] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 6 factoid took 176 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-020-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-09 finished in 6375 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' '!(((p0&&F(p1)) U (G((G(p0)||(p0&&F(p1))))||(!p1&&(G(p0)||(p0&&F(p1)))))))'
Support contains 2 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 4034 edges and 2640 vertex of which 2505 / 2640 are part of one of the 19 SCC in 1 ms
Free SCC test removed 2486 places
Ensure Unique test removed 3814 transitions
Reduce isomorphic transitions removed 3814 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 136 transition count 144
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 149 place count 71 transition count 143
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 151 place count 70 transition count 142
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 151 place count 70 transition count 138
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 159 place count 66 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 165 place count 60 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 171 place count 60 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 172 place count 60 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 176 place count 56 transition count 127
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 56 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 183 place count 53 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 186 place count 53 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 189 place count 50 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 192 place count 50 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 48 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 48 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 46 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 46 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 45 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 45 transition count 116
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 216 place count 38 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 220 place count 38 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 36 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 228 place count 36 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 34 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 236 place count 34 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 240 place count 32 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 244 place count 32 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 248 place count 30 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 252 place count 30 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 256 place count 28 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 260 place count 28 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 264 place count 26 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 268 place count 26 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 272 place count 24 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 276 place count 24 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 280 place count 22 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 284 place count 22 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 288 place count 20 transition count 55
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 292 place count 20 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 296 place count 18 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 300 place count 18 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 304 place count 16 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 308 place count 16 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 312 place count 14 transition count 37
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 316 place count 14 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 320 place count 12 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 324 place count 12 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 328 place count 10 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 332 place count 10 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 336 place count 8 transition count 19
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 340 place count 8 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 344 place count 6 transition count 13
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 20 with 5 rules applied. Total rules applied 349 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 351 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 351 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 353 place count 4 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 354 place count 4 transition count 5
Applied a total of 354 rules in 28 ms. Remains 4 /2640 variables (removed 2636) and now considering 5/4040 (removed 4035) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-11 09:26:47] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 09:26:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 09:26:47] [INFO ] Invariant cache hit.
[2023-03-11 09:26:47] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-11 09:26:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:26:47] [INFO ] Invariant cache hit.
[2023-03-11 09:26:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2640 places, 5/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 4/2640 places, 5/4040 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s2 1), p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA BART-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-13 finished in 333 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)))'
Support contains 1 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 705 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2023-03-11 09:26:48] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-11 09:26:48] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-11 09:26:48] [INFO ] Invariant cache hit.
[2023-03-11 09:26:49] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
[2023-03-11 09:26:49] [INFO ] Invariant cache hit.
[2023-03-11 09:26:50] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2688 ms. Remains : 980/2640 places, 2380/4040 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s777 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-14 finished in 2816 ms.
All properties solved by simple procedures.
Total runtime 373401 ms.

BK_STOP 1678526810695

--------------------
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="BART-PT-020"
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 BART-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593600780"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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