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-165245689500564.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-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689500564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 11K Apr 29 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 29 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 20:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 20:55 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.3K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 201K 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-030-LTLFireability-00
FORMULA_NAME BART-COL-030-LTLFireability-01
FORMULA_NAME BART-COL-030-LTLFireability-02
FORMULA_NAME BART-COL-030-LTLFireability-03
FORMULA_NAME BART-COL-030-LTLFireability-04
FORMULA_NAME BART-COL-030-LTLFireability-05
FORMULA_NAME BART-COL-030-LTLFireability-06
FORMULA_NAME BART-COL-030-LTLFireability-07
FORMULA_NAME BART-COL-030-LTLFireability-08
FORMULA_NAME BART-COL-030-LTLFireability-09
FORMULA_NAME BART-COL-030-LTLFireability-10
FORMULA_NAME BART-COL-030-LTLFireability-11
FORMULA_NAME BART-COL-030-LTLFireability-12
FORMULA_NAME BART-COL-030-LTLFireability-13
FORMULA_NAME BART-COL-030-LTLFireability-14
FORMULA_NAME BART-COL-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652666880847

Running Version 202205111006
[2022-05-16 02:08:01] [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:08:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:08:01] [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:08:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 02:08:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2022-05-16 02:08:02] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2022-05-16 02:08:02] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 17753 PT places and 4.221688536E10 transition bindings in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 02:08:02] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 5 ms.
[2022-05-16 02:08:02] [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.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
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 30
Arc [3:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2022-05-16 02:08:02] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 201 ms.
[2022-05-16 02:08:02] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
[2022-05-16 02:08:02] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:08:02] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:08:02] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:08:02] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:08:02] [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-030-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-030-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-030-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-030-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-030-LTLFireability-13 TRUE 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 6 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:08:03] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-16 02:08:03] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:08:03] [INFO ] Computed 1 place invariants in 12 ms
[2022-05-16 02:08:03] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:08:03] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-16 02:08:03] [INFO ] Dead Transitions using invariants and state equation in 108 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:08:03] [INFO ] Flatten gal took : 28 ms
[2022-05-16 02:08:03] [INFO ] Flatten gal took : 16 ms
[2022-05-16 02:08:03] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 1578 steps, including 0 resets, run visited all 7 properties in 14 ms. (steps per millisecond=112 )
FORMULA BART-COL-030-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-COL-030-LTLFireability-02 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' '!(X((G(X(G(F(G(!p0))))) U X(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 10 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:08:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:03] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:08:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:03] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:08:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:03] [INFO ] Dead Transitions using invariants and state equation in 86 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 178 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
Running random walk in product with property : BART-COL-030-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s42 1) (GEQ s88 1) (GEQ s87 1) (GEQ s86 1) (GEQ s85 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 257 ms.
Stack based approach found an accepted trace after 22739 steps with 0 reset with depth 22740 and stack size 14582 in 61 ms.
FORMULA BART-COL-030-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-030-LTLFireability-00 finished in 711 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(X(F(p0)))||!(p1 U G(p2))))))'
Support contains 10 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 12 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:08:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:04] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:08:04] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:08:04] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-16 02:08:04] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:08:04] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 02:08:04] [INFO ] Dead Transitions using invariants and state equation in 73 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 217 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : BART-COL-030-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s42 1) (LT s88 1) (LT s87 1) (LT s86 1) (LT s85 1) (LT s54 1) (LT s55 1) (LT s56 1) (LT s41 1)), p2:(GEQ s1 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 533 reset in 289 ms.
Product exploration explored 100000 steps with 542 reset in 244 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 44 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 2385 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=477 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2))]
Knowledge based reduction with 3 factoid took 80 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 38 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 10 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 4 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:08:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:05] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:08:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-16 02:08:05] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:08:05] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:08:05] [INFO ] Dead Transitions using invariants and state equation in 62 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 p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 47 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 158 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=158 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2))]
Knowledge based reduction with 3 factoid took 93 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 48 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 508 reset in 235 ms.
Product exploration explored 100000 steps with 519 reset in 238 ms.
Built C files in :
/tmp/ltsmin8899401447775579650
[2022-05-16 02:08:06] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2022-05-16 02:08:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:08:06] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2022-05-16 02:08:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:08:06] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2022-05-16 02:08:06] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:08:06] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8899401447775579650
Running compilation step : cd /tmp/ltsmin8899401447775579650;'/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 431 ms.
Running link step : cd /tmp/ltsmin8899401447775579650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin8899401447775579650;'/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/stateBased14761878650272390662.hoa' '--buchi-type=spotba'
LTSmin run took 223 ms.
FORMULA BART-COL-030-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-030-LTLFireability-01 finished in 3083 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||F((G((X(p1)&&p1))||G(!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 16 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:08:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:07] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:08:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:07] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-16 02:08:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:08:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:07] [INFO ] Dead Transitions using invariants and state equation in 64 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 47 ms :[false, false]
Running random walk in product with property : BART-COL-030-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s80 1) (GEQ s12 1) (GEQ s78 1) (GEQ s14 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 917 reset in 250 ms.
Product exploration explored 100000 steps with 927 reset in 261 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[false, false]
Finished random walk after 218 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=218 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 45 ms :[false, false]
Stuttering acceptance computed with spot in 51 ms :[false, false]
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 3 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:08:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:08] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:08:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:08:08] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-16 02:08:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:08:08] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 02:08:08] [INFO ] Dead Transitions using invariants and state equation in 63 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) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[false, false]
Finished random walk after 187 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=93 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[false, false]
Stuttering acceptance computed with spot in 44 ms :[false, false]
Stuttering acceptance computed with spot in 51 ms :[false, false]
Product exploration explored 100000 steps with 918 reset in 251 ms.
Product exploration explored 100000 steps with 920 reset in 279 ms.
Built C files in :
/tmp/ltsmin1341821423381909179
[2022-05-16 02:08:10] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2022-05-16 02:08:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:08:10] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2022-05-16 02:08:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:08:10] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2022-05-16 02:08:10] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:08:10] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1341821423381909179
Running compilation step : cd /tmp/ltsmin1341821423381909179;'/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 248 ms.
Running link step : cd /tmp/ltsmin1341821423381909179;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin1341821423381909179;'/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/stateBased7571903078525629357.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 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:08:25] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:08:25] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:08:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:08:25] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-16 02:08:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:08:25] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:08:25] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin2841596663027706635
[2022-05-16 02:08:25] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2022-05-16 02:08:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:08:25] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2022-05-16 02:08:25] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:08:25] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2022-05-16 02:08:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:08:25] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2841596663027706635
Running compilation step : cd /tmp/ltsmin2841596663027706635;'/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 274 ms.
Running link step : cd /tmp/ltsmin2841596663027706635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2841596663027706635;'/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/stateBased13301591889800377630.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:08:40] [INFO ] Flatten gal took : 12 ms
[2022-05-16 02:08:40] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:08:40] [INFO ] Time to serialize gal into /tmp/LTL11060340496188909365.gal : 3 ms
[2022-05-16 02:08:40] [INFO ] Time to serialize properties into /tmp/LTL9621931796015686584.ltl : 2 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/LTL11060340496188909365.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9621931796015686584.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/LTL1106034...267
Read 1 LTL properties
Checking formula 0 : !(((G(F("(TrainState_42>=1)")))||(F((G((X("((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||...4571
Formula 0 simplified : !(GF"(TrainState_42>=1)" | F(G("((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainS...4554
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:08:55] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:08:55] [INFO ] Applying decomposition
[2022-05-16 02:08:55] [INFO ] Flatten gal took : 12 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/graph15193937186974321165.txt' '-o' '/tmp/graph15193937186974321165.bin' '-w' '/tmp/graph15193937186974321165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15193937186974321165.bin' '-l' '-1' '-v' '-w' '/tmp/graph15193937186974321165.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:08:55] [INFO ] Decomposing Gal with order
[2022-05-16 02:08:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:08:55] [INFO ] Removed a total of 61 redundant transitions.
[2022-05-16 02:08:55] [INFO ] Flatten gal took : 29 ms
[2022-05-16 02:08:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 6 ms.
[2022-05-16 02:08:55] [INFO ] Time to serialize gal into /tmp/LTL2404875388709106148.gal : 3 ms
[2022-05-16 02:08:55] [INFO ] Time to serialize properties into /tmp/LTL10811933912560228735.ltl : 2 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/LTL2404875388709106148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10811933912560228735.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/LTL2404875...246
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i3.i3.u0.TrainState_42>=1)")))||(F((G((X("((((((((i0.i0.u12.TrainState_90>=1)||(i0.i0.u12.TrainState_88>=1))||((i3.i3.u0.Tra...6311
Formula 0 simplified : !(GF"(i3.i3.u0.TrainState_42>=1)" | F(G("((((((((i0.i0.u12.TrainState_90>=1)||(i0.i0.u12.TrainState_88>=1))||((i3.i3.u0.TrainState_4...6294
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8682882716879633062
[2022-05-16 02:09:10] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8682882716879633062
Running compilation step : cd /tmp/ltsmin8682882716879633062;'/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 272 ms.
Running link step : cd /tmp/ltsmin8682882716879633062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8682882716879633062;'/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))&&(LTLAPp1==true)))||[](!(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-030-LTLFireability-04 finished in 78532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 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.
Performed 1 Post agglomeration using F-continuation condition.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
Applied a total of 328 rules in 41 ms. Remains 3 /132 variables (removed 129) and now considering 3/202 (removed 199) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 02:09:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:26] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 02:09:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:09:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-16 02:09:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 02:09:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:09:26] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/132 places, 3/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/132 places, 3/202 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-030-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1), p1:(LT s0 1)], nbAcceptance=2, 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 66 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 18 in 1 ms.
FORMULA BART-COL-030-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-030-LTLFireability-05 finished in 228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(F((X(p0)&&p1))) U (F(!G(p2))&&p1))))'
Support contains 122 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 1 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:09:26] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:09:26] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:26] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:09:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:26] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (AND p1 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 p0), (NOT p2), p0]
Running random walk in product with property : BART-COL-030-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 p0), acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}, { cond=p1, acceptance={} source=6 dest: 8}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=3, aps=[p1:(GEQ s0 1), p2:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s114 1) (GEQ s12 1) (GEQ s112 1) (GEQ s14 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 577 steps with 0 reset in 2 ms.
FORMULA BART-COL-030-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-030-LTLFireability-07 finished in 495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U !p1)))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 3 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:09:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:26] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:09:26] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:26] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:09:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:26] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 82 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : BART-COL-030-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s111 1) (GEQ s12 1) (GEQ s109 1) (GEQ s14 1) (GEQ s115 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-030-LTLFireability-08 finished in 285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(!X(G(p0))))) U !F(p1)))'
Support contains 98 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 201
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 9 rules applied. Total rules applied 10 place count 131 transition count 193
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 18 place count 123 transition count 193
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 46 place count 109 transition count 179
Applied a total of 46 rules in 9 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:09:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:09:27] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:09:27] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:27] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-16 02:09:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 02:09:27] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:27] [INFO ] Dead Transitions using invariants and state equation in 74 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 91 ms :[p1, p0, (AND p0 (NOT p1))]
Running random walk in product with property : BART-COL-030-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s39 1) (GEQ s104 1) (GEQ s103 1) (GEQ s102 1) (GEQ s101 1) (GEQ s72 1) (GEQ s73 1) (GEQ s74 1) (GEQ s38 1)), p0:(AND (OR (GEQ s91 1) (GEQ s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1785 reset in 335 ms.
Stack based approach found an accepted trace after 18765 steps with 354 reset with depth 274 and stack size 274 in 66 ms.
FORMULA BART-COL-030-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-030-LTLFireability-09 finished in 671 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(F(p1))&&p2)||p0)))'
Support contains 70 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 9 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:09:27] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:27] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:09:27] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:09:27] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-16 02:09:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2022-05-16 02:09:27] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:09:27] [INFO ] Dead Transitions using invariants and state equation in 85 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 126 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BART-COL-030-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1)), p2:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s80 1) (GEQ s12 1) (GEQ s78 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 758 reset in 305 ms.
Product exploration explored 100000 steps with 767 reset in 380 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (OR p0 p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 559 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p1)]
Finished random walk after 62 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (OR p0 p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p2)), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2)))
Knowledge based reduction with 12 factoid took 556 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-COL-030-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-030-LTLFireability-14 finished in 2337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 5 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:09:30] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:30] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:09:30] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:09:30] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 02:09:30] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:09:30] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-030-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s45 1) (LT s43 1) (LT s2 1) (LT s4 1) (LT s6 1) (LT s8 1) (LT s10 1) (LT s111 1) (LT s12 1) (LT s109 1) (LT s14 1) (LT s115 1) (LT s16 1) (LT ...], 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 1 ms.
FORMULA BART-COL-030-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-030-LTLFireability-15 finished in 340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||F((G((X(p1)&&p1))||G(!p1)))))'
[2022-05-16 02:09:30] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2699050845660230617
[2022-05-16 02:09:30] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2022-05-16 02:09:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:09:30] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2022-05-16 02:09:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:09:30] [INFO ] Applying decomposition
[2022-05-16 02:09:30] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2022-05-16 02:09:30] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:09:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2699050845660230617
Running compilation step : cd /tmp/ltsmin2699050845660230617;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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:09:30] [INFO ] Flatten gal took : 11 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/graph3120055406729861244.txt' '-o' '/tmp/graph3120055406729861244.bin' '-w' '/tmp/graph3120055406729861244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3120055406729861244.bin' '-l' '-1' '-v' '-w' '/tmp/graph3120055406729861244.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:09:30] [INFO ] Decomposing Gal with order
[2022-05-16 02:09:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:09:30] [INFO ] Removed a total of 70 redundant transitions.
[2022-05-16 02:09:30] [INFO ] Flatten gal took : 23 ms
[2022-05-16 02:09:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 6 ms.
[2022-05-16 02:09:30] [INFO ] Time to serialize gal into /tmp/LTLFireability7612608597015993931.gal : 3 ms
[2022-05-16 02:09:30] [INFO ] Time to serialize properties into /tmp/LTLFireability2367345055096052726.ltl : 2 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/LTLFireability7612608597015993931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2367345055096052726.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...267
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i0.u0.TrainState_42>=1)")))||(F((G((X("((((((((i1.u16.TrainState_90>=1)||(i1.u16.TrainState_88>=1))||((i0.u0.TrainState_43>=...6122
Formula 0 simplified : !(GF"(i0.u0.TrainState_42>=1)" | F(G("((((((((i1.u16.TrainState_90>=1)||(i1.u16.TrainState_88>=1))||((i0.u0.TrainState_43>=1)||(i0.u...6105
Compilation finished in 378 ms.
Running link step : cd /tmp/ltsmin2699050845660230617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2699050845660230617;'/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))&&(LTLAPp1==true)))||[](!(LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: LTL layer: formula: ([](<>((LTLAPp0==true)))||<>(([]((X((LTLAPp1==true))&&(LTLAPp1==true)))||[](!(LTLAPp1==true)))))
pins2lts-mc-linux64( 4/ 8), 0.003: "([](<>((LTLAPp0==true)))||<>(([]((X((LTLAPp1==true))&&(LTLAPp1==true)))||[](!(LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: There are 205 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.029: State length is 133, there are 215 groups
pins2lts-mc-linux64( 0/ 8), 0.029: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.029: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.029: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.029: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.350: [Blue] ~120 levels ~960 states ~37168 transitions
pins2lts-mc-linux64( 2/ 8), 0.369: [Blue] ~151 levels ~1920 states ~38112 transitions
pins2lts-mc-linux64( 2/ 8), 0.397: [Blue] ~151 levels ~3840 states ~41248 transitions
pins2lts-mc-linux64( 2/ 8), 0.447: [Blue] ~151 levels ~7680 states ~46736 transitions
pins2lts-mc-linux64( 2/ 8), 0.539: [Blue] ~151 levels ~15360 states ~57616 transitions
pins2lts-mc-linux64( 3/ 8), 0.661: [Blue] ~359 levels ~30720 states ~122096 transitions
pins2lts-mc-linux64( 3/ 8), 0.873: [Blue] ~359 levels ~61440 states ~192512 transitions
pins2lts-mc-linux64( 3/ 8), 1.278: [Blue] ~359 levels ~122880 states ~335232 transitions
pins2lts-mc-linux64( 1/ 8), 1.916: [Blue] ~338 levels ~245760 states ~622944 transitions
pins2lts-mc-linux64( 1/ 8), 3.005: [Blue] ~338 levels ~491520 states ~1226288 transitions
pins2lts-mc-linux64( 1/ 8), 4.723: [Blue] ~338 levels ~983040 states ~2450112 transitions
pins2lts-mc-linux64( 1/ 8), 7.914: [Blue] ~338 levels ~1966080 states ~4927632 transitions
pins2lts-mc-linux64( 1/ 8), 14.285: [Blue] ~338 levels ~3932160 states ~10551408 transitions
pins2lts-mc-linux64( 5/ 8), 26.662: [Blue] ~413 levels ~7864320 states ~20974176 transitions
pins2lts-mc-linux64( 5/ 8), 50.585: [Blue] ~420 levels ~15728640 states ~42190272 transitions
pins2lts-mc-linux64( 5/ 8), 102.387: [Blue] ~423 levels ~31457280 states ~89292464 transitions
pins2lts-mc-linux64( 5/ 8), 200.664: [Blue] ~423 levels ~62914560 states ~192963952 transitions
pins2lts-mc-linux64( 5/ 8), 411.477: [Blue] ~423 levels ~125829120 states ~402635136 transitions
pins2lts-mc-linux64( 5/ 8), 477.958: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 478.025:
pins2lts-mc-linux64( 0/ 8), 478.025: Explored 134162212 states 482389090 transitions, fanout: 3.596
pins2lts-mc-linux64( 0/ 8), 478.025: Total exploration time 477.980 sec (477.930 sec minimum, 477.942 sec on average)
pins2lts-mc-linux64( 0/ 8), 478.025: States per second: 280686, Transitions per second: 1009224
pins2lts-mc-linux64( 0/ 8), 478.025:
pins2lts-mc-linux64( 0/ 8), 478.025: State space has 134217264 states, 67080103 are accepting
pins2lts-mc-linux64( 0/ 8), 478.025: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 478.025: blue states: 134162212 (99.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 478.025: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 478.025: all-red states: 134160205 (99.96%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 478.025:
pins2lts-mc-linux64( 0/ 8), 478.025: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 478.026:
pins2lts-mc-linux64( 0/ 8), 478.026: Queue width: 8B, total height: 2372, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 478.026: Tree memory: 1250.0MB, 9.8 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 478.026: Tree fill ratio (roots/leafs): 99.0%/88.0%
pins2lts-mc-linux64( 0/ 8), 478.026: Stored 202 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 478.026: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 478.026: Est. total memory use: 1250.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2699050845660230617;'/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))&&(LTLAPp1==true)))||[](!(LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2699050845660230617;'/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))&&(LTLAPp1==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:30:00] [INFO ] Applying decomposition
[2022-05-16 02:30:00] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:30:00] [INFO ] Decomposing Gal with order
[2022-05-16 02:30:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:30:00] [INFO ] Removed a total of 140 redundant transitions.
[2022-05-16 02:30:00] [INFO ] Flatten gal took : 26 ms
[2022-05-16 02:30:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 02:30:00] [INFO ] Time to serialize gal into /tmp/LTLFireability6225861598492176605.gal : 7 ms
[2022-05-16 02:30:00] [INFO ] Time to serialize properties into /tmp/LTLFireability3285892084298123982.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/LTLFireability6225861598492176605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3285892084298123982.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...267
Read 1 LTL properties
Checking formula 0 : !(((G(F("(trainidspeeddistance42.TrainState_42>=1)")))||(F((G((X("((((((((trainidspeeddistance90.TrainState_90>=1)||(trainidspeeddista...9361
Formula 0 simplified : !(GF"(trainidspeeddistance42.TrainState_42>=1)" | F(G("((((((((trainidspeeddistance90.TrainState_90>=1)||(trainidspeeddistance88.Tra...9344
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:50:30] [INFO ] Flatten gal took : 206 ms
[2022-05-16 02:50:31] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 02:50:31] [INFO ] Transformed 132 places.
[2022-05-16 02:50:31] [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:50:31] [INFO ] Time to serialize gal into /tmp/LTLFireability328458542232331072.gal : 4 ms
[2022-05-16 02:50:31] [INFO ] Time to serialize properties into /tmp/LTLFireability8245590976767173922.ltl : 4 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/LTLFireability328458542232331072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8245590976767173922.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...332
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(F("(TrainState_42>=1)")))||(F((G((X("((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||...4571
Formula 0 simplified : !(GF"(TrainState_42>=1)" | F(G("((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainS...4554
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-030"
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-030, 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-165245689500564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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