Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180500308.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BART-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180500308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 97M
-rw-r--r-- 1 mcc users 2.6M Apr 13 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1M Apr 13 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Apr 12 22:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 12M Apr 12 22:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.2M Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.0M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3M Apr 13 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22M Apr 13 08:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8M Apr 13 03:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 13 03:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 283K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 12M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716351326015

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-050
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 04:15:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 04:15:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:15:29] [INFO ] Load time of PNML (sax parser for PT used): 1164 ms
[2024-05-22 04:15:29] [INFO ] Transformed 6810 places.
[2024-05-22 04:15:30] [INFO ] Transformed 10100 transitions.
[2024-05-22 04:15:30] [INFO ] Found NUPN structural information;
[2024-05-22 04:15:30] [INFO ] Parsed PT model containing 6810 places and 10100 transitions and 81000 arcs in 1465 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 257 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-050-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6554 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 97 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
// Phase 1: matrix 10100 rows 6600 cols
[2024-05-22 04:15:31] [INFO ] Computed 50 invariants in 133 ms
[2024-05-22 04:15:33] [INFO ] Implicit Places using invariants in 2021 ms returned []
Implicit Place search using SMT only with invariants took 2067 ms to find 0 implicit places.
[2024-05-22 04:15:33] [INFO ] Invariant cache hit.
[2024-05-22 04:15:35] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3621 ms. Remains : 6600/6600 places, 10100/10100 transitions.
Support contains 6554 out of 6600 places after structural reductions.
[2024-05-22 04:15:36] [INFO ] Flatten gal took : 619 ms
[2024-05-22 04:15:37] [INFO ] Flatten gal took : 646 ms
[2024-05-22 04:15:38] [INFO ] Input system was already deterministic with 10100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 782 ms. (steps per millisecond=12 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-22 04:15:40] [INFO ] Invariant cache hit.
[2024-05-22 04:15:42] [INFO ] [Real]Absence check using 50 positive place invariants in 91 ms returned sat
[2024-05-22 04:15:52] [INFO ] After 12779ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 04:15:55] [INFO ] [Nat]Absence check using 50 positive place invariants in 96 ms returned sat
[2024-05-22 04:16:07] [INFO ] After 11364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 04:16:12] [INFO ] After 16634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2336 ms.
[2024-05-22 04:16:15] [INFO ] After 22305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 521 steps, including 0 resets, run visited all 5 properties in 23 ms. (steps per millisecond=22 )
Parikh walk visited 5 properties in 33 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||(p0 U p1))) U (X(p0) U G(p0))))'
Support contains 6500 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 53 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
[2024-05-22 04:16:16] [INFO ] Invariant cache hit.
[2024-05-22 04:16:17] [INFO ] Implicit Places using invariants in 1323 ms returned []
Implicit Place search using SMT only with invariants took 1330 ms to find 0 implicit places.
[2024-05-22 04:16:17] [INFO ] Invariant cache hit.
[2024-05-22 04:16:18] [INFO ] Dead Transitions using invariants and state equation in 1377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2767 ms. Remains : 6600/6600 places, 10100/10100 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 381 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BART-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1895 1) (EQ s1655 1) (EQ s1852 1) (EQ s1458 1) (EQ s389 1) (EQ s764 1) (EQ s792 1) (EQ s1473 1) (EQ s603 1) (EQ s1867 1) (EQ s618 1) (EQ s251 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 4985 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BART-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-00 finished in 8282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F((X(X(p1))&&F(p2)))))))'
Support contains 3450 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 6600 transition count 9950
Reduce places removed 150 places and 0 transitions.
Performed 1300 Post agglomeration using F-continuation condition.Transition count delta: 1300
Iterating post reduction 1 with 1450 rules applied. Total rules applied 1600 place count 6450 transition count 8650
Reduce places removed 1300 places and 0 transitions.
Iterating post reduction 2 with 1300 rules applied. Total rules applied 2900 place count 5150 transition count 8650
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 2950 place count 5100 transition count 8600
Iterating global reduction 3 with 50 rules applied. Total rules applied 3000 place count 5100 transition count 8600
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 3400 place count 4900 transition count 8400
Applied a total of 3400 rules in 1458 ms. Remains 4900 /6600 variables (removed 1700) and now considering 8400/10100 (removed 1700) transitions.
// Phase 1: matrix 8400 rows 4900 cols
[2024-05-22 04:16:25] [INFO ] Computed 50 invariants in 81 ms
[2024-05-22 04:16:26] [INFO ] Implicit Places using invariants in 778 ms returned []
[2024-05-22 04:16:26] [INFO ] Invariant cache hit.
[2024-05-22 04:16:27] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2024-05-22 04:16:28] [INFO ] Redundant transitions in 1497 ms returned []
[2024-05-22 04:16:28] [INFO ] Invariant cache hit.
[2024-05-22 04:16:36] [INFO ] Dead Transitions using invariants and state equation in 8304 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4900/6600 places, 8400/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12751 ms. Remains : 4900/6600 places, 8400/10100 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BART-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p0:(AND (EQ s444 0) (EQ s4834 0) (EQ s4157 0) (EQ s4450 0) (EQ s4819 0) (EQ s798 0) (EQ s228 0) (EQ s1160 0) (EQ s1307 0) (EQ s4465 0) (EQ s562 0) (EQ s41...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1292 reset in 4933 ms.
Product exploration explored 100000 steps with 1186 reset in 4832 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2607 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2612 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 04:17:07] [INFO ] Invariant cache hit.
[2024-05-22 04:17:18] [INFO ] After 1551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 04:17:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 91 ms returned sat
[2024-05-22 04:17:20] [INFO ] After 2615ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 3450 out of 4900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4900/4900 places, 8400/8400 transitions.
Applied a total of 0 rules in 133 ms. Remains 4900 /4900 variables (removed 0) and now considering 8400/8400 (removed 0) transitions.
[2024-05-22 04:17:21] [INFO ] Invariant cache hit.
[2024-05-22 04:17:21] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-22 04:17:21] [INFO ] Invariant cache hit.
[2024-05-22 04:17:22] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
[2024-05-22 04:17:23] [INFO ] Redundant transitions in 784 ms returned []
[2024-05-22 04:17:23] [INFO ] Invariant cache hit.
[2024-05-22 04:17:31] [INFO ] Dead Transitions using invariants and state equation in 7826 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10116 ms. Remains : 4900/4900 places, 8400/8400 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 p2) p0), (X (AND (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0), (X (AND (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 609 reset in 4391 ms.
Product exploration explored 100000 steps with 611 reset in 4467 ms.
Built C files in :
/tmp/ltsmin10814808387937527126
[2024-05-22 04:17:48] [INFO ] Too many transitions (8400) to apply POR reductions. Disabling POR matrices.
[2024-05-22 04:17:49] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10814808387937527126
Running compilation step : cd /tmp/ltsmin10814808387937527126;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin10814808387937527126;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10814808387937527126;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 3450 out of 4900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4900/4900 places, 8400/8400 transitions.
Applied a total of 0 rules in 153 ms. Remains 4900 /4900 variables (removed 0) and now considering 8400/8400 (removed 0) transitions.
[2024-05-22 04:17:52] [INFO ] Invariant cache hit.
[2024-05-22 04:17:53] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-05-22 04:17:53] [INFO ] Invariant cache hit.
[2024-05-22 04:17:53] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1609 ms to find 0 implicit places.
[2024-05-22 04:17:55] [INFO ] Redundant transitions in 1196 ms returned []
[2024-05-22 04:17:55] [INFO ] Invariant cache hit.
[2024-05-22 04:18:04] [INFO ] Dead Transitions using invariants and state equation in 9790 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12764 ms. Remains : 4900/4900 places, 8400/8400 transitions.
Built C files in :
/tmp/ltsmin17336011157165594695
[2024-05-22 04:18:04] [INFO ] Too many transitions (8400) to apply POR reductions. Disabling POR matrices.
[2024-05-22 04:18:04] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17336011157165594695
Running compilation step : cd /tmp/ltsmin17336011157165594695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin17336011157165594695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17336011157165594695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-22 04:18:08] [INFO ] Flatten gal took : 186 ms
[2024-05-22 04:18:09] [INFO ] Flatten gal took : 200 ms
[2024-05-22 04:18:09] [INFO ] Time to serialize gal into /tmp/LTL916827826832292569.gal : 60 ms
[2024-05-22 04:18:09] [INFO ] Time to serialize properties into /tmp/LTL363148284066800684.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL916827826832292569.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3220276771819260606.hoa' '-atoms' '/tmp/LTL363148284066800684.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL363148284066800684.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3220276771819260606.hoa
Detected timeout of ITS tools.
[2024-05-22 04:18:24] [INFO ] Flatten gal took : 227 ms
[2024-05-22 04:18:24] [INFO ] Flatten gal took : 198 ms
[2024-05-22 04:18:24] [INFO ] Time to serialize gal into /tmp/LTL25951507952610308.gal : 62 ms
[2024-05-22 04:18:24] [INFO ] Time to serialize properties into /tmp/LTL12835964001112854349.ltl : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL25951507952610308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12835964001112854349.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((((TrainState_45_1_6==0)&&(TrainState_35_1_39==0))&&((TrainState_8_1_33==0)&&(TrainState_1_1_35==0)))&&(((TrainStat...182520
Formula 0 simplified : F(G!"(((((((((((((TrainState_45_1_6==0)&&(TrainState_35_1_39==0))&&((TrainState_8_1_33==0)&&(TrainState_1_1_35==0)))&&(((TrainState_...182504
Detected timeout of ITS tools.
[2024-05-22 04:18:40] [INFO ] Flatten gal took : 165 ms
[2024-05-22 04:18:40] [INFO ] Applying decomposition
[2024-05-22 04:18:40] [INFO ] Flatten gal took : 173 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17209897045355475776.txt' '-o' '/tmp/graph17209897045355475776.bin' '-w' '/tmp/graph17209897045355475776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17209897045355475776.bin' '-l' '-1' '-v' '-w' '/tmp/graph17209897045355475776.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:18:41] [INFO ] Decomposing Gal with order
[2024-05-22 04:18:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:18:43] [INFO ] Removed a total of 522 redundant transitions.
[2024-05-22 04:18:43] [INFO ] Flatten gal took : 696 ms
[2024-05-22 04:18:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 50 ms.
[2024-05-22 04:18:44] [INFO ] Time to serialize gal into /tmp/LTL6356632274434867622.gal : 66 ms
[2024-05-22 04:18:44] [INFO ] Time to serialize properties into /tmp/LTL2989558893019336888.ltl : 33 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6356632274434867622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2989558893019336888.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((((i20.u124.TrainState_45_1_6==0)&&(i10.u1296.TrainState_35_1_39==0))&&((i46.u1339.TrainState_8_1_33==0)&&(i0.u98.T...243870
Formula 0 simplified : F(G!"(((((((((((((i20.u124.TrainState_45_1_6==0)&&(i10.u1296.TrainState_35_1_39==0))&&((i46.u1339.TrainState_8_1_33==0)&&(i0.u98.Tra...243854
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4447303417803615031
[2024-05-22 04:18:59] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4447303417803615031
Running compilation step : cd /tmp/ltsmin4447303417803615031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin4447303417803615031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4447303417803615031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BART-PT-050-LTLFireability-02 finished in 158587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(!p1))))))'
Support contains 4850 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 129 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
// Phase 1: matrix 10100 rows 6600 cols
[2024-05-22 04:19:02] [INFO ] Computed 50 invariants in 53 ms
[2024-05-22 04:19:04] [INFO ] Implicit Places using invariants in 1388 ms returned []
Implicit Place search using SMT only with invariants took 1391 ms to find 0 implicit places.
[2024-05-22 04:19:04] [INFO ] Invariant cache hit.
[2024-05-22 04:19:05] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2901 ms. Remains : 6600/6600 places, 10100/10100 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BART-PT-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s6030 0) (EQ s2782 0) (EQ s5017 0) (EQ s3904 0) (EQ s3513 0) (EQ s2391 0) (EQ s4626 0) (EQ s699 0) (EQ s6552 0) (EQ s5338 0) (EQ s5408 0) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1724 ms.
Product exploration explored 100000 steps with 0 reset in 1638 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 111 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4850 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 107 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
[2024-05-22 04:19:13] [INFO ] Invariant cache hit.
[2024-05-22 04:19:14] [INFO ] Implicit Places using invariants in 1306 ms returned []
Implicit Place search using SMT only with invariants took 1312 ms to find 0 implicit places.
[2024-05-22 04:19:14] [INFO ] Invariant cache hit.
[2024-05-22 04:19:16] [INFO ] Dead Transitions using invariants and state equation in 1362 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2783 ms. Remains : 6600/6600 places, 10100/10100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 36 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 1 factoid took 224 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 1397 ms.
Product exploration explored 100000 steps with 0 reset in 1469 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4850 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 1300 edges and 6600 vertex of which 300 / 6600 are part of one of the 50 SCC in 6 ms
Free SCC test removed 250 places
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 250 transitions.
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 400 rules applied. Total rules applied 401 place count 6350 transition count 9850
Performed 600 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1000 places in 6 ms
Iterating global reduction 1 with 600 rules applied. Total rules applied 1001 place count 6350 transition count 9850
Discarding 600 places :
Symmetric choice reduction at 1 with 600 rule applications. Total rules 1601 place count 5750 transition count 9250
Deduced a syphon composed of 400 places in 1 ms
Iterating global reduction 1 with 600 rules applied. Total rules applied 2201 place count 5750 transition count 9250
Deduced a syphon composed of 400 places in 3 ms
Applied a total of 2201 rules in 944 ms. Remains 5750 /6600 variables (removed 850) and now considering 9250/10100 (removed 850) transitions.
[2024-05-22 04:19:25] [INFO ] Redundant transitions in 1220 ms returned []
[2024-05-22 04:19:25] [INFO ] Flow matrix only has 9201 transitions (discarded 49 similar events)
// Phase 1: matrix 9201 rows 5750 cols
[2024-05-22 04:19:25] [INFO ] Computed 50 invariants in 41 ms
[2024-05-22 04:19:26] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5750/6600 places, 9250/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3061 ms. Remains : 5750/6600 places, 9250/10100 transitions.
Built C files in :
/tmp/ltsmin7927007682557725746
[2024-05-22 04:19:26] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7927007682557725746
Running compilation step : cd /tmp/ltsmin7927007682557725746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin7927007682557725746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7927007682557725746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 4850 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 105 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
// Phase 1: matrix 10100 rows 6600 cols
[2024-05-22 04:19:29] [INFO ] Computed 50 invariants in 44 ms
[2024-05-22 04:19:31] [INFO ] Implicit Places using invariants in 1313 ms returned []
Implicit Place search using SMT only with invariants took 1317 ms to find 0 implicit places.
[2024-05-22 04:19:31] [INFO ] Invariant cache hit.
[2024-05-22 04:19:32] [INFO ] Dead Transitions using invariants and state equation in 1440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2869 ms. Remains : 6600/6600 places, 10100/10100 transitions.
Built C files in :
/tmp/ltsmin8009431961907333696
[2024-05-22 04:19:32] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8009431961907333696
Running compilation step : cd /tmp/ltsmin8009431961907333696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin8009431961907333696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8009431961907333696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-22 04:19:36] [INFO ] Flatten gal took : 208 ms
[2024-05-22 04:19:36] [INFO ] Flatten gal took : 297 ms
[2024-05-22 04:19:36] [INFO ] Time to serialize gal into /tmp/LTL14931339912941440869.gal : 53 ms
[2024-05-22 04:19:36] [INFO ] Time to serialize properties into /tmp/LTL8923180802709922212.prop : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14931339912941440869.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11042245855771353407.hoa' '-atoms' '/tmp/LTL8923180802709922212.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8923180802709922212.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11042245855771353407.hoa
Detected timeout of ITS tools.
[2024-05-22 04:19:52] [INFO ] Flatten gal took : 266 ms
[2024-05-22 04:19:52] [INFO ] Flatten gal took : 193 ms
[2024-05-22 04:19:52] [INFO ] Time to serialize gal into /tmp/LTL1593267103626094967.gal : 35 ms
[2024-05-22 04:19:52] [INFO ] Time to serialize properties into /tmp/LTL17299011052253588011.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1593267103626094967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17299011052253588011.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((((((((((TrainState_46_4_14==0)&&(TrainState_6_4_13==0))&&((TrainState_3_4_14==0)&&(TrainState_9_4_12==0)))&&(((TrainSta...129667
Formula 0 simplified : XX(!"((((((((((((((TrainState_31_3_35==0)&&(TrainState_33_2_19==0))&&((TrainState_18_3_30==0)&&(TrainState_5_1_25==0)))&&(((TrainSta...129657
Detected timeout of ITS tools.
[2024-05-22 04:20:07] [INFO ] Flatten gal took : 173 ms
[2024-05-22 04:20:07] [INFO ] Applying decomposition
[2024-05-22 04:20:07] [INFO ] Flatten gal took : 178 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4189270069477965005.txt' '-o' '/tmp/graph4189270069477965005.bin' '-w' '/tmp/graph4189270069477965005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4189270069477965005.bin' '-l' '-1' '-v' '-w' '/tmp/graph4189270069477965005.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:20:08] [INFO ] Decomposing Gal with order
[2024-05-22 04:20:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:20:11] [INFO ] Removed a total of 988 redundant transitions.
[2024-05-22 04:20:11] [INFO ] Flatten gal took : 400 ms
[2024-05-22 04:20:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2024-05-22 04:20:16] [INFO ] Time to serialize gal into /tmp/LTL8432146655868619776.gal : 64 ms
[2024-05-22 04:20:16] [INFO ] Time to serialize properties into /tmp/LTL7649798278331887793.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8432146655868619776.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7649798278331887793.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((((((((((i25.i1.u921.TrainState_46_4_14==0)&&(i46.i1.u554.TrainState_6_4_13==0))&&((i0.i2.u904.TrainState_3_4_14==0)&&(i...189289
Formula 0 simplified : XX(!"((((((((((((((i48.i7.u2082.TrainState_31_3_35==0)&&(i29.i2.u846.TrainState_33_2_19==0))&&((i5.i3.u1696.TrainState_18_3_30==0)&&...189279
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2341509789829838897
[2024-05-22 04:20:31] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2341509789829838897
Running compilation step : cd /tmp/ltsmin2341509789829838897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2341509789829838897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2341509789829838897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BART-PT-050-LTLFireability-03 finished in 91878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4450 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 6600 transition count 10000
Reduce places removed 100 places and 0 transitions.
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Iterating post reduction 1 with 550 rules applied. Total rules applied 650 place count 6500 transition count 9550
Reduce places removed 450 places and 0 transitions.
Iterating post reduction 2 with 450 rules applied. Total rules applied 1100 place count 6050 transition count 9550
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1100 place count 6050 transition count 9350
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 1500 place count 5850 transition count 9350
Discarding 300 places :
Symmetric choice reduction at 3 with 300 rule applications. Total rules 1800 place count 5550 transition count 9050
Iterating global reduction 3 with 300 rules applied. Total rules applied 2100 place count 5550 transition count 9050
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 2150 place count 5550 transition count 9000
Discarding 150 places :
Symmetric choice reduction at 4 with 150 rule applications. Total rules 2300 place count 5400 transition count 8850
Iterating global reduction 4 with 150 rules applied. Total rules applied 2450 place count 5400 transition count 8850
Discarding 150 places :
Symmetric choice reduction at 4 with 150 rule applications. Total rules 2600 place count 5250 transition count 8700
Iterating global reduction 4 with 150 rules applied. Total rules applied 2750 place count 5250 transition count 8700
Discarding 150 places :
Symmetric choice reduction at 4 with 150 rule applications. Total rules 2900 place count 5100 transition count 8550
Iterating global reduction 4 with 150 rules applied. Total rules applied 3050 place count 5100 transition count 8550
Discarding 100 places :
Symmetric choice reduction at 4 with 100 rule applications. Total rules 3150 place count 5000 transition count 8450
Iterating global reduction 4 with 100 rules applied. Total rules applied 3250 place count 5000 transition count 8450
Discarding 100 places :
Symmetric choice reduction at 4 with 100 rule applications. Total rules 3350 place count 4900 transition count 8350
Iterating global reduction 4 with 100 rules applied. Total rules applied 3450 place count 4900 transition count 8350
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 3500 place count 4850 transition count 8300
Iterating global reduction 4 with 50 rules applied. Total rules applied 3550 place count 4850 transition count 8300
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 1 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 4 with 600 rules applied. Total rules applied 4150 place count 4550 transition count 8000
Applied a total of 4150 rules in 1092 ms. Remains 4550 /6600 variables (removed 2050) and now considering 8000/10100 (removed 2100) transitions.
// Phase 1: matrix 8000 rows 4550 cols
[2024-05-22 04:20:35] [INFO ] Computed 50 invariants in 32 ms
[2024-05-22 04:20:36] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-05-22 04:20:36] [INFO ] Invariant cache hit.
[2024-05-22 04:20:37] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
[2024-05-22 04:20:37] [INFO ] Redundant transitions in 805 ms returned []
[2024-05-22 04:20:37] [INFO ] Invariant cache hit.
[2024-05-22 04:20:45] [INFO ] Dead Transitions using invariants and state equation in 7811 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4550/6600 places, 8000/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11092 ms. Remains : 4550/6600 places, 8000/10100 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s3980 0) (EQ s1532 0) (EQ s3217 0) (EQ s2354 0) (EQ s2063 0) (EQ s1241 0) (EQ s2926 0) (EQ s299 0) (EQ s4502 0) (EQ s3438 0) (EQ s3508 0) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 3131 ms.
Stack based approach found an accepted trace after 5881 steps with 0 reset with depth 5882 and stack size 5882 in 199 ms.
FORMULA BART-PT-050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-050-LTLFireability-04 finished in 14540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 4850 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 1300 edges and 6600 vertex of which 300 / 6600 are part of one of the 50 SCC in 2 ms
Free SCC test removed 250 places
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 250 transitions.
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 401 place count 6350 transition count 9450
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 801 place count 5950 transition count 9450
Performed 600 Post agglomeration using F-continuation condition.Transition count delta: 600
Deduced a syphon composed of 600 places in 2 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 2001 place count 5350 transition count 8850
Applied a total of 2001 rules in 456 ms. Remains 5350 /6600 variables (removed 1250) and now considering 8850/10100 (removed 1250) transitions.
[2024-05-22 04:20:49] [INFO ] Flow matrix only has 8801 transitions (discarded 49 similar events)
// Phase 1: matrix 8801 rows 5350 cols
[2024-05-22 04:20:49] [INFO ] Computed 50 invariants in 54 ms
[2024-05-22 04:20:50] [INFO ] Implicit Places using invariants in 1298 ms returned []
[2024-05-22 04:20:50] [INFO ] Flow matrix only has 8801 transitions (discarded 49 similar events)
[2024-05-22 04:20:50] [INFO ] Invariant cache hit.
[2024-05-22 04:20:52] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 2612 ms to find 0 implicit places.
[2024-05-22 04:20:53] [INFO ] Redundant transitions in 1076 ms returned []
[2024-05-22 04:20:53] [INFO ] Flow matrix only has 8801 transitions (discarded 49 similar events)
[2024-05-22 04:20:53] [INFO ] Invariant cache hit.
[2024-05-22 04:20:54] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5350/6600 places, 8850/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5380 ms. Remains : 5350/6600 places, 8850/10100 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s4780 1) (EQ s2332 1) (EQ s4017 1) (EQ s3154 1) (EQ s2863 1) (EQ s1941 1) (EQ s3726 1) (EQ s449 1) (EQ s5302 1) (EQ s4238 1) (EQ s4308 1) (EQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BART-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-07 finished in 5555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X(X(G(p2)))))'
Support contains 4 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1598 places :
Symmetric choice reduction at 0 with 1598 rule applications. Total rules 1598 place count 5002 transition count 8502
Iterating global reduction 0 with 1598 rules applied. Total rules applied 3196 place count 5002 transition count 8502
Discarding 1348 places :
Symmetric choice reduction at 0 with 1348 rule applications. Total rules 4544 place count 3654 transition count 7154
Iterating global reduction 0 with 1348 rules applied. Total rules applied 5892 place count 3654 transition count 7154
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 6091 place count 3455 transition count 6955
Iterating global reduction 0 with 199 rules applied. Total rules applied 6290 place count 3455 transition count 6955
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6439 place count 3306 transition count 6806
Iterating global reduction 0 with 149 rules applied. Total rules applied 6588 place count 3306 transition count 6806
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6737 place count 3157 transition count 6657
Iterating global reduction 0 with 149 rules applied. Total rules applied 6886 place count 3157 transition count 6657
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7035 place count 3008 transition count 6508
Iterating global reduction 0 with 149 rules applied. Total rules applied 7184 place count 3008 transition count 6508
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7333 place count 2859 transition count 6359
Iterating global reduction 0 with 149 rules applied. Total rules applied 7482 place count 2859 transition count 6359
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7631 place count 2710 transition count 6210
Iterating global reduction 0 with 149 rules applied. Total rules applied 7780 place count 2710 transition count 6210
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 7879 place count 2611 transition count 6111
Iterating global reduction 0 with 99 rules applied. Total rules applied 7978 place count 2611 transition count 6111
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8077 place count 2512 transition count 6012
Iterating global reduction 0 with 99 rules applied. Total rules applied 8176 place count 2512 transition count 6012
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8226 place count 2462 transition count 5962
Iterating global reduction 0 with 50 rules applied. Total rules applied 8276 place count 2462 transition count 5962
Applied a total of 8276 rules in 3923 ms. Remains 2462 /6600 variables (removed 4138) and now considering 5962/10100 (removed 4138) transitions.
// Phase 1: matrix 5962 rows 2462 cols
[2024-05-22 04:20:58] [INFO ] Computed 50 invariants in 24 ms
[2024-05-22 04:20:59] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-22 04:20:59] [INFO ] Invariant cache hit.
[2024-05-22 04:20:59] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2024-05-22 04:20:59] [INFO ] Invariant cache hit.
[2024-05-22 04:21:05] [INFO ] Dead Transitions using invariants and state equation in 5942 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2462/6600 places, 5962/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10954 ms. Remains : 2462/6600 places, 5962/10100 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 7}, { cond=p0, acceptance={} source=1 dest: 8}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}], [{ cond=(NOT p1), acceptance={} source=7 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 4}]], initial=1, aps=[p0:(EQ s400 1), p2:(OR (EQ s4 0) (EQ s1657 0)), p1:(EQ s22 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, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 52 reset in 1207 ms.
Entered a terminal (fully accepting) state of product in 35171 steps with 97 reset in 334 ms.
FORMULA BART-PT-050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-08 finished in 12837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 2 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1599 places :
Symmetric choice reduction at 0 with 1599 rule applications. Total rules 1599 place count 5001 transition count 8501
Iterating global reduction 0 with 1599 rules applied. Total rules applied 3198 place count 5001 transition count 8501
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4547 place count 3652 transition count 7152
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5896 place count 3652 transition count 7152
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6096 place count 3452 transition count 6952
Iterating global reduction 0 with 200 rules applied. Total rules applied 6296 place count 3452 transition count 6952
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6446 place count 3302 transition count 6802
Iterating global reduction 0 with 150 rules applied. Total rules applied 6596 place count 3302 transition count 6802
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6746 place count 3152 transition count 6652
Iterating global reduction 0 with 150 rules applied. Total rules applied 6896 place count 3152 transition count 6652
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7045 place count 3003 transition count 6503
Iterating global reduction 0 with 149 rules applied. Total rules applied 7194 place count 3003 transition count 6503
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7343 place count 2854 transition count 6354
Iterating global reduction 0 with 149 rules applied. Total rules applied 7492 place count 2854 transition count 6354
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7641 place count 2705 transition count 6205
Iterating global reduction 0 with 149 rules applied. Total rules applied 7790 place count 2705 transition count 6205
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7890 place count 2605 transition count 6105
Iterating global reduction 0 with 100 rules applied. Total rules applied 7990 place count 2605 transition count 6105
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8089 place count 2506 transition count 6006
Iterating global reduction 0 with 99 rules applied. Total rules applied 8188 place count 2506 transition count 6006
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8238 place count 2456 transition count 5956
Iterating global reduction 0 with 50 rules applied. Total rules applied 8288 place count 2456 transition count 5956
Applied a total of 8288 rules in 3443 ms. Remains 2456 /6600 variables (removed 4144) and now considering 5956/10100 (removed 4144) transitions.
// Phase 1: matrix 5956 rows 2456 cols
[2024-05-22 04:21:11] [INFO ] Computed 50 invariants in 15 ms
[2024-05-22 04:21:11] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-22 04:21:11] [INFO ] Invariant cache hit.
[2024-05-22 04:21:12] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2024-05-22 04:21:12] [INFO ] Invariant cache hit.
[2024-05-22 04:21:16] [INFO ] Dead Transitions using invariants and state equation in 4506 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2456/6600 places, 5956/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8977 ms. Remains : 2456/6600 places, 5956/10100 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s1350 1), p0:(EQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-09 finished in 9148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&X(p2)))))'
Support contains 3 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1599 places :
Symmetric choice reduction at 0 with 1599 rule applications. Total rules 1599 place count 5001 transition count 8501
Iterating global reduction 0 with 1599 rules applied. Total rules applied 3198 place count 5001 transition count 8501
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4547 place count 3652 transition count 7152
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5896 place count 3652 transition count 7152
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6096 place count 3452 transition count 6952
Iterating global reduction 0 with 200 rules applied. Total rules applied 6296 place count 3452 transition count 6952
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6446 place count 3302 transition count 6802
Iterating global reduction 0 with 150 rules applied. Total rules applied 6596 place count 3302 transition count 6802
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6746 place count 3152 transition count 6652
Iterating global reduction 0 with 150 rules applied. Total rules applied 6896 place count 3152 transition count 6652
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7046 place count 3002 transition count 6502
Iterating global reduction 0 with 150 rules applied. Total rules applied 7196 place count 3002 transition count 6502
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7346 place count 2852 transition count 6352
Iterating global reduction 0 with 150 rules applied. Total rules applied 7496 place count 2852 transition count 6352
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7646 place count 2702 transition count 6202
Iterating global reduction 0 with 150 rules applied. Total rules applied 7796 place count 2702 transition count 6202
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7896 place count 2602 transition count 6102
Iterating global reduction 0 with 100 rules applied. Total rules applied 7996 place count 2602 transition count 6102
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8096 place count 2502 transition count 6002
Iterating global reduction 0 with 100 rules applied. Total rules applied 8196 place count 2502 transition count 6002
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 8245 place count 2453 transition count 5953
Iterating global reduction 0 with 49 rules applied. Total rules applied 8294 place count 2453 transition count 5953
Applied a total of 8294 rules in 3016 ms. Remains 2453 /6600 variables (removed 4147) and now considering 5953/10100 (removed 4147) transitions.
// Phase 1: matrix 5953 rows 2453 cols
[2024-05-22 04:21:19] [INFO ] Computed 50 invariants in 15 ms
[2024-05-22 04:21:20] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-22 04:21:20] [INFO ] Invariant cache hit.
[2024-05-22 04:21:20] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
[2024-05-22 04:21:20] [INFO ] Invariant cache hit.
[2024-05-22 04:21:26] [INFO ] Dead Transitions using invariants and state equation in 5516 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2453/6600 places, 5953/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9519 ms. Remains : 2453/6600 places, 5953/10100 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-PT-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}]], initial=2, aps=[p2:(OR (EQ s61 1) (EQ s13 1)), p0:(EQ s1950 0), p1:(EQ s1950 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8956 steps with 0 reset in 79 ms.
FORMULA BART-PT-050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-10 finished in 9814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1600 places :
Symmetric choice reduction at 0 with 1600 rule applications. Total rules 1600 place count 5000 transition count 8500
Iterating global reduction 0 with 1600 rules applied. Total rules applied 3200 place count 5000 transition count 8500
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4549 place count 3651 transition count 7151
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5898 place count 3651 transition count 7151
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6098 place count 3451 transition count 6951
Iterating global reduction 0 with 200 rules applied. Total rules applied 6298 place count 3451 transition count 6951
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6448 place count 3301 transition count 6801
Iterating global reduction 0 with 150 rules applied. Total rules applied 6598 place count 3301 transition count 6801
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6748 place count 3151 transition count 6651
Iterating global reduction 0 with 150 rules applied. Total rules applied 6898 place count 3151 transition count 6651
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7048 place count 3001 transition count 6501
Iterating global reduction 0 with 150 rules applied. Total rules applied 7198 place count 3001 transition count 6501
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7348 place count 2851 transition count 6351
Iterating global reduction 0 with 150 rules applied. Total rules applied 7498 place count 2851 transition count 6351
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7648 place count 2701 transition count 6201
Iterating global reduction 0 with 150 rules applied. Total rules applied 7798 place count 2701 transition count 6201
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7898 place count 2601 transition count 6101
Iterating global reduction 0 with 100 rules applied. Total rules applied 7998 place count 2601 transition count 6101
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8098 place count 2501 transition count 6001
Iterating global reduction 0 with 100 rules applied. Total rules applied 8198 place count 2501 transition count 6001
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8248 place count 2451 transition count 5951
Iterating global reduction 0 with 50 rules applied. Total rules applied 8298 place count 2451 transition count 5951
Applied a total of 8298 rules in 2940 ms. Remains 2451 /6600 variables (removed 4149) and now considering 5951/10100 (removed 4149) transitions.
// Phase 1: matrix 5951 rows 2451 cols
[2024-05-22 04:21:29] [INFO ] Computed 50 invariants in 15 ms
[2024-05-22 04:21:29] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-22 04:21:29] [INFO ] Invariant cache hit.
[2024-05-22 04:21:31] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
[2024-05-22 04:21:31] [INFO ] Invariant cache hit.
[2024-05-22 04:21:36] [INFO ] Dead Transitions using invariants and state equation in 5129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2451/6600 places, 5951/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9650 ms. Remains : 2451/6600 places, 5951/10100 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s43 1) (EQ s1700 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-11 finished in 9782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(G((G(p0) U p1))) U p1)&&F(p0))))'
Support contains 2 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 10059 edges and 6600 vertex of which 6465 / 6600 are part of one of the 49 SCC in 3 ms
Free SCC test removed 6416 places
Ensure Unique test removed 9844 transitions
Reduce isomorphic transitions removed 9844 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 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 112 rules applied. Total rules applied 113 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 179 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 181 place count 70 transition count 142
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 181 place count 70 transition count 137
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 191 place count 65 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 197 place count 59 transition count 131
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 59 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 204 place count 59 transition count 130
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 208 place count 55 transition count 126
Iterating global reduction 4 with 4 rules applied. Total rules applied 212 place count 55 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 215 place count 52 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 218 place count 52 transition count 123
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 221 place count 49 transition count 120
Iterating global reduction 4 with 3 rules applied. Total rules applied 224 place count 49 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 226 place count 47 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 47 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 45 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 45 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 233 place count 44 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 44 transition count 115
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 248 place count 37 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 252 place count 37 transition count 104
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 256 place count 35 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 260 place count 35 transition count 98
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 264 place count 33 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 268 place count 33 transition count 92
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 272 place count 31 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 276 place count 31 transition count 86
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 280 place count 29 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 284 place count 29 transition count 80
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 288 place count 27 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 292 place count 27 transition count 74
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 296 place count 25 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 300 place count 25 transition count 68
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 304 place count 23 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 308 place count 23 transition count 62
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 312 place count 21 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 316 place count 21 transition count 56
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 320 place count 19 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 324 place count 19 transition count 50
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 328 place count 17 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 332 place count 17 transition count 44
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 336 place count 15 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 340 place count 15 transition count 38
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 344 place count 13 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 348 place count 13 transition count 32
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 352 place count 11 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 356 place count 11 transition count 26
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 360 place count 9 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 364 place count 9 transition count 20
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 368 place count 7 transition count 18
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 372 place count 7 transition count 14
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 376 place count 5 transition count 12
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 5 rules applied. Total rules applied 381 place count 5 transition count 7
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 383 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 384 place count 4 transition count 5
Applied a total of 384 rules in 47 ms. Remains 4 /6600 variables (removed 6596) and now considering 5/10100 (removed 10095) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 04:21:36] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 04:21:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 04:21:36] [INFO ] Invariant cache hit.
[2024-05-22 04:21:36] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-22 04:21:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 04:21:36] [INFO ] Invariant cache hit.
[2024-05-22 04:21:36] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/6600 places, 5/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 4/6600 places, 5/10100 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BART-PT-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(OR p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-12 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U p1))))'
Support contains 2 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1599 places :
Symmetric choice reduction at 0 with 1599 rule applications. Total rules 1599 place count 5001 transition count 8501
Iterating global reduction 0 with 1599 rules applied. Total rules applied 3198 place count 5001 transition count 8501
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4547 place count 3652 transition count 7152
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5896 place count 3652 transition count 7152
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6096 place count 3452 transition count 6952
Iterating global reduction 0 with 200 rules applied. Total rules applied 6296 place count 3452 transition count 6952
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6446 place count 3302 transition count 6802
Iterating global reduction 0 with 150 rules applied. Total rules applied 6596 place count 3302 transition count 6802
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6745 place count 3153 transition count 6653
Iterating global reduction 0 with 149 rules applied. Total rules applied 6894 place count 3153 transition count 6653
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7043 place count 3004 transition count 6504
Iterating global reduction 0 with 149 rules applied. Total rules applied 7192 place count 3004 transition count 6504
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7341 place count 2855 transition count 6355
Iterating global reduction 0 with 149 rules applied. Total rules applied 7490 place count 2855 transition count 6355
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7639 place count 2706 transition count 6206
Iterating global reduction 0 with 149 rules applied. Total rules applied 7788 place count 2706 transition count 6206
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 7887 place count 2607 transition count 6107
Iterating global reduction 0 with 99 rules applied. Total rules applied 7986 place count 2607 transition count 6107
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8085 place count 2508 transition count 6008
Iterating global reduction 0 with 99 rules applied. Total rules applied 8184 place count 2508 transition count 6008
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8234 place count 2458 transition count 5958
Iterating global reduction 0 with 50 rules applied. Total rules applied 8284 place count 2458 transition count 5958
Applied a total of 8284 rules in 2835 ms. Remains 2458 /6600 variables (removed 4142) and now considering 5958/10100 (removed 4142) transitions.
// Phase 1: matrix 5958 rows 2458 cols
[2024-05-22 04:21:39] [INFO ] Computed 50 invariants in 15 ms
[2024-05-22 04:21:39] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-22 04:21:39] [INFO ] Invariant cache hit.
[2024-05-22 04:21:40] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2024-05-22 04:21:40] [INFO ] Invariant cache hit.
[2024-05-22 04:21:45] [INFO ] Dead Transitions using invariants and state equation in 5424 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2458/6600 places, 5958/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9166 ms. Remains : 2458/6600 places, 5958/10100 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BART-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(EQ s800 1), p0:(EQ s93 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA BART-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-14 finished in 9311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||F(p1)))))'
Support contains 2 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1599 places :
Symmetric choice reduction at 0 with 1599 rule applications. Total rules 1599 place count 5001 transition count 8501
Iterating global reduction 0 with 1599 rules applied. Total rules applied 3198 place count 5001 transition count 8501
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4547 place count 3652 transition count 7152
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5896 place count 3652 transition count 7152
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6096 place count 3452 transition count 6952
Iterating global reduction 0 with 200 rules applied. Total rules applied 6296 place count 3452 transition count 6952
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6446 place count 3302 transition count 6802
Iterating global reduction 0 with 150 rules applied. Total rules applied 6596 place count 3302 transition count 6802
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6746 place count 3152 transition count 6652
Iterating global reduction 0 with 150 rules applied. Total rules applied 6896 place count 3152 transition count 6652
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7046 place count 3002 transition count 6502
Iterating global reduction 0 with 150 rules applied. Total rules applied 7196 place count 3002 transition count 6502
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7346 place count 2852 transition count 6352
Iterating global reduction 0 with 150 rules applied. Total rules applied 7496 place count 2852 transition count 6352
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7646 place count 2702 transition count 6202
Iterating global reduction 0 with 150 rules applied. Total rules applied 7796 place count 2702 transition count 6202
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7896 place count 2602 transition count 6102
Iterating global reduction 0 with 100 rules applied. Total rules applied 7996 place count 2602 transition count 6102
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8096 place count 2502 transition count 6002
Iterating global reduction 0 with 100 rules applied. Total rules applied 8196 place count 2502 transition count 6002
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8246 place count 2452 transition count 5952
Iterating global reduction 0 with 50 rules applied. Total rules applied 8296 place count 2452 transition count 5952
Applied a total of 8296 rules in 3035 ms. Remains 2452 /6600 variables (removed 4148) and now considering 5952/10100 (removed 4148) transitions.
// Phase 1: matrix 5952 rows 2452 cols
[2024-05-22 04:21:49] [INFO ] Computed 50 invariants in 15 ms
[2024-05-22 04:21:49] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-22 04:21:49] [INFO ] Invariant cache hit.
[2024-05-22 04:21:50] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1608 ms to find 0 implicit places.
[2024-05-22 04:21:50] [INFO ] Invariant cache hit.
[2024-05-22 04:21:55] [INFO ] Dead Transitions using invariants and state equation in 5054 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2452/6600 places, 5952/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9699 ms. Remains : 2452/6600 places, 5952/10100 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1896 1), p1:(EQ s700 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 1146 ms.
Product exploration explored 100000 steps with 9 reset in 956 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)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 161 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 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 5369 steps, including 1 resets, run visited all 2 properties in 162 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 3 factoid took 310 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 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-22 04:22:02] [INFO ] Invariant cache hit.
[2024-05-22 04:22:06] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 3 factoid took 277 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-050-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-050-LTLFireability-15 finished in 20305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F((X(X(p1))&&F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(!p1))))))'
[2024-05-22 04:22:07] [INFO ] Flatten gal took : 206 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3390799631452151617
[2024-05-22 04:22:07] [INFO ] Too many transitions (10100) to apply POR reductions. Disabling POR matrices.
[2024-05-22 04:22:07] [INFO ] Applying decomposition
[2024-05-22 04:22:07] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3390799631452151617
Running compilation step : cd /tmp/ltsmin3390799631452151617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 04:22:07] [INFO ] Flatten gal took : 221 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3918394075400275614.txt' '-o' '/tmp/graph3918394075400275614.bin' '-w' '/tmp/graph3918394075400275614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3918394075400275614.bin' '-l' '-1' '-v' '-w' '/tmp/graph3918394075400275614.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:22:08] [INFO ] Decomposing Gal with order
[2024-05-22 04:22:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:22:11] [INFO ] Removed a total of 784 redundant transitions.
[2024-05-22 04:22:11] [INFO ] Flatten gal took : 435 ms
[2024-05-22 04:22:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 37 ms.
[2024-05-22 04:22:22] [INFO ] Time to serialize gal into /tmp/LTLFireability6370230004337914305.gal : 56 ms
[2024-05-22 04:22:22] [INFO ] Time to serialize properties into /tmp/LTLFireability9046404610500852779.ltl : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6370230004337914305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9046404610500852779.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G((F("(((((((((((((i39.i0.u131.TrainState_45_1_6==0)&&(i8.i0.u127.TrainState_35_1_39==0))&&((i2.i0.u116.TrainState_8_1_33==0)&&(i23...265445
Formula 0 simplified : F(G!"(((((((((((((i39.i0.u131.TrainState_45_1_6==0)&&(i8.i0.u127.TrainState_35_1_39==0))&&((i2.i0.u116.TrainState_8_1_33==0)&&(i23.i...265429
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 102332 ms.
Running link step : cd /tmp/ltsmin3390799631452151617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 230 ms.
Running LTSmin : cd /tmp/ltsmin3390799631452151617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(<>((X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))))' '--buchi-type=spotba'

BK_STOP 1716351994038

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-PT-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BART-PT-050, 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 r043-smll-171620180500308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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