Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689500580.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-COL-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689500580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 8.2K Apr 29 22:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 22:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 29 21:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 29 21:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 213K May 10 09:33 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-COL-050-LTLFireability-00
FORMULA_NAME BART-COL-050-LTLFireability-01
FORMULA_NAME BART-COL-050-LTLFireability-02
FORMULA_NAME BART-COL-050-LTLFireability-03
FORMULA_NAME BART-COL-050-LTLFireability-04
FORMULA_NAME BART-COL-050-LTLFireability-05
FORMULA_NAME BART-COL-050-LTLFireability-06
FORMULA_NAME BART-COL-050-LTLFireability-07
FORMULA_NAME BART-COL-050-LTLFireability-08
FORMULA_NAME BART-COL-050-LTLFireability-09
FORMULA_NAME BART-COL-050-LTLFireability-10
FORMULA_NAME BART-COL-050-LTLFireability-11
FORMULA_NAME BART-COL-050-LTLFireability-12
FORMULA_NAME BART-COL-050-LTLFireability-13
FORMULA_NAME BART-COL-050-LTLFireability-14
FORMULA_NAME BART-COL-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652667038861

Running Version 202205111006
[2022-05-16 02:10:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:10:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:10:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 02:10:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 02:10:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 902 ms
[2022-05-16 02:10:41] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2022-05-16 02:10:41] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 22673 PT places and 7.03614756E10 transition bindings in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 02:10:41] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 6 ms.
[2022-05-16 02:10:41] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 50
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [0:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2022-05-16 02:10:41] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 259 ms.
[2022-05-16 02:10:41] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
[2022-05-16 02:10:41] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:10:41] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:10:41] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:10:41] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:10:41] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:10:41] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:10:41] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:10:41] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 3 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-050-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:10:42] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-16 02:10:42] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:10:42] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:10:42] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:10:42] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:10:42] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2022-05-16 02:10:42] [INFO ] Flatten gal took : 64 ms
[2022-05-16 02:10:42] [INFO ] Flatten gal took : 31 ms
[2022-05-16 02:10:42] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 508 steps, including 0 resets, run visited all 9 properties in 30 ms. (steps per millisecond=16 )
FORMULA BART-COL-050-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)||F(p1)))))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 29 rules applied. Total rules applied 32 place count 129 transition count 173
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 102 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 102 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 98 transition count 168
Applied a total of 68 rules in 38 ms. Remains 98 /132 variables (removed 34) and now considering 168/202 (removed 34) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:10:43] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 02:10:43] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:10:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:43] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2022-05-16 02:10:43] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:10:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:43] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/132 places, 168/202 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(AND (LT s20 1) (LT s90 1) (LT s22 1) (LT s88 1) (LT s24 1) (LT s94 1) (LT s26 1) (LT s92 1) (LT s12 1) (LT s82 1) (LT s14 1) (LT s80 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 651 reset in 515 ms.
Product exploration explored 100000 steps with 643 reset in 553 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) p1), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 69 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:10:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:10:45] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:10:45] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:10:45] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-05-16 02:10:45] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:10:45] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:10:53] [INFO ] Dead Transitions using invariants and state equation in 8089 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 645 reset in 605 ms.
Product exploration explored 100000 steps with 651 reset in 377 ms.
Built C files in :
/tmp/ltsmin175329920173816111
[2022-05-16 02:10:55] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2022-05-16 02:10:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:10:55] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2022-05-16 02:10:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:10:56] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2022-05-16 02:10:56] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:10:56] [INFO ] Built C files in 450ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin175329920173816111
Running compilation step : cd /tmp/ltsmin175329920173816111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 491 ms.
Running link step : cd /tmp/ltsmin175329920173816111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin175329920173816111;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5775439771904991267.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 69 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 11 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:11:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:11:10] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:11:10] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:11:10] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2022-05-16 02:11:10] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:11:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:11:11] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin3890517634417978436
[2022-05-16 02:11:11] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2022-05-16 02:11:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:11:11] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2022-05-16 02:11:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:11:11] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2022-05-16 02:11:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:11:11] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3890517634417978436
Running compilation step : cd /tmp/ltsmin3890517634417978436;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 283 ms.
Running link step : cd /tmp/ltsmin3890517634417978436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3890517634417978436;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13759951950049430.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:11:26] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:11:26] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:11:26] [INFO ] Time to serialize gal into /tmp/LTL4317964358710110033.gal : 2 ms
[2022-05-16 02:11:26] [INFO ] Time to serialize properties into /tmp/LTL15187945851391225179.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4317964358710110033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15187945851391225179.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4317964...267
Read 1 LTL properties
Checking formula 0 : !((G(X((F("(TrainState_42>=1)"))||(F("((((((((TrainState_61<1)&&(TrainState_191<1))&&((TrainState_63<1)&&(TrainState_189<1)))&&(((Trai...1515
Formula 0 simplified : !GX(F"(TrainState_42>=1)" | F"((((((((TrainState_61<1)&&(TrainState_191<1))&&((TrainState_63<1)&&(TrainState_189<1)))&&(((TrainState...1504
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:11:41] [INFO ] Flatten gal took : 28 ms
[2022-05-16 02:11:41] [INFO ] Applying decomposition
[2022-05-16 02:11:41] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16562359763572709846.txt' '-o' '/tmp/graph16562359763572709846.bin' '-w' '/tmp/graph16562359763572709846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16562359763572709846.bin' '-l' '-1' '-v' '-w' '/tmp/graph16562359763572709846.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:11:41] [INFO ] Decomposing Gal with order
[2022-05-16 02:11:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:11:41] [INFO ] Removed a total of 60 redundant transitions.
[2022-05-16 02:11:41] [INFO ] Flatten gal took : 77 ms
[2022-05-16 02:11:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 9 ms.
[2022-05-16 02:11:41] [INFO ] Time to serialize gal into /tmp/LTL14077900277683554736.gal : 16 ms
[2022-05-16 02:11:41] [INFO ] Time to serialize properties into /tmp/LTL2908567809435058655.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14077900277683554736.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2908567809435058655.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1407790...246
Read 1 LTL properties
Checking formula 0 : !((G(X((F("(i4.i0.u0.TrainState_42>=1)"))||(F("((((((((i1.i1.u4.TrainState_61<1)&&(i8.i1.u37.TrainState_191<1))&&((i0.u31.TrainState_6...2146
Formula 0 simplified : !GX(F"(i4.i0.u0.TrainState_42>=1)" | F"((((((((i1.i1.u4.TrainState_61<1)&&(i8.i1.u37.TrainState_191<1))&&((i0.u31.TrainState_63<1)&&...2135
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12534527133585278887
[2022-05-16 02:11:56] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12534527133585278887
Running compilation step : cd /tmp/ltsmin12534527133585278887;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 447 ms.
Running link step : cd /tmp/ltsmin12534527133585278887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12534527133585278887;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((<>((LTLAPp0==true))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-050-LTLFireability-00 finished in 88384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((p0&&(F((G(X(p1)) U p2))||p3)))))'
Support contains 70 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 132 transition count 179
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Applied a total of 46 rules in 7 ms. Remains 109 /132 variables (removed 23) and now considering 179/202 (removed 23) transitions.
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:12:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:11] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:12:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:11] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-05-16 02:12:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:12:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:12] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/132 places, 179/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/132 places, 179/202 transitions.
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : BART-COL-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s20 1) (GEQ s101 1) (GEQ s22 1) (GEQ s99 1) (GEQ s24 1) (GEQ s105 1) (GEQ s26 1) (GEQ s103 1) (GEQ s12 1) (GEQ s93 1) (GEQ s14 1) (GEQ s91 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1085 reset in 378 ms.
Product exploration explored 100000 steps with 1085 reset in 317 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 p3) (NOT p2)), (X p0), (X (AND p0 (NOT p3) (NOT p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2)))))]
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Finished random walk after 51 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2)), (X p0), (X (AND p0 (NOT p3) (NOT p2))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))))), (F p0), (F (AND p0 (NOT p2) (NOT p3)))]
Knowledge based reduction with 5 factoid took 355 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:12:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:14] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:14] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2022-05-16 02:12:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:14] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-16 02:12:14] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 60 ms.
[2022-05-16 02:12:15] [INFO ] Added : 88 causal constraints over 18 iterations in 733 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:12:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:12:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:15] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-16 02:12:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:15] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-05-16 02:12:15] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 02:12:16] [INFO ] Added : 141 causal constraints over 29 iterations in 372 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 70 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:12:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:16] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:12:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:16] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2022-05-16 02:12:16] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:12:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:12:19] [INFO ] Dead Transitions using invariants and state equation in 3497 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/109 places, 179/179 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))), (X p0), (X (AND p0 (NOT p2) (NOT p3))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3)))))]
Knowledge based reduction with 5 factoid took 367 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Finished random walk after 51 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))), (X p0), (X (AND p0 (NOT p2) (NOT p3))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))))), (F p0), (F (AND p0 (NOT p2) (NOT p3)))]
Knowledge based reduction with 5 factoid took 363 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:12:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:21] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-16 02:12:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:21] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-16 02:12:21] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 02:12:21] [INFO ] Added : 88 causal constraints over 18 iterations in 204 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:12:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:12:21] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:21] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-16 02:12:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:21] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-16 02:12:22] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 02:12:22] [INFO ] Added : 141 causal constraints over 29 iterations in 553 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 1080 reset in 300 ms.
Product exploration explored 100000 steps with 1082 reset in 337 ms.
Built C files in :
/tmp/ltsmin3078474983899954627
[2022-05-16 02:12:23] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2022-05-16 02:12:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:23] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2022-05-16 02:12:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:23] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2022-05-16 02:12:23] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:23] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3078474983899954627
Running compilation step : cd /tmp/ltsmin3078474983899954627;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 406 ms.
Running link step : cd /tmp/ltsmin3078474983899954627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin3078474983899954627;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13937710712033514721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 70 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 109 transition count 173
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 102 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 102 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 98 transition count 168
Applied a total of 22 rules in 19 ms. Remains 98 /109 variables (removed 11) and now considering 168/179 (removed 11) transitions.
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:12:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:12:38] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:12:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:12:38] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-05-16 02:12:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:12:38] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:12:38] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/109 places, 168/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/109 places, 168/179 transitions.
Built C files in :
/tmp/ltsmin10707076745526566958
[2022-05-16 02:12:38] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2022-05-16 02:12:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:38] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2022-05-16 02:12:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:38] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2022-05-16 02:12:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:12:38] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10707076745526566958
Running compilation step : cd /tmp/ltsmin10707076745526566958;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 227 ms.
Running link step : cd /tmp/ltsmin10707076745526566958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10707076745526566958;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4372110052298914214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:12:53] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:12:53] [INFO ] Flatten gal took : 9 ms
[2022-05-16 02:12:53] [INFO ] Time to serialize gal into /tmp/LTL1662225160291911801.gal : 3 ms
[2022-05-16 02:12:53] [INFO ] Time to serialize properties into /tmp/LTL8967979074997413789.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1662225160291911801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8967979074997413789.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1662225...266
Read 1 LTL properties
Checking formula 0 : !((F(F(("((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainState_65>=1)||(TrainStat...1818
Formula 0 simplified : !F("((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainState_65>=1)||(TrainState_1...1803
Detected timeout of ITS tools.
[2022-05-16 02:13:08] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:13:08] [INFO ] Applying decomposition
[2022-05-16 02:13:08] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11137414864142879190.txt' '-o' '/tmp/graph11137414864142879190.bin' '-w' '/tmp/graph11137414864142879190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11137414864142879190.bin' '-l' '-1' '-v' '-w' '/tmp/graph11137414864142879190.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:13:08] [INFO ] Decomposing Gal with order
[2022-05-16 02:13:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:13:08] [INFO ] Removed a total of 48 redundant transitions.
[2022-05-16 02:13:08] [INFO ] Flatten gal took : 14 ms
[2022-05-16 02:13:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 4 ms.
[2022-05-16 02:13:08] [INFO ] Time to serialize gal into /tmp/LTL12198258420289471072.gal : 2 ms
[2022-05-16 02:13:08] [INFO ] Time to serialize properties into /tmp/LTL16162083206098052861.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12198258420289471072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16162083206098052861.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1219825...247
Read 1 LTL properties
Checking formula 0 : !((F(F(("((((((((i2.u34.TrainState_61>=1)||(i3.i1.u25.TrainState_191>=1))||((i0.i2.u17.TrainState_63>=1)||(i4.i1.u40.TrainState_189>=1...2522
Formula 0 simplified : !F("((((((((i2.u34.TrainState_61>=1)||(i3.i1.u25.TrainState_191>=1))||((i0.i2.u17.TrainState_63>=1)||(i4.i1.u40.TrainState_189>=1)))...2507
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17814948837395391686
[2022-05-16 02:13:23] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17814948837395391686
Running compilation step : cd /tmp/ltsmin17814948837395391686;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 231 ms.
Running link step : cd /tmp/ltsmin17814948837395391686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17814948837395391686;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(<>(((LTLAPp0==true)&&(<>(([](X((LTLAPp1==true))) U (LTLAPp2==true)))||(LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-050-LTLFireability-01 finished in 87375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 30 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:39] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:39] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:39] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-02 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:(OR (GEQ s1 1) (AND (LT s20 1) (LT s24 1) (LT s12 1) (LT s68 1) (LT s16 1) (LT s60 1) (LT s8 1) (LT s64 1) (LT s52 1) (LT s56 1) (LT s43 1) (LT s93 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-COL-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-02 finished in 637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 128 place count 68 transition count 133
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 57 transition count 127
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 57 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 57 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 155 place count 53 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 53 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 50 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 50 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 47 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 47 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 45 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 45 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 43 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 43 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 42 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 42 transition count 111
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 195 place count 35 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 199 place count 35 transition count 100
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 4 with 4 rules applied. Total rules applied 203 place count 33 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 207 place count 33 transition count 94
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 211 place count 31 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 215 place count 31 transition count 88
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 219 place count 29 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 223 place count 29 transition count 82
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 227 place count 27 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 231 place count 27 transition count 76
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 235 place count 25 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 239 place count 25 transition count 70
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 243 place count 23 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 247 place count 23 transition count 64
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 251 place count 21 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 255 place count 21 transition count 58
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 259 place count 19 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 263 place count 19 transition count 52
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 267 place count 17 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 271 place count 17 transition count 46
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 275 place count 15 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 279 place count 15 transition count 40
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 283 place count 13 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 287 place count 13 transition count 34
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 291 place count 11 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 295 place count 11 transition count 28
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 299 place count 9 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 303 place count 9 transition count 22
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 307 place count 7 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 311 place count 7 transition count 16
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 315 place count 5 transition count 14
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 319 place count 5 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 323 place count 3 transition count 8
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 19 with 5 rules applied. Total rules applied 328 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 50 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:39] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:39] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2022-05-16 02:13:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:13:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:40] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 97 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA BART-COL-050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-050-LTLFireability-03 finished in 532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (G(p0)&&p1))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 6 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:13:40] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:13:40] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:13:40] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:13:40] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:13:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:40] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s0 1), p1:(AND (GEQ s0 1) (OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s68 1) (GEQ s16 1) (GEQ s60 1) (GEQ s8 1) (GEQ s64 1) (GEQ s52 1) (GEQ s56 ...], 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 94 steps with 0 reset in 1 ms.
FORMULA BART-COL-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-04 finished in 450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&F(G(p0)))))'
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 25 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:13:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:40] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:13:40] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 02:13:40] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 02:13:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:40] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/132 places, 119/202 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-05 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:(GEQ s0 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 98 steps with 0 reset in 0 ms.
FORMULA BART-COL-050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-05 finished in 419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F((X(p0) U F(p1))) U G((p0 U p2))))'
Support contains 78 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 132 transition count 179
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Applied a total of 46 rules in 5 ms. Remains 109 /132 variables (removed 23) and now considering 179/202 (removed 23) transitions.
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:13:41] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:13:41] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:13:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:41] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-05-16 02:13:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:13:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:41] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/132 places, 179/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/132 places, 179/202 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), true, (OR (AND p1 p2) (AND p0 p1)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BART-COL-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(OR p2 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (GEQ s20 1) (GEQ s101 1) (GEQ s22 1) (GEQ s99 1) (GEQ s24 1) (GEQ s105 1) (GEQ s26 1) (GEQ s103 1) (GEQ s12 1) (GEQ s93 1) (GEQ s14 1) (GEQ s91 1) ...], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 39574 steps with 2 reset in 202 ms.
FORMULA BART-COL-050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-06 finished in 820 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(X(X(p0)))))&&F(p1))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 4 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:13:41] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:13:42] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:13:42] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:13:42] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:13:42] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:13:42] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : BART-COL-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s85 1) (GEQ s88 1) (GEQ s86 1) (GEQ s87 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 1)), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BART-COL-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-07 finished in 652 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)&&p0))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 11 rules applied. Total rules applied 13 place count 130 transition count 191
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 22 place count 121 transition count 191
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 22 place count 121 transition count 186
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 32 place count 116 transition count 186
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 38 place count 110 transition count 180
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 110 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 110 transition count 179
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 48 place count 107 transition count 176
Iterating global reduction 4 with 3 rules applied. Total rules applied 51 place count 107 transition count 176
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 54 place count 104 transition count 173
Iterating global reduction 4 with 3 rules applied. Total rules applied 57 place count 104 transition count 173
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 101 transition count 170
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 101 transition count 170
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 99 transition count 168
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 99 transition count 168
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 69 place count 97 transition count 166
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 97 transition count 166
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 96 transition count 165
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 96 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 85 place count 90 transition count 159
Applied a total of 85 rules in 18 ms. Remains 90 /132 variables (removed 42) and now considering 159/202 (removed 43) transitions.
// Phase 1: matrix 159 rows 90 cols
[2022-05-16 02:13:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:42] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 159 rows 90 cols
[2022-05-16 02:13:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:42] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2022-05-16 02:13:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 159 rows 90 cols
[2022-05-16 02:13:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:42] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/132 places, 159/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/132 places, 159/202 transitions.
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-COL-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s16 1) (LT s20 1) (LT s8 1) (LT s63 1) (LT s12 1) (LT s55 1) (LT s4 1) (LT s59 1) (LT s47 1) (LT s51 1) (LT s38 1) (LT s87 1) (LT s42 1) (LT s...], 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 430 reset in 323 ms.
Stack based approach found an accepted trace after 541 steps with 3 reset with depth 269 and stack size 269 in 2 ms.
FORMULA BART-COL-050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-050-LTLFireability-09 finished in 637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(F(p0))))&&F(p0))))'
Support contains 9 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 178 edges and 132 vertex of which 41 / 132 are part of one of the 1 SCC in 2 ms
Free SCC test removed 40 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 92 transition count 71
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 125 place count 36 transition count 59
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 137 place count 32 transition count 51
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 149 place count 28 transition count 43
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 157 place count 24 transition count 39
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 162 place count 19 transition count 34
Iterating global reduction 5 with 5 rules applied. Total rules applied 167 place count 19 transition count 34
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 172 place count 19 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 19 transition count 28
Applied a total of 173 rules in 17 ms. Remains 19 /132 variables (removed 113) and now considering 28/202 (removed 174) transitions.
// Phase 1: matrix 28 rows 19 cols
[2022-05-16 02:13:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:43] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2022-05-16 02:13:43] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:13:43] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-16 02:13:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2022-05-16 02:13:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:43] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/132 places, 28/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/132 places, 28/202 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s8 1) (LT s7 1) (LT s14 1) (LT s17 1) (LT s15 1) (LT s16 1) (LT s2 1) (LT s1 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA BART-COL-050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-10 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 128 place count 68 transition count 134
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 64 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 58 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 58 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 58 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 54 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 54 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 51 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 51 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 48 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 48 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 46 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 46 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 44 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 44 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 43 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 43 transition count 112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 193 place count 36 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 36 transition count 101
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 4 with 4 rules applied. Total rules applied 201 place count 34 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 205 place count 34 transition count 95
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 209 place count 32 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 213 place count 32 transition count 89
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 217 place count 30 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 221 place count 30 transition count 83
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 225 place count 28 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 229 place count 28 transition count 77
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 233 place count 26 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 237 place count 26 transition count 71
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 241 place count 24 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 245 place count 24 transition count 65
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 249 place count 22 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 253 place count 22 transition count 59
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 257 place count 20 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 261 place count 20 transition count 53
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 265 place count 18 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 269 place count 18 transition count 47
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 273 place count 16 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 277 place count 16 transition count 41
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 281 place count 14 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 285 place count 14 transition count 35
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 289 place count 12 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 293 place count 12 transition count 29
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 297 place count 10 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 301 place count 10 transition count 23
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 305 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 309 place count 8 transition count 17
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 313 place count 6 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 317 place count 6 transition count 11
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 321 place count 4 transition count 9
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 326 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 328 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 328 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 19 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:13:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:43] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:13:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:43] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-16 02:13:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:13:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:13:43] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 57 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 1 ms.
FORMULA BART-COL-050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-050-LTLFireability-12 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p0))'
Support contains 9 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 5 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:13:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:43] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:13:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:43] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:13:43] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:13:43] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}]], initial=1, aps=[p0:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s85 1) (GEQ s88 1) (GEQ s86 1) (GEQ s87 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-COL-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-14 finished in 275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1)||F(p2))))'
Support contains 97 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 26 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 127 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 119 transition count 189
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 41 place count 107 transition count 177
Applied a total of 41 rules in 7 ms. Remains 107 /132 variables (removed 25) and now considering 177/202 (removed 25) transitions.
// Phase 1: matrix 177 rows 107 cols
[2022-05-16 02:13:44] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-16 02:13:44] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 177 rows 107 cols
[2022-05-16 02:13:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:44] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-16 02:13:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 177 rows 107 cols
[2022-05-16 02:13:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:13:44] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/132 places, 177/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/132 places, 177/202 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-COL-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (GEQ s15 1) (GEQ s19 1) (GEQ s7 1) (GEQ s66 1) (GEQ s11 1) (GEQ s58 1) (GEQ s3 1) (GEQ s62 1) (GEQ s50 1) (GEQ s54 1) (GEQ s41 1) (GEQ s96 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-COL-050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-15 finished in 253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)||F(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((p0&&(F((G(X(p1)) U p2))||p3)))))'
[2022-05-16 02:13:44] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8793482900466746085
[2022-05-16 02:13:44] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2022-05-16 02:13:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:13:44] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2022-05-16 02:13:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:13:44] [INFO ] Applying decomposition
[2022-05-16 02:13:44] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2022-05-16 02:13:44] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17256091200034482656.txt' '-o' '/tmp/graph17256091200034482656.bin' '-w' '/tmp/graph17256091200034482656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17256091200034482656.bin' '-l' '-1' '-v' '-w' '/tmp/graph17256091200034482656.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:13:44] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:13:44] [INFO ] Decomposing Gal with order
[2022-05-16 02:13:44] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8793482900466746085
[2022-05-16 02:13:44] [INFO ] Rewriting arrays to variables to allow decomposition.
Running compilation step : cd /tmp/ltsmin8793482900466746085;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 02:13:44] [INFO ] Removed a total of 44 redundant transitions.
[2022-05-16 02:13:44] [INFO ] Flatten gal took : 29 ms
[2022-05-16 02:13:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2022-05-16 02:13:44] [INFO ] Time to serialize gal into /tmp/LTLFireability14314869153979917430.gal : 3 ms
[2022-05-16 02:13:44] [INFO ] Time to serialize properties into /tmp/LTLFireability3411913605166075731.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14314869153979917430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3411913605166075731.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G(X((F("(i6.u0.TrainState_42>=1)"))||(F("((((((((u1.TrainState_61<1)&&(i4.u38.TrainState_191<1))&&((u1.TrainState_63<1)&&(i5.i0.i1....1970
Formula 0 simplified : !GX(F"(i6.u0.TrainState_42>=1)" | F"((((((((u1.TrainState_61<1)&&(i4.u38.TrainState_191<1))&&((u1.TrainState_63<1)&&(i5.i0.i1.u48.Tr...1959
Compilation finished in 366 ms.
Running link step : cd /tmp/ltsmin8793482900466746085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin8793482900466746085;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((<>((LTLAPp0==true))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: LTL layer: formula: [](X((<>((LTLAPp0==true))||<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.002: "[](X((<>((LTLAPp0==true))||<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.081: DFS-FIFO for weak LTL, using special progress label 207
pins2lts-mc-linux64( 0/ 8), 0.081: There are 208 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.081: State length is 133, there are 205 groups
pins2lts-mc-linux64( 0/ 8), 0.081: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.081: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.081: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.081: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 3.926: ~120 levels ~960 states ~65008 transitions
pins2lts-mc-linux64( 3/ 8), 6.071: ~237 levels ~1920 states ~97848 transitions
pins2lts-mc-linux64( 6/ 8), 8.519: ~456 levels ~3840 states ~133632 transitions
pins2lts-mc-linux64( 6/ 8), 8.725: ~473 levels ~7680 states ~140040 transitions
pins2lts-mc-linux64( 6/ 8), 9.275: ~473 levels ~15360 states ~155704 transitions
pins2lts-mc-linux64( 2/ 8), 10.093: ~446 levels ~30720 states ~193296 transitions
pins2lts-mc-linux64( 6/ 8), 13.111: ~473 levels ~61440 states ~267560 transitions
pins2lts-mc-linux64( 4/ 8), 16.722: ~472 levels ~122880 states ~431800 transitions
pins2lts-mc-linux64( 4/ 8), 23.309: ~472 levels ~245760 states ~789328 transitions
pins2lts-mc-linux64( 4/ 8), 28.045: ~472 levels ~491520 states ~1502696 transitions
pins2lts-mc-linux64( 4/ 8), 30.271: ~472 levels ~983040 states ~3129960 transitions
pins2lts-mc-linux64( 4/ 8), 33.938: ~472 levels ~1966080 states ~6469792 transitions
pins2lts-mc-linux64( 4/ 8), 40.778: ~472 levels ~3932160 states ~13404416 transitions
pins2lts-mc-linux64( 4/ 8), 55.153: ~472 levels ~7864320 states ~27661304 transitions
pins2lts-mc-linux64( 4/ 8), 84.393: ~472 levels ~15728640 states ~57800224 transitions
pins2lts-mc-linux64( 4/ 8), 144.299: ~472 levels ~31457280 states ~121586552 transitions
pins2lts-mc-linux64( 2/ 8), 264.278: ~446 levels ~62914560 states ~247948496 transitions
pins2lts-mc-linux64( 4/ 8), 503.397: ~472 levels ~125829120 states ~521196592 transitions
pins2lts-mc-linux64( 4/ 8), 1011.919: ~472 levels ~251658240 states ~1058131784 transitions
pins2lts-mc-linux64( 3/ 8), 1156.018: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1156.066:
pins2lts-mc-linux64( 0/ 8), 1156.066: mean standard work distribution: 100.0% (states) 100.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 1156.066:
pins2lts-mc-linux64( 0/ 8), 1156.066: Explored 134156866 states 576214552 transitions, fanout: 4.295
pins2lts-mc-linux64( 0/ 8), 1156.066: Total exploration time 1155.980 sec (1155.920 sec minimum, 1155.941 sec on average)
pins2lts-mc-linux64( 0/ 8), 1156.066: States per second: 116055, Transitions per second: 498464
pins2lts-mc-linux64( 0/ 8), 1156.066:
pins2lts-mc-linux64( 0/ 8), 1156.066: Progress states detected: 157
pins2lts-mc-linux64( 0/ 8), 1156.066: Redundant explorations: -0.0451
pins2lts-mc-linux64( 0/ 8), 1156.066:
pins2lts-mc-linux64( 0/ 8), 1156.066: Queue width: 8B, total height: 2052, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1156.066: Tree memory: 1029.0MB, 8.0 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 1156.066: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 1156.066: Stored 203 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1156.066: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1156.066: Est. total memory use: 1029.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8793482900466746085;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((<>((LTLAPp0==true))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8793482900466746085;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((<>((LTLAPp0==true))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 02:34:45] [INFO ] Applying decomposition
[2022-05-16 02:34:46] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:34:46] [INFO ] Decomposing Gal with order
[2022-05-16 02:34:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:34:46] [INFO ] Removed a total of 140 redundant transitions.
[2022-05-16 02:34:46] [INFO ] Flatten gal took : 46 ms
[2022-05-16 02:34:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 02:34:46] [INFO ] Time to serialize gal into /tmp/LTLFireability12230768184887716105.gal : 3 ms
[2022-05-16 02:34:46] [INFO ] Time to serialize properties into /tmp/LTLFireability7204551470797184626.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12230768184887716105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7204551470797184626.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G(X((F("(trainidspeeddistance42.TrainState_42>=1)"))||(F("((((((((trainidspeeddistance61.TrainState_61<1)&&(trainidspeeddistance191...3127
Formula 0 simplified : !GX(F"(trainidspeeddistance42.TrainState_42>=1)" | F"((((((((trainidspeeddistance61.TrainState_61<1)&&(trainidspeeddistance191.Train...3116
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:55:47] [INFO ] Flatten gal took : 24 ms
[2022-05-16 02:55:47] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 02:55:47] [INFO ] Transformed 132 places.
[2022-05-16 02:55:47] [INFO ] Transformed 202 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 02:55:47] [INFO ] Time to serialize gal into /tmp/LTLFireability1818144169379856622.gal : 1 ms
[2022-05-16 02:55:47] [INFO ] Time to serialize properties into /tmp/LTLFireability18199386793802967425.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1818144169379856622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18199386793802967425.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X((F("(TrainState_42>=1)"))||(F("((((((((TrainState_61<1)&&(TrainState_191<1))&&((TrainState_63<1)&&(TrainState_189<1)))&&(((Trai...1515
Formula 0 simplified : !GX(F"(TrainState_42>=1)" | F"((((((((TrainState_61<1)&&(TrainState_191<1))&&((TrainState_63<1)&&(TrainState_189<1)))&&(((TrainState...1504
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-COL-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BART-COL-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 r006-tajo-165245689500580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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